itcs 2022 accepted papers

(These are not the conference proceedings. or interdisciplinary areas; introducing new mathematical techniques and methodologies; new applications of known techniques). If you experience or witness discrimination, Selected papers from ITCS 2022, after further revisions, will be published in the special issue of the following journals International Journal of Information Technology Convergence and Services (IJITCS) International Journal of Computer Science, Engineering and Applications(IJCSEA) International Journal of Advanced Information Technology . ITCS 2022 - CFP is out. Manipuri has two scripts- Bengali script and Meitei script. Authors will retain full rights over their work. There are different compute engines on the Inference chip which help in acceleration of the Arithmetic operations. Rafael Pass (Cornell University ) The IEEE International Conference on Intelligent Transportation Systems (ITSC) is an annual flagship conference of the IEEE Intelligent Transportation Systems Society (ITSS). ICSE is the premier forum for presenting and discussing the most recent and significant technical research contributions in the field of Software Engineering. . Simultaneous submission to ITCS and to a journal is allowed. The evaluation uses the BLEU metric. Results published/presented/submitted at another archival conference will not be considered for ITCS. Innovations in Computer Science - ICS 2011, Tsinghua University, Beijing, China, January 7-9, 2011. This will take place at noon ET on Tuesday, February 1, 2022. If you experience or witness discrimination, Machine Learning Techniques, Benign, Malignant , Augmentation, BAT algorithm, VGG-16. Participants near to graduation (on either side) will be given an opportunity to present their results, research, plans, personality, In hybrid partitioning, the TCAM table is divided both horizontally and vertically. The conference will be hosted by the Simons Institute and will be held online or in hybrid mode in January 2022 (exact dates TBD). For ACL 2022, we have a two-step submission process, where authors first submit their paper to the ACL Rolling Review (ARR), and then once the paper has received reviews and a meta-review, in a second step, the authors need to commit it to ACL 2022 via the ACL 2022 Commitment site.The deadline for committing a paper to ACL 2022 is January 15, 2022 11:59pm, UTC-12 (i.e., Anywhere On Earth . Smooth and Strong PCPs Ariel Schvartzman; S. Matthew Weinberg; Eitan Zlatin; Albert Zuo. 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA. Russell Impagliazzo; Sam McGuire. Inference outputs from a specific inference unit are stored and are assumed to be golden and further confirmed as golden statistically. ITCS welcomes Sofya Raskhodnikova (Boston University ) such as parallel submissions. In your email, please include basic information (year or intended year of graduation, university, PhD advisor, thesis topic). and their chosen sub-referees. . Cong Shi, Tianming Zhao, Wenjin Zhang, Ahmed Tanvir Mahdad, Zhengkun Ye, Yan Wang, Nitesh Saxena and Yingying Chen. The usage of information-theoretic tools and techniques in achieving other forms of security, including security against computationally-bounded and quantum attackers. To protect your privacy, all features that rely on external API calls from your browser are turned off by default. In this paper, we firstly give an overview of the car security domain then we present the more referenced related works and finally we present our security solution which consists in defining a physical separation between two sets of embedded systems. The results measure values for latency and throughput. The accessibility of the AR system is improved by making it compatible to work on any normal smartphone with a regular camera. We will have a fun evening with a poster session and a reception. They both work; not sure why they don't use the new domain on social media. All submissions will be treated as confidential, and will only be disclosed to the committee Rahul Santhanam (Oxford University ) All submissions will be treated as confidential, and will only be disclosed to the committee and their chosen sub-referees. https://dblp.org/streams/conf/innovations, https://dblp.org/rec/conf/innovations/2023, https://dblp.org/rec/conf/innovations/2022, https://dblp.org/rec/conf/innovations/2021, https://dblp.org/rec/conf/innovations/2020, https://dblp.org/rec/conf/innovations/2019, https://dblp.org/rec/conf/innovations/2018, https://dblp.org/rec/conf/innovations/2017, https://dblp.org/rec/conf/innovations/2016, https://dblp.org/rec/conf/innovations/2015, https://dblp.org/rec/conf/innovations/2014, https://dblp.org/rec/conf/innovations/2013, https://dblp.org/rec/conf/innovations/2012, https://dblp.org/rec/conf/innovations/2011, https://dblp.org/rec/conf/innovations/2010. All the talks are going to be in person. You are free (and encouraged) to post your paper on your web page, the arXiv, etc. By now, it is widely accepted as the right model for capturing the commonly used programming paradigms (such as MapReduce, Hadoop, and Spark) that utilize parallel computation power to manipulate and analyze huge amounts of data. If you would like to use a few slides please dowlowd them here. Thus, an application where the necessity to touch a screen is removed would be highly relevant. Martin Hoefer; Pasin Manurangsi; Alexandros Psomas. Instead, author and institution information is to be uploaded separately. These days, the incidence of roadway disasters is at an all-time high. We conduct experiments showing that this technique substantially increases the prediction time on large dataset. PC members will still be able to access author names in the reviewing process if they feel they need to; the intent of this procedure is to make it easier for PC members to remove unconscious biases. There is high potential for IoT implementation and usage in developing countries, and major barriers must be addressed for IoT delivery. The setup includes a replicated cluster deployed using VMWare. The font size should be at least 11 point and the paper should be single column. Papers may be changed/removed, so do not use this list as permanent). HotCRP.com signin Sign in using your HotCRP.com account. Authors: Elaine Shi, Hao Chung, Ke Wu (Carnegie Mellon University), The Complexity of Infinite-Horizon General-Sum Stochastic Games, Authors: Yujia Jin (Stanford University); Vidya Muthukumar (Georgia Institute of Technology); Aaron Sidford (Stanford University), Black-box Constructive Proofs are Unavoidable, Authors: Lijie Chen (UC Berkeley); Ryan Williams (MIT); Tianqi Yang (Tsinghua University), Authors: Mingda Qiao, Gregory Valiant (Stanford University), False Consensus, Information Theory, and Prediction Markets, Authors: Yuqing Kong (Peking University); Grant Schoenebeck (University of Michigan), Budget Pacing in Repeated Auctions: Regret and Efficiency without Convergence, Authors: Jason Gaitonde (Cornell University); Yingkai Li (Yale University); Bar Light (Microsoft Research New York City); Brendan Lucier (Microsoft Research New England); Aleksandrs Slivkins (Microsoft Research New York City), New Lower Bounds and Derandomization for ACC, and a Derandomization-centric View on the Algorithmic Method, Recovery from Non-Decomposable Distance Oracles, Authors: Zhuangfei Hu (Unafilliated); Xinda Li (University of Waterloo); David Woodruff (Carnegie Mellon University); Hongyang Zhang, Shufan Zhang (University of Waterloo), On Identity Testing and Noncommutative Rank Computation over the Free Skew Field, Authors: V. Arvind (Institute of Mathematical Sciences (HBNI), Chennai); Abhranil Chatterjee (Indian Institute of Technology Bombay, India); Utsab Ghosal, Partha Mukhopadhyay (Chennai Mathematical Institute); Ramya C (Institute of Mathematical Sciences), Rigidity in Mechanism Design and its Applications, Authors: Shahar Dobzinski, Ariel Shaulker (Weizmann Institute), Concentration bounds for quantum states and limitations on the QAOA from polynomial approximations, Authors: Anurag Anshu (Harvard University); Tony Metger (ETH Zurich), Secure Distributed Network Optimization Against Eavesdroppers, Authors: Yael Hitron, Merav Parter (Weizmann Institute); Eylon Yogev (Bar-Ilan University), Private Counting of Distinct and k-Occurring Items in Time Windows, Authors: Badih Ghazi, Ravi Kumar (Google); Pasin Manurangsi (Google Research); Jelani Nelson (UC Berkeley & Google Research), Authors: Omri Ben-Eliezer, Dan Mikulincer, Elchanan Mossel (MIT); Madhu Sudan (Harvard University), Authors: Mirza Ahad Baig (ISTA); Suvradip Chakraborty (ETH Zurich); Stefan Dziembowski (University of Warsaw and IDEAS NCBR); Magorzata Gazka (University of Warsaw); Tomasz Lizurej (University of Warsaw and IDEAS NCBR); Krzysztof Pietrzak (ISTA), Clustering Permutations: New Techniques with Streaming Applications, Authors: Diptarka Chakraborty (National University of Singapore); Debarati Das (Pennsylvania State University); Robert Krauthgamer (Weizmann Institute of Science), Authors: Sourav Chakraborty (Indian Statistical Institute (ISI) , Kolkata, India); Anna Gal (University of Texas at Austin); Sophie Laplante (Universit Paris Cit); Rajat Mittal (Indian Institute of Technology Kanpur); Anupa Sunny (Universit Paris Cit), The Strength of Equality Oracles in Communication, Authors: Toniann Pitassi (Columbia University); Morgan Shirley (University of Toronto); Adi Shraibman (The Academic College of Tel Aviv-Yaffo), Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments, Authors: Varun Gupta (University of Chicago); Ravishankar Krishnaswamy (Microsoft Research India); Sai Sandeep (Carnegie Mellon University); Janani Sundaresan (Rutgers University), A subpolynomial-time algorithm for the free energy of one-dimensional quantum systems in the thermodynamic limit, Authors: Hamza Fawzi (University of Cambridge); Omar Fawzi (Inria, ENS de Lyon); Samuel Scalet (University of Cambridge), An Improved Lower Bound for Matroid Intersection Prophet Inequalities, Authors: Raghuvansh Saxena (Microsoft Research); Santhoshini Velusamy (Harvard University); S. Matthew Weinberg (Princeton University), Authors: Harry Buhrman (QuSoft, CWI, University of Amsterdam); Noah Linden (University of Bristol); Laura Maninska (University of Copenhagen); Ashley Montanaro (Phasecraft Ltd, University of Bristol); Maris Ozols (QuSoft, University of Amsterdam), Authors: Prahladh Harsha (TIFR, Mumbai); Daniel Mitropolsky (Columbia University); Alon Rosen (Bocconi University and Reichman University), Authors: Elette Boyle (Reichman University and NTT Research); Yuval Ishai (Technion); Pierre Meyer (Reichman University and IRIF, Universit Paris Cit, CNRS); Robert Robere (McGill); Gal Yehuda (Technion), Resilience of 3-Majority Dynamics to Non-Uniform Schedulers, Authors: Uri Meir, Rotem Oshman, Ofer Shayevitz, Yuval Volkov (Tel Aviv University), An Algorithmic Bridge Between Hamming and Levenshtein Distances, Authors: Elazar Goldenberg (The Academic College of Tel Aviv-Yaffo); Tomasz Kociumaka (Max Planck Institute for Informatics); Robert Krauthgamer (Weizmann Institute of Science); Barna Saha (University of California San Diego), Lifting to Parity Decision Trees via Stifling, Authors: Arkadev Chattopadhyay (TIFR, Mumbai); Nikhil S. Mande (CWI and QuSoft, Amsterdam); Swagato Sanyal (IIT Kharagpur); Suhail Sherif (Vector Institute, Toronto), Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly, Authors: Gillat Kol (Princeton University); Dmitry Paramonov (Princeton University); Raghuvansh Saxena (Microsoft Research); Huacheng Yu (Princeton University), Noisy Radio Network Lower Bounds Via Noiseless Beeping Lower Bounds, Authors: Klim Efremenko (Ben-Gurion University); Gillat Kol, Dmitry Paramonov (Princeton University); Raghuvansh R. Saxena (Microsoft Research), Authors: Natalia Dobrokhotova-Maikova (Yandex, Moscow, Russia); Alexander Kozachinskiy (Institute for Mathematical and Computational Engineering, Universidad Catlica de Chile \ IMFD & CENIA Chile, Santiago, Chile); Vladimir Podolskii (Courant Institute of Mathematical Sciences, New York University, NY, USA), Algorithms with More Granular Differential Privacy Guarantees, Authors: Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Thomas Steinke (Google Research), Bootstrapping Homomorphic Encryption via Functional Encryption, Authors: Nir Bitansky, Tomer Solomon (Tel Aviv University), Authors: Omrit Filtser (The Open University of Israel); Mayank Goswami (Queens College, City University of New York); Joseph Mitchell (Stony Brook University); Valentin Polishchuk (Linkoping University), Communication Complexity of Inner Product in Symmetric Normed Spaces, Authors: Jaroslaw Blasiok, Alexandr Andoni (Columbia University); Arnold Filtser (Bar Ilan University). Camera-ready . Pure Exploration of Multi-armed Bandit Under Matroid Constraints [conference version] Lijie Chen . 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, January 10-12, 2019, San Diego, California, USA. Registration to attend the conference virtually is free of charge, but please do register to receive relevant links ahead of time. Paper accepted to USENIX Security 2023 February 21, 2023; 2 full papers accepted to WiSec 2023 January 28, 2023; Cybersecurity Program Led By Dr. Saxena Ranks Best! Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, Rehovot, Israel, January 11-13, 2015. The accepted papers will be published under a CC-BY license . Simultaneous submission to ITCS and to a journal is allowed. We expect that authors of accepted papers will make full versions of their papers, with proofs, available before the conference begins. Registration. The paper registration is here; CLOSED. The composition of MAS organizational models can be considered as an effective solution to group different organizational multi-agent systems into a single organizational multi-agent system. Beyond these, there are no formatting requirements. In January 2022, Adrian O. Mapp was sworn in for a historic third term as Mayor of the City of Plainfield. load references from crossref.org and opencitations.net. So please proceed with care and consider checking the information given by OpenAlex. ICLR 2022 Meeting Dates The Tenth annual conference is held Mon. Or, see the events posted on your RecycleCoach calendar. Papers should be pre-registered by September 5. This paper talks about a generic Inference application that has been developed to execute inferences over multiple inputs for various real inference models and stress all the compute engines of the Inference chip. ITCS welcomes both conceptual and technical contributions whose contents will advance and inspire the greater theory community. Antonina Kolokolova (Memorial University of Newfoundland) To demonstrate a generic application that can be used along with any digitized resource, an AR system will be implemented in the project, that can control a personal computer (PC) remotely through hand gestures made by the user on the augmented interface. Paper 2022/008 Beating Classical Impossibility of Position Verification Jiahui Liu, Qipeng Liu, and Luowen Qian Abstract Chandran et al. Accepted papers will be published in the conference proceedings by the IEEE Computer Society Press. Session: Start Date; . Augmented Reality, Gesture Recognition, Generic, Application, Technology, Accessibility. Renato Paes Leme (Google Research ) Accident Detection, Alert System, Accelerometer. Typical accepted papers will be published by LIPIcs in the electronic proceedings of the conference. Standa Zivny (Oxford University), 13th Innovations in Theoretical Computer Science (ITCS), Conference details, registration, and graduating bits. Papers from CRYPTO 2022 CryptoDB General Publications People Papers from CRYPTO 2022 Year Venue Title 2022 CRYPTO (Nondeterministic) Hardness vs. Non-Malleability Abstract Marshall Ball Dana Dachman-Soled Julian Loss 2022 CRYPTO A More Complete Analysis of the Signal Double Ratchet Algorithm Abstract Email Forgot your password? participants. Papers accepted to ITCS should not be submitted to any other archival conferences. Accepted Papers. Posted on August 22, 2021 by Omer Reingold in Uncategorized // 0 Comments. A performance analysis, in terms of accuracy, precision, sensitivity, and specificity is given for all three applications. Mayank Lohani1, Rohan Dasari2, Praveen Thenraj Gunasekaran3, Selvakuberan Karuppasamy4, Subhashini Lakshminarayanan5, 1Data and AI, Advance Technology Centers in India, Accenture, Gurugram, India, 2Data and AI, Advance Technology Centers in India, Accenture, Hyderabad, India, 3Data and AI, Advance Technology Centers in India, Accenture, Chennai, India, 4Data and AI, Advance Technology Centers in India, Accenture, Chennai, India, 5Data and AI, Advance Technology Centers in India, Accenture, Chennai, India. Each presentation should be only 2-3 minutes long. Authors should strive to make their paper accessible not only to experts in their subarea, but also to the theory community at large. Authors should upload a PDF of the paper to easychair. In the current era of computation, machine learning is the most commonly used technique to find out a pattern of highly complex datasets. With the advent of technology and the digitization of almost all interfaces around us, the opportunity of augmenting these digitized resources has escalated. For general conference information, see http://itcs-conf.org/. Abstract submission deadline: Monday, May 16, 2022 01:00 PM PDT. This paper presents a NER model based on the SCIBERT transformer architecture, that has been fine-tuned using a database of over 50,000 research paper abstracts compiled from the top ABDC management journals. On the other hand, few techniques are known for minimizing the objective, especially in the adaptive setting, where . Guy Moshkovitz (CUNY) Firstly, select the desensitization data set provided by UnionPay Commerce and conduct data preprocessing on the data set. machine-learned predictions) on an algorithm's decision. ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6-8, 2021, Virtual Conference. Los Vanhe, Laurent Jeanpierre and Mouaddib Abdel-Illah. Kira Goldner (Boston University ) The Conference looks for significant contributions to all major fields of the Computer Science and Information Technology in . Full paper submission and co-author registration deadline: Thursday, May 19, . Defending against Thru-barrier Stealthy Voice Attacks via Cross-Domain Sensing on Phoneme Sounds. LIPIcs 215, Schloss Dagstuhl - Leibniz-Zentrum fr Informatik 2022, ISBN 978-3-95977-217-4. Anindya De (University of Pennsylvania) Zeeshan Ahmed, Alapan Chaudhuri, Kunwar Grover, Ashwin Rao, Kushagra Garg and Pulak Malhotra, International Institute of Information Technology, Hyderabad. both conceptual and technical contributions whose contents will advance and inspire the greater theory ITCS welcomes both conceptual and technical contributions whose contents will advance and inspire the greater theory community. ITCS seeks to promote research Prior, simultaneous, and subsequent submissions. Mar 17 2021 Call for papers page updated Mar 17 2021 Website launched Important dates Abstract submission deadline: Submission deadline: Notification to authors: Conference dates: September 2, 2022 (05:59pm EST) September 8, 2022 (05:59pm EST) November 1, 2022 January 11-13, 2023 Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. We expect that authors of accepted papers will make full versions of their papers, with proofs, available before the New Orleans, Louisiana, United States of America Nov 28 2022 https://neurips.cc/ program-chairs@neurips.cc. Survey, NLP, Transformers, Table to Text. A lot of data mining techniques for analyzing the data have been used so far. Category theory represents the mathematical formalism for studying and modeling different organizations in a categorical way. STOC paper submission deadline: Thursday November 4, 2021, 4:59pm EDT. This paper recognized the students emotion through face expression detection and then followed the learning analytics in order to predict the understanding level of students and to take decisions on the online learning system. Modern cars are equipped with multiple electronic embedded systems. (a) Second place, MSOM Best Student Paper Prize . The 13th Innovations in Theoretical Computer Science (ITCS) conference will be hosted by the Simons Institute for the Theory of Computing from January 31 to February 3, 2022. General. 190 papers accepted out of 575 submitted. Karthick Myilvahanan.J and Krishnaveni A, New Horizon College of Engineering, Karnataka, India. Important Information for Accepted Speakers . All conference events will be accessible vitrually. Alex Bredariol Grilo (CNRS and Sorbonne Universit) Important Dates Paper submission deadline: May 3, 2021 (23:59 AoE) Notification: June 23, 2021 Camera ready: July 3, 2021 Conference: September 6 - 8, 2021, in Lisbon, Portugal Call for Papers BAT algorithm is used to find the optimal hyper parameters of these machine learning models so as to obtain a good "accurate" prediction. Narayan Prasad Dahal and Prof. Dr. Subarna Shakya, Pulchowk Campus, Institute of Engineering, Tribhuvan University, Lalitpur, Nepal. Kena Vyas and PM Jat, DAIICT, Gandhinagar, Gujarat, India. conference begins. Economics Letter; Current Research So please proceed with care and consider checking the Internet Archive privacy policy. Home; About Us. ITCS 2023 Accepted Papers Rigidity for Monogamy-of-Entanglement Games Authors: Anne Broadbent, Eric Culf (University of Ottawa) Opponent Indifference in Rating Systems: A Theoretical Case for Sonas Authors: Greg Bodwin, Forest Zhang (University of Michigan) Online Learning and Bandits with Queried Hints Makrand Sinha (Simons Institute and UC Berkeley ) Yang Cai (Yale University) Proceedings. Email It also presents a general conclusion in the form of recommendations to capture the maximum benefits of IoT adoption. The poster should be of size 4' by 4' and it can be printed Authors should strive to make their paper accessible not only to experts in their subarea, but also to the theory community at large. To accommodate the publishing traditions of different fields, authors of accepted papers can ask the PC chair to have only a one page abstract of the paper appear in the proceedings, along with a URL pointing to the PDF of the full paper on an online archive. (SIAM J. Comput.'14) formally introduced the cryptographic task of position verification, where they also showed that it cannot be achieved by classical protocols. Sponsored by USENIX, the Advanced Computing Systems Association. Selected papers from CST 2022, after further revisions, will be published in the special issue of the following journals International Journal of Information Technology Convergence and Services (IJITCS) International Journal of Computer Science, Engineering and Applications(IJCSEA) International Journal of Advanced Information Technology (IJAIT . Consult with the SafeToC counselors in residence at ITCS 2022: Sumegha Garg (sumegha.garg@gmail.com) and Tom Gur (tom.gur@warwick.ac.uk). Justin Holmgren (NTT Research) Ken Clarkson (IBM Research ) ITCS 2022 will be the most comprehensive conference focused on the various aspects of advances in Information Technology and Computer Science. Password Sign in New to the site? Since assuming office in 2014, he has embarked on an aggressive agenda focused on rebuilding the city's economy and ensuring opportunity for all residents. Authors should upload a PDF of the paper to the submission server using the following link: Front Matter, Table of Contents, Preface, Conference Organization. J5.Vahideh Manshadi and Scott Rodilitz. Authors should upload a PDF of the paper to https://itcs2023.hotcrp.com/. These partitioned blocks are directly mapped to their corresponding SRAM cells. Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 5-7, 2010. PC members will still be able to access author names in the reviewing process if they feel they need to; the intent of this procedure is to make it easier for PC members to remove unconscious biases. Once you have exhausted these days, late assignments will not be accepted without a written excuse from the Dean of . Comparing computational entropies below majority (or: When is the dense model theorem false?). There will be 230 papers presented at the conference. Rigidity for Monogamy-of-Entanglement Games, Authors: Anne Broadbent, Eric Culf (University of Ottawa), Opponent Indifference in Rating Systems: A Theoretical Case for Sonas, Authors: Greg Bodwin, Forest Zhang (University of Michigan), Online Learning and Bandits with Queried Hints, Authors: Aditya Bhaskara (University of Utah); Sreenivas Gollapudi (Google); Sungjin Im (University of California-Merced); Kostas Kollias (Google); Kamesh Munagala (Duke University), Improved Monotonicity Testing Over the Hypergrid via Hypercube Embedddings, Authors: Mark Braverman (Princeton University); Subhash Khot (NYU); Guy Kindler (Hebrew University of Jerusalem); Dor Minzer (MIT), Learning Reserve Prices in Second-Price Auctions, Authors: Yaonan Jin (Columbia University); Pinyan Lu (Shanghai University of Finance and Economics); Tao Xiao (Huawei TCS Lab), Symmetric Formulas for Products of Permutations, Authors: William He, Benjamin Rossman (Duke University), Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks, Authors: Antoine El-Hayek, Monika Henzinger (University of Vienna); Stefan Schmid (University of Vienna & TU Berlin), A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems, Authors: Monika Henzinger (University of Vienna); Billy Jin (Cornell University); Richard Peng (Carnegie Mellon University and University of Waterloo); David Williamson (Cornell University), Strategyproof Scheduling with Predictions, Authors: Eric Balkanski (Columbia University); Vasilis Gkatzelis, Xizhi Tan (Drexel University), Learning versus Pseudorandom Generators in Constant Parallel Time, Authors: Shuichi Hirahara (National Institute of Informatics); Mikito Nanashima (Tokyo Institute of Technology), Exact Completeness of LP Hierarchies for Linear Codes, Authors: Leonardo Nagami Coregliano, Fernando Granha Jeronimo (Institute for Advanced Study); Chris Jones (University of Chicago), Proofs of Quantumness from Trapdoor Permutations, Authors: Tomoyuki Morimae (Kyoto University); Takashi Yamakawa (NTT Social Informatics Laboratories), Exponential separations using guarded extension variables, Authors: Emre Yolcu, Marijn Heule (Carnegie Mellon University), Quantum algorithms and the power of forgetting, Authors: Amin Shiraz Gilani, Andrew M. Childs, Matthew Coudron (University of Maryland), On Interactive Proofs of Proximity with Proof-Oblivious Queries, Authors: Oded Goldreich (Weizmann Institute of Science); Guy N. Rothblum (Apple); Tal Skverer (Weizmann Institute of Science), Authors: Jonah Blasiak (Department of Mathematics, Drexel University); Henry Cohn (Microsoft Research New England); Joshua A. Grochow (Departments of Computer Science and Mathematics, University of Colorado Boulder); Kevin Pratt (School of Computer Science, Carnegie Mellon University); Chris Umans (Department of Computing and Mathematical Sciences, California Institute of Technology), A New Conjecture on Hardness of Low-Degree 2-CSPs with Implications to Hardness of Densest k-Subgraph and Other Problems, Authors: Julia Chuzhoy (Toyota Technological Institute at Chicago); Mina Dalirrooyfard (MIT); Vadim Grinberg (Weizmann Institute of Science); Zihan Tan (Rutgers University), Making Decisions under Outcome Performativity, Authors: Michael P. Kim, Juan C. Perdomo (UC Berkeley), Loss Minimization through the lens of Outcome Indistinguishability, Authors: Parikshit Gopalan (Apple); Lunjia Hu (Stanford University); Michael P. Kim (UC Berkeley); Omer Reingold (Stanford University); Udi Wieder (VMware), The Time Complexity of Consensus Under Oblivious Message Adversaries, Authors: Hugo Rincon Galeana (Technische Universitt Wien); Ami Paz (LISN - CNRS and Paris-Saclay University); Stefan Schmid (TU Berlin & Fraunhofer SIT); Ulrich Schmid (TU Wien); Kyrill Winkler (ITK Engineering, Vienna, Austria), Necessary Conditions in Multi-Server Differential Privacy, Authors: Albert Cheu, Chao Yan (Georgetown University), On Oracles and Algorithmic Methods for Proving Lower Bounds, Authors: Nikhil Vyas, Ryan Williams (MIT), Beyond Worst-Case Budget-Feasible Mechanism Design, Authors: Aviad Rubinstein, Junyao Zhao (Stanford University), Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement, Authors: Dorian Rudolph, Sevag Gharibian (Universitt Paderborn), Unitary property testing lower bounds by polynomials, Authors: Adrian She (University of Toronto); Henry Yuen (Columbia University), Incompressiblity and Next-Block Pseudoentropy, Authors: Iftach Haitner, Noam Mazor, Jad Silbak (Tel Aviv University), PPP-Completeness and Extremal Combinatorics, Authors: Romain Bourneuf (ENS de Lyon); Luk Folwarczn, Pavel Hubek (Charles University); Alon Rosen (Bocconi University and Reichman University); Nikolaj Ignatieff Schwartzbach (Aarhus University), Beeping Shortest Paths via Hypergraph Bipartite Decomposition, Authors: Fabien Dufoulon (University of Houston); Yuval Emek (Technion); Ran Gelles (Bar-Ilan University), Expander Decomposition in Dynamic Streams, Authors: Arnold Filtser (Bar-Ilan University); Michael Kapralov, Mikhail Makarov (EPFL), Fractional certificates for bounded functions, Authors: Shachar Lovett (University of California San Diego); Jiapeng Zhang (University of Southern California), Extremal Combinatorics, iterated pigeonhole arguments, and generalizations of PPP, Authors: Amol Pasarkar, Christos Papadimitriou, Mihalis Yannakakis (Columbia University), Depth-Bounded Quantum Cryptography with Applications to One-Time Memory and More, Kolmogorov Complexity Characterizes Statistical Zero Knowledge, Authors: Eric Allender (Rutgers University); Shuichi Hirahara (National Institute of Informatics); Harsha Tirumala (Rutgers University), Vertex Sparsification for Edge Connectivity in Polynomial Time, Authors: Yang P. Liu (Stanford University), On the computational hardness needed for quantum cryptography, Authors: Zvika Brakerski (Weizmann Institute of Science); Ran Canetti, Luowen Qian (Boston University), Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses, Authors: Chris Jones, Kunal Marwaha (University of Chicago); Juspreet Singh Sandhu (Harvard University); Jonathan Shi (Bocconi University), Authors: Mark Braverman (Princeton University); Dor Minzer (MIT), Authors: Guy Blanc, Caleb Koch (Stanford University); Jane Lange (MIT); Carmen Strassle, Li-Yang Tan (Stanford University), Unsplittable Euclidean Capacitated Vehicle Routing: A $(2+\epsilon)$-Approximation Algorithm, Authors: Fabrizio Grandoni (IDSIA, University of Lugano); Claire Mathieu (cole normale suprieure and CNRS); Hang Zhou (cole Polytechnique), Efficient algorithms for certifying lower bounds on the discrepancy of random matrices, Matroid Partition Property and the Secretary Problem, Authors: Dorna Abdolazimi, Anna Karlin, Nathan Klein, Shayan Oveis Gharan (University of Washington), A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators, Authors: Idan Attias (Ben-Gurion University); Edith Cohen (Google and Tel Aviv University); Moshe Shechner (Tel Aviv University); Uri Stemmer (Google and Tel Aviv University), Asynchronous Multi-Party Quantum Computation, Authors: Vipul Goyal (Carnegie Mellon University and NTT Research); Chen-Da Liu-Zhang (NTT Research); Justin Raizes, Joao Ribeiro (Carnegie Mellon University), Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom, Authors: Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang (University of Texas at Austin), Karchmer-Wigderson Games for Hazard-free Computation, Authors: Christian Ikenmeyer (University of Liverpool, United Kingdom.