Table of Contents

• High-Entropy Dual Functions and Locally Decodable Codes (Extended Abstract)Jop Briët, Farrokh Labib. [doi]
• Sample Efficient Identity Testing and Independence Testing of Quantum StatesNengkun Yu. [doi]
• Communication Memento: Memoryless Communication ComplexitySrinivasan Arunachalam, Supartha Podder. [doi]
• Is the Space Complexity of Planted Clique Recovery the Same as That of Detection?Jay Mardia. [doi]
• Error Correcting Codes for Uncompressed MessagesOfer Grossman, Justin Holmgren. [doi]
• On the Complexity of #CSP^dJiabao Lin. [doi]
• Robust Quantum Entanglement at (Nearly) Room TemperatureLior Eldar. [doi]
• Metrical Service Systems with TransformationsSébastien Bubeck, Niv Buchbinder, Christian Coester, Mark Sellke. [doi]
• Tight Hardness Results for Training Depth-2 ReLU NetworksSurbhi Goel, Adam R. Klivans, Pasin Manurangsi, Daniel Reichman 0001. [doi]
• The Complexity of Finding Fair Independent Sets in CyclesIshay Haviv. [doi]
• Towards Local Testability for Quantum CodingAnthony Leverrier, Vivien Londe, Gilles Zémor. [doi]
• Total Functions in the Polynomial HierarchyRobert Kleinberg, Oliver Korten, Daniel Mitropolsky, Christos H. Papadimitriou. [doi]
• Pseudorandom Generators for Unbounded-Width Permutation Branching ProgramsWilliam M. Hoza, Edward Pyne, Salil P. Vadhan. [doi]
• Complexity Measures on the Symmetric Group and Beyond (Extended Abstract)Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals. [doi]
• Differentially Oblivious Turing MachinesIlan Komargodski, Elaine Shi. [doi]
• Pipeline InterventionsEshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth 0001, Juba Ziani. [doi]
• Counterexamples to the Low-Degree ConjectureJustin Holmgren, Alexander S. Wein. [doi]
• Sequential Defaulting in Financial NetworksPál András Papp, Roger Wattenhofer. [doi]
• A Model for Ant Trail Formation and its Convergence Properties (Extended Abstract)Moses Charikar, Shivam Garg, Deborah M. Gordon, Kirankumar Shiragur. [doi]
• The Quantum Supremacy Tsirelson InequalityWilliam Kretschmer. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Learning and Strongly Truthful Multi-Task Peer Prediction: A Variational ApproachGrant Schoenebeck, Fang-Yi Yu. [doi]
• No Quantum Speedup over Gradient Descent for Non-Smooth Convex OptimizationAnkit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif. [doi]
• Algorithmic Persuasion with EvidenceMartin Hoefer, Pasin Manurangsi, Alexandros Psomas. [doi]
• Understanding the Relative Strength of QBF CDCL Solvers and QBF ResolutionOlaf Beyersdorff, Benjamin Böhm. [doi]
• Lower Bounds for Off-Chain Protocols: Exploring the Limits of PlasmaStefan Dziembowski, Grzegorz Fabianski, Sebastian Faust, Siavash Riahi 0002. [doi]
• Circular Trace ReconstructionShyam Narayanan, Michael Ren. [doi]
• Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev InequalityEsty Kelman, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra. [doi]
• Comparing Computational Entropies Below Majority (Or: When Is the Dense Model Theorem False?)Russell Impagliazzo, Sam McGuire. [doi]
• Explicit SoS Lower Bounds from High-Dimensional ExpandersIrit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani. [doi]
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-CompletenessJoshua A. Grochow, Youming Qiao. [doi]
• Relative Lipschitzness in Extragradient Methods and a Direct Recipe for AccelerationMichael B. Cohen, Aaron Sidford, Kevin Tian. [doi]
• Erasure-Resilient Sublinear-Time Graph AlgorithmsAmit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma. [doi]
• Dynamic Inference in Probabilistic Graphical ModelsWeiming Feng, Kun He 0011, Xiaoming Sun, Yitong Yin. [doi]
• Training (Overparametrized) Neural Networks in Near-Linear TimeJan van den Brand, Binghui Peng, Zhao Song 0002, Omri Weinstein. [doi]
• Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum CircuitsBoaz Barak, Chi-Ning Chou, Xun Gao. [doi]
• Randomness and Fairness in Two-Sided Matching with Limited InterviewsHedyeh Beyhaghi, Éva Tardos. [doi]
• Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing MachinesZachary Remscrim. [doi]
• Complete Problems for Multi-Pseudodeterministic ComputationsPeter Dixon 0002, A. Pavan 0001, N. V. Vinodchandran. [doi]
• Batching and Optimal Multi-Stage Bipartite Allocations (Extended Abstract)Yiding Feng, Rad Niazadeh. [doi]
• Delegated Stochastic ProbingCurtis Bechtel, Shaddin Dughmi. [doi]
• Comparison Graphs: A Unified Method for Uniformity TestingUri Meir. [doi]
• Pseudobinomiality of the Sticky Random WalkVenkatesan Guruswami, Vinayak Kumar. [doi]
• Bounds on the QAC^0 Complexity of Approximating ParityGregory Rosenthal. [doi]
• Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility (Extended Abstract)José R. Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior, Bruno Ziliotto. [doi]
• A New Connection Between Node and Edge Depth Robust GraphsJeremiah Blocki, Mike Cinkoske. [doi]
• Majorizing Measures for the OptimizerSander Borst, Daniel Dadush, Neil Olver, Makrand Sinha. [doi]
• An O(N) Time Algorithm for Finding Hamilton Cycles with High ProbabilityRajko Nenadov, Angelika Steger, Pascal Su. [doi]
• How to Sell Information Optimally: An Algorithmic StudyYang Cai 0001, Grigoris Velegkas. [doi]
• On Distributed Differential Privacy and Counting Distinct ElementsLijie Chen 0001, Badih Ghazi, Ravi Kumar 0001, Pasin Manurangsi. [doi]
• Quantitative Correlation Inequalities via Semigroup InterpolationAnindya De, Shivam Nadimpalli, Rocco A. Servedio. [doi]
• On Basing Auxiliary-Input Cryptography on NP-Hardness via Nonadaptive Black-Box ReductionsMikito Nanashima. [doi]
• A Polynomial Degree Bound on Equations for Non-Rigid Matrices and Small Linear CircuitsMrinal Kumar 0001, Ben lee Volk. [doi]
• Circuit Depth ReductionsAlexander Golovnev, Alexander S. Kulikov, R. Ryan Williams. [doi]
• Ordered Graph Limits and Their ApplicationsOmri Ben-Eliezer, Eldar Fischer, Amit Levi, Yuichi Yoshida. [doi]
• On Rich 2-to-1 GamesMark Braverman, Subhash Khot, Dor Minzer. [doi]
• Block Rigidity: Strong Multiplayer Parallel Repetition Implies Super-Linear Lower Bounds for Turing MachinesKunal Mittal, Ran Raz. [doi]
• Buying Data over Time: Approximately Optimal Strategies for Dynamic Data-Driven DecisionsNicole Immorlica, Ian A. Kash, Brendan Lucier. [doi]
• Relaxing Common Belief for Social NetworksNoah Burrell, Grant Schoenebeck. [doi]
• Approximately Strategyproof Tournament Rules in the Probabilistic SettingKimberly Ding, S. Matthew Weinberg. [doi]
• Computation over the Noisy Broadcast Channel with Malicious PartiesKlim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena. [doi]
• Polynomial-Time Trace Reconstruction in the Low Deletion Rate RegimeXi Chen 0001, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha. [doi]
• Tiered Random Matching Markets: Rank Is Proportional to PopularityItai Ashlagi, Mark Braverman, Amin Saberi, Clayton Thomas, Geng Zhao. [doi]
• Shrinkage of Decision Lists and DNF FormulasBenjamin Rossman. [doi]
• Quantum Versus Randomized Communication Complexity, with Efficient PlayersUma Girish, Ran Raz, Avishay Tal. [doi]
• Agnostic Learning with Unknown UtilitiesKush Bhatia, Peter L. Bartlett, Anca D. Dragan, Jacob Steinhardt. [doi]
• Simple Heuristics Yield Provable Algorithms for Masked Low-Rank ApproximationCameron Musco, Christopher Musco, David P. Woodruff. [doi]
• Self-Testing of a Single Quantum Device Under Computational AssumptionsTony Metger, Thomas Vidick. [doi]
• Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming!Anup Bhattacharya, Arijit Bishnu, Gopinath Mishra, Anannya Upasana. [doi]
• The Entropy of Lies: Playing Twenty Questions with a LiarYuval Dagan, Yuval Filmus, Daniel Kane, Shay Moran. [doi]
• Sampling Arborescences in ParallelNima Anari, Nathan Hu, Amin Saberi, Aaron Schild. [doi]
• A Largish Sum-Of-Squares Implies Circuit Hardness and DerandomizationPranjal Dutta, Nitin Saxena 0001, Thomas Thierauf. [doi]
• The Variable-Processor Cup GameWilliam Kuszmaul, Alek Westover. [doi]
• Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists)Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma. [doi]
• Online Search with a HintSpyros Angelopoulos 0001. [doi]
• Distributed Quantum Proofs for Replicated DataPierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz. [doi]
• Black-Box Uselessness: Composing Separations in CryptographyGeoffroy Couteau, Pooya Farshim, Mohammad Mahmoody. [doi]
• Sensitivity Analysis of the Maximum Matching ProblemYuichi Yoshida, Samson Zhou. [doi]
• Time-Space Lower Bounds for Simulating Proof Systems with Quantum and Randomized VerifiersAbhijit Mudigonda, R. Ryan Williams. [doi]
• Two Combinatorial MA-Complete ProblemsDorit Aharonov, Alex B. Grilo. [doi]
• Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching MarketsVijay V. Vazirani, Mihalis Yannakakis. [doi]
• Online Paging with a Vanishing RegretYuval Emek, Shay Kutten, Yangguang Shi. [doi]
• The Strongish Planted Clique Hypothesis and Its ConsequencesPasin Manurangsi, Aviad Rubinstein, Tselil Schramm. [doi]
• Non-Quasi-Linear Agents in Quasi-Linear Mechanisms (Extended Abstract)Moshe Babaioff, Richard Cole 0001, Jason D. Hartline, Nicole Immorlica, Brendan Lucier. [doi]
• Algorithms and Hardness for Multidimensional Range Updates and QueriesJoshua Lau, Angus Ritossa. [doi]
• Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0 (Extended Abstract)Yuval Filmus, Or Meir, Avishay Tal. [doi]
• A Generalized Matching Reconfiguration ProblemNoam Solomon, Shay Solomon. [doi]
• Interactive Proofs for Verifying Machine LearningShafi Goldwasser, Guy N. Rothblum, Jonathan Shafer, Amir Yehudayoff. [doi]
• Sharp Threshold Rates for Random CodesVenkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters. [doi]
• Distributed Load Balancing: A New Framework and Improved GuaranteesSara Ahmadian, Allen Liu, Binghui Peng, Morteza Zadimoghaddam. [doi]