Table of Contents

• On Solving Linear Systems in Sublinear TimeAlexandr Andoni, Robert Krauthgamer, Yosef Pogrow. [doi]
• Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups TimesKlaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau. [doi]
• Fisher Zeros and Correlation Decay in the Ising ModelJingcheng Liu 0001, Alistair Sinclair, Piyush Srivastava. [doi]
• On the Algorithmic Power of Spiking Neural NetworksChi-Ning Chou, Kai-Min Chung, Chi-Jen Lu. [doi]
• On Locality-Sensitive Orderings and Their ApplicationsTimothy M. Chan, Sariel Har-Peled, Mitchell Jones. [doi]
• "Quantum Supremacy" and the Complexity of Random Circuit SamplingAdam Bouland, Bill Fefferman, Chinmay Nirkhe, Umesh Vazirani. [doi]
• Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max OptimizationConstantinos Daskalakis, Ioannis Panageas. [doi]
• Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of GraphsAmit Levi, Erik Waingarten. [doi]
• Simple Verifiable Delay FunctionsKrzysztof Pietrzak. [doi]
• How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All CiphertextsThibaut Horel, Sunoo Park, Silas Richelson, Vinod Vaikuntanathan. [doi]
• On the Complexity of Symmetric PolynomialsMarkus Bläser, Gorav Jindal. [doi]
• Semi-Online Bipartite MatchingRavi Kumar 0001, Manish Purohit, Aaron Schild, Zoya Svitkina, Erik Vee. [doi]
• Density Estimation for Shift-Invariant Multidimensional DistributionsAnindya De, Philip M. Long, Rocco A. Servedio. [doi]
• Placing Conditional Disclosure of Secrets in the Communication Complexity UniverseBenny Applebaum, Prashant Nalini Vasudevan. [doi]
• Torus Polynomials: An Algebraic Approach to ACC Lower BoundsAbhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao. [doi]
• The Orthogonal Vectors Conjecture for Branching Programs and FormulasDaniel M. Kane, Richard Ryan Williams. [doi]
• On the Communication Complexity of High-Dimensional PermutationsNati Linial, Toniann Pitassi, Adi Shraibman. [doi]
• A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge SamplingSepehr Assadi, Michael Kapralov, Sanjeev Khanna. [doi]
• A Log-Sobolev Inequality for the Multislice, with ApplicationsYuval Filmus, Ryan O'Donnell, Xinyu Wu. [doi]
• A Schur Complement Cheeger InequalityAaron Schild. [doi]
• Adversarially Robust Property-Preserving Hash FunctionsElette Boyle, Rio LaVigne, Vinod Vaikuntanathan. [doi]
• Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random OracleDylan M. McKay, Richard Ryan Williams. [doi]
• Being Corrupt Requires Being Clever, But Detecting Corruption Doesn'tYan Jin, Elchanan Mossel, Govind Ramnarayan. [doi]
• Probabilistic Checking Against Non-Signaling Strategies from Linearity TestingAlessandro Chiesa, Peter Manohar, Igor Shinkar. [doi]
• Strategies for Quantum RacesTroy Lee, Maharshi Ray, Miklos Santha. [doi]
• Adventures in Monotone Complexity and TFNPMika Göös, Pritish Kamath, Robert Robere, Dmitry Sokolov 0001. [doi]
• The Complexity of User RetentionEli Ben-Sasson, Eden Saig. [doi]
• Almost Envy-Free Allocations with Connected BundlesVittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker. [doi]
• The Paulsen Problem Made SimpleLinus Hamilton, Ankur Moitra. [doi]
• Sum of Squares Lower Bounds from Symmetry and a Good StoryAaron Potechin. [doi]
• Every Set in P Is Strongly Testable Under a Suitable EncodingIrit Dinur, Oded Goldreich 0001, Tom Gur. [doi]
• Local Computation Algorithms for SpannersMerav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee. [doi]
• Algorithmic Polarization for Hidden Markov ModelsVenkatesan Guruswami, Preetum Nakkiran, Madhu Sudan. [doi]
• A Note on the Quantum Query Complexity of Permutation Symmetric FunctionsAndré Chailloux. [doi]
• On Integer Programming and ConvolutionKlaus Jansen, Lars Rohwedder. [doi]
• Tensor Network Complexity of Multilinear MapsPer Austrin, Petteri Kaski, Kaie Kubjas. [doi]
• Hamiltonian Sparsification and Gap-SimulationDorit Aharonov, Leo Zhou. [doi]
• Game Efficiency Through Linear Programming DualityNguyen Kim Thang. [doi]
• Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCsZeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson. [doi]
• Erasures vs. Errors in Local Decoding and Property TestingSofya Raskhodnikova, Noga Ron-Zewi, Nithin M. Varma. [doi]
• From Local to Robust Testing via Agreement TestingIrit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi. [doi]
• Simulating Random Walks on Graphs in the Streaming ModelCe Jin. [doi]
• SOS Lower Bounds with Hard Constraints: Think Global, Act LocalPravesh K. Kothari, Ryan O'Donnell, Tselil Schramm. [doi]
• Cubic Formula Size Lower Bounds Based on Compositions with MajorityAnna Gál, Avishay Tal, Adrian Trejo Nuñez. [doi]
• A #SAT Algorithm for Small Constant-Depth Circuits with PTF GatesSwapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan 0001. [doi]
• Capturing Complementarity in Set Functions by Going Beyond Submodularity/SubadditivityWei Chen 0013, Shang-Hua Teng, Hanrui Zhang. [doi]
• Submodular Secretary Problem with ShortlistsShipra Agrawal 0001, Mohammad Shadravan, Cliff Stein. [doi]
• Secret Sharing with Binary SharesFuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, Huaxiong Wang. [doi]
• On the Communication Complexity of Key-Agreement ProtocolsIftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff. [doi]
• Expander-Based Cryptography Meets Natural ProofsIgor Carboni Oliveira, Rahul Santhanam, Roei Tell. [doi]
• Testing Local Properties of ArraysOmri Ben-Eliezer. [doi]
• Bitcoin: A Natural OligopolyNick Arnosti, S. Matthew Weinberg. [doi]
• The Subgraph Testing ModelOded Goldreich 0001, Dana Ron. [doi]
• On Closest Pair in Euclidean Metric: Monochromatic is as Hard as BichromaticKarthik C. S., Pasin Manurangsi. [doi]
• A New Approach to Multi-Party Peer-to-Peer Communication ComplexityAdi Rosén, Florent Urrutia. [doi]
• Learning Time Dependent ChoiceZachary Chase, Siddharth Prasad. [doi]
• Adaptive Boolean Monotonicity Testing in Total Influence TimeDeeparnab Chakrabarty, C. Seshadhri. [doi]
• Classical Algorithms from Quantum and Arthur-Merlin Communication ProtocolsLijie Chen, Ruosong Wang. [doi]
• Alea Iacta Est: Auctions, Persuasion, Interim Rules, and DiceShaddin Dughmi, David Kempe 0001, Ruixin Qiang. [doi]
• Proofs of Catalytic SpaceKrzysztof Pietrzak. [doi]
• Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity GatesEshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal. [doi]
• Random Projection in the Brain and Computation with Assemblies of NeuronsChristos H. Papadimitriou, Santosh S. Vempala. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Fairness Under CompositionCynthia Dwork, Christina Ilvento. [doi]
• Small-Set Expansion in Shortcode Graph and the 2-to-2 ConjectureBoaz Barak, Pravesh K. Kothari, David Steurer. [doi]
• Algorithms, Bounds, and Strategies for Entangled XOR GamesAdam Bene Watts, Aram Wettroth Harrow, Gurtej Kanwar, Anand Natarajan. [doi]
• The Space Complexity of Mirror GamesSumegha Garg, Jon Schneider. [doi]