STOC 2022
54th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2022)

Powered by

54th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2022), June 20–24, 2022, Rome, Italy

STOC 2022 – Proceedings

Contents - Abstracts - Authors

Frontmatter

Title Page

Welcome from the Program Chair

STOC 2022 Conference Organization

Session 1A

Nonlocal Games, Compression Theorems, and the Arithmetical Hierarchy
Hamoon Mousavi, Seyed Sajjad Nezhadi, and Henry Yuen
(Columbia University, USA; University of Maryland, USA)

Publisher's Version

An Area Law for 2D Frustration-Free Spin Systems
Anurag Anshu, Itai Arad, and David Gosset
(Harvard University, USA; Technion, Israel; University of Waterloo, Canada)

Publisher's Version

Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
Sevag Gharibian and François Le Gall
(Paderborn University, Germany; Nagoya University, Japan)

Publisher's Version

Near-Optimal Quantum Algorithms for Multivariate Mean Estimation
Arjan Cornelissen, Yassine Hamoudi, and Sofiene Jerbi
(University of Amsterdam, Netherlands; University of California at Berkeley, USA; University of Innsbruck, Austria)

Publisher's Version

Distributed Quantum Inner Product Estimation
Anurag Anshu, Zeph Landau, and Yunchao Liu
(Harvard University, USA; University of California at Berkeley, USA)

Publisher's Version

Session 1B

The Power of Two Choices in Graphical Allocation
Nikhil Bansal and Ohad N. Feldheim
(University of Michigan, USA; Hebrew University of Jerusalem, Israel)

Publisher's Version

Expanders via Local Edge Flips in Quasilinear Time
George Giakkoupis
(Inria, France; University of Rennes, France; CNRS, France; IRISA, France)

Publisher's Version

(Fractional) Online Stochastic Matching via Fine-Grained Offline Statistics
Zhihao Gavin Tang, Jinzhao Wu, and Hongxun Wu
(Shanghai University of Finance and Economics, China; Peking University, China; Tsinghua University, China)

Publisher's Version

The Power of Multiple Choices in Online Stochastic Matching
Zhiyi Huang, Xinkai Shu, and Shuyi Yan
(University of Hong Kong, China; Tsinghua University, China)

Publisher's Version

Online Edge Coloring via Tree Recurrences and Correlation Decay
Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, and Jakub Tarnawski
(Microsoft Research, USA; Stanford University, USA; Massachusetts Institute of Technology, USA)

Publisher's Version

Session 1C

The Shortest Even Cycle Problem Is Tractable
Andreas Björklund, Thore Husfeldt, and Petteri Kaski
(Lund University, Sweden; IT University of Copenhagen, Denmark; Aalto University, Finland)

Publisher's Version

Breaking the n^k Barrier for Minimum k-Cut on Simple Graphs
Zhiyang He and Jason Li
(Massachusetts Institute of Technology, USA; University of California at Berkeley, USA)

Publisher's Version

Edge Connectivity Augmentation in Near-Linear Time
Ruoxu Cen, Jason Li, and Debmalya Panigrahi
(Duke University, USA; University of California at Berkeley, USA)

Publisher's Version

Optimal Vertex Connectivity Oracles
Seth Pettie, Thatchaphol Saranurak, and Longhui Yin
(University of Michigan, USA; Tsinghua University, China)

Publisher's Version

Deterministic Massively Parallel Connectivity
Sam Coy and Artur Czumaj
(University of Warwick, UK)

Publisher's Version

Session 2A

Hypercontractivity on High Dimensional Expanders
Tom Gur, Noam Lifshitz, and Siqi Liu
(University of Warwick, UK; Hebrew University of Jerusalem, Israel; University of California at Berkeley, USA)

Publisher's Version

Hypercontractivity on High Dimensional Expanders
Mitali Bafna, Max Hopkins, Tali Kaufman, and Shachar Lovett
(Harvard University, USA; University of California at San Diego, USA; Bar-Ilan University, Israel)

Publisher's Version

Approximate Polymorphisms
Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, and Nitin Saurabh
(Technion, Israel; Massachusetts Institute of Technology, USA; IIT Hyderabad, India)

Publisher's Version

Learning Low-Degree Functions from a Logarithmic Number of Random Queries
Alexandros Eskenazis and Paata Ivanisvili
(University of Cambridge, UK; University of California at Irvine, USA)

Publisher's Version

Positive Spectrahedra: Invariance Principles and Pseudorandom Generators
Srinivasan Arunachalam and Penghui Yao
(IBM Research, USA; Nanjing University, China)

Publisher's Version

Session 2B

New Streaming Algorithms for High Dimensional EMD and MST
Xi Chen, Rajesh Jayaram, Amit Levi, and Erik Waingarten
(Columbia University, USA; Google Research, USA; University of Waterloo, Canada; Stanford University, USA)

Publisher's Version

Brooks’ Theorem in Graph Streams: A Single-Pass Semi-streaming Algorithm for ∆-Coloring
Sepehr Assadi, Pankaj Kumar, and Parth Mittal
(Rutgers University, USA; Charles University in Prague, Czechia)

Publisher's Version

Deterministic (1+𝜀)-Approximate Maximum Matching with poly(1/𝜀) Passes in the Semi-streaming Model and Beyond
Manuela Fischer, Slobodan Mitrović, and Jara Uitto
(ETH Zurich, Switzerland; University of California at Davis, USA; Aalto University, Finland)

Publisher's Version

Deterministic Graph Coloring in the Streaming Model
Sepehr Assadi, Andrew Chen, and Glenn Sun
(Rutgers University, USA; Cornell University, USA; University of California at Los Angeles, USA)

Publisher's Version

Linear Space Streaming Lower Bounds for Approximating CSPs
Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, and Santhoshini Velusamy
(Harvard University, USA; Georgetown University, USA; Google Research, USA)

Publisher's Version

Session 2C

A PTAS for Unsplittable Flow on a Path
Fabrizio Grandoni, Tobias Mömke, and Andreas Wiese
(USI-SUPSI, Switzerland; University of Augsburg, Germany; Vrije Universiteit Amsterdam, Netherlands)

Publisher's Version

A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs
Julia Chuzhoy and Zihan Tan
(Toyota Technological Institute at Chicago, USA; University of Chicago, USA)

Publisher's Version

Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios
Matthias Englert, Nicolaos Matsakis, and Pavel Veselý
(University of Warwick, UK; Charles University in Prague, Czechia)

Publisher's Version

Flow Time Scheduling and Prefix Beck-Fiala
Nikhil Bansal, Lars Rohwedder, and Ola Svensson
(University of Michigan, USA; Maastricht University, Netherlands; EPFL, Switzerland)

Publisher's Version

Bypassing the Surface Embedding: Approximation Schemes for Network Design in Minor-Free Graphs
Vincent Cohen-Addad
(Google Research, Switzerland)

Publisher's Version

Award Papers Session I: Best Papers

Locally Testable Codes with Constant Rate, Distance, and Locality
Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, and Shahar Mozes
(Weizmann Institute of Science, Israel; Hebrew University of Jerusalem, Israel)

Publisher's Version

Asymptotically Good Quantum and Locally Testable Classical LDPC Codes
Pavel Panteleev and Gleb Kalachev
(Lomonosov Moscow State University, Russia)

Publisher's Version

Session 3A

Ideals, Determinants, and Straightening: Proving and Using Lower Bounds for Polynomial Ideals
Robert Andrews and Michael A. Forbes
(University of Illinois at Urbana-Champaign, USA)

Publisher's Version

Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications
Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, and Chandra Kanta Mohapatra
(Rutgers University, USA; California Institute of Technology, USA; IIT Bombay, India)

Publisher's Version

Set-Multilinear and Non-commutative Formula Lower Bounds for Iterated Matrix Multiplication
Sébastien Tavenas, Nutan Limaye, and Srikanth Srinivasan
(Université Grenoble Alpes, France; Université Savoie Mont Blanc, France; CNRS, France; LAMA, France; IT University of Copenhagen, Denmark; Aarhus University, Denmark)

Publisher's Version

Combinatorics via Closed Orbits: Number Theoretic Ramanujan Graphs Are Not Unique Neighbor Expanders
Amitay Kamber and Tali Kaufman
(University of Cambridge, UK; Bar-Ilan University, Israel)

Publisher's Version

On the Complexity of CSP-Based Ideal Membership Problems
Andrei A. Bulatov and Akbar Rafiey
(Simon Fraser University, Canada)

Publisher's Version

Session 3B

Near-Optimal Distributed Degree+1 Coloring
Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, and Tigran Tonoyan
(Reykjavik University, Iceland; University of Freiburg, Germany; Krisp Technologies, Armenia)

Publisher's Version

Distributed ∆-Coloring Plays Hide-and-Seek
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti
(Gran Sasso Science Institute, Italy; CISPA, Germany; University of Freiburg, Germany)

Publisher's Version

Undirected (1+𝜀)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel and Distributed Algorithms
Václav Rozhoň, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, and Jason Li
(ETH Zurich, Switzerland; Carnegie Mellon University, USA; University of California at Berkeley, USA)

Publisher's Version

Improved Communication Complexity of Fault-Tolerant Consensus
Mohammad T. Hajiaghayi, Dariusz R. Kowalski, and Jan Olkowski
(University of Maryland, USA; Augusta University, USA)

Publisher's Version

Byzantine Agreement in Polynomial Time with Near-Optimal Resilience
Shang-En Huang, Seth Pettie, and Leqi Zhu
(University of Michigan, USA)

Publisher's Version

Session 3C

No Self-Concordant Barrier Interior Point Method Is Strongly Polynomial
Xavier Allamigeon, Stéphane Gaubert, and Nicolas Vandame
(Inria, France; École Polytechnique, France; CNRS, France)

Publisher's Version

Improved Iteration Complexities for Overconstrained p-Norm Regression
Arun Jambulapati, Yang P. Liu, and Aaron Sidford
(Stanford University, USA)

Publisher's Version

Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers
Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, and Aaron Sidford
(Simons Institute for the Theory of Computing Berkeley, USA; University of California at Berkeley, USA; Georgia Institute of Technology, USA; Stanford University, USA; University of Washington, USA)

Publisher's Version

Sparsified Block Elimination for Directed Laplacians
Richard Peng and Zhuoqing Song
(University of Waterloo, Canada; Fudan University, China)

Publisher's Version

Matrix Anti-concentration Inequalities with Applications
Zipei Nie
(Huawei, France)

Publisher's Version

Session 4A

Circuits Resilient to Short-Circuit Errors
Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, and Raghuvansh R. Saxena
(Ben-Gurion University of the Negev, Israel; ETH Zurich, Switzerland; Carnegie Mellon University, USA; Microsoft Research, USA; Massachusetts Institute of Technology, USA; Google Research, USA; Princeton University, USA; CWI, Netherlands)

Publisher's Version

Explicit Binary Tree Codes with Sub-logarithmic Size Alphabet
Inbar Ben Yaacov, Gil Cohen, and Tal Yankovitz
(Tel Aviv University, Israel)

Publisher's Version

Interactive Error Correcting Codes over Binary Erasure Channels Resilient to > ½ Adversarial Corruption
Meghal Gupta, Yael Tauman Kalai, and Rachel Yun Zhang
(Microsoft Research, USA; Massachusetts Institute of Technology, USA)

Publisher's Version

The Query Complexity of Certification
Guy Blanc, Caleb Koch, Jane Lange, and Li-Yang Tan
(Stanford University, USA; Massachusetts Institute of Technology, USA)

Publisher's Version

Session 4B

Matrix Discrepancy from Quantum Communication
Samuel B. Hopkins, Prasad Raghavendra, and Abhishek Shetty
(Massachusetts Institute of Technology, USA; University of California at Berkeley, USA)

Publisher's Version

A New Framework for Matrix Discrepancy: Partial Coloring Bounds via Mirror Descent
Daniel Dadush, Haotian Jiang, and Victor Reis
(CWI, Netherlands; University of Washington, USA)

Publisher's Version

Uniform Approximations for Randomized Hadamard Transforms with Applications
Yeshwanth Cherapanamjeri and Jelani Nelson
(University of California at Berkeley, USA)

Publisher's Version

Testing Thresholds for High-Dimensional Sparse Random Geometric Graphs
Siqi Liu, Sidhanth Mohanty, Tselil Schramm, and Elizabeth Yang
(University of California at Berkeley, USA; Stanford University, USA)

Publisher's Version

Algorithms and Certificates for Boolean CSP Refutation: Smoothed Is No Harder Than Random
Venkatesan Guruswami, Pravesh K. Kothari, and Peter Manohar
(University of California at Berkeley, USA; Carnegie Mellon University, USA)

Publisher's Version

Session 4C

On the Hardness of Dominant Strategy Mechanism Design
Shahar Dobzinski, Shiri Ron, and Jan Vondrák
(Weizmann Institute of Science, Israel; Stanford University, USA)

Publisher's Version

Computing Simple Mechanisms: Lift-and-Round over Marginal Reduced Forms
Yang Cai, Argyris Oikonomou, and Mingfei Zhao
(Yale University, USA; Google Research, USA)

Publisher's Version

Approximately Efficient Bilateral Trade
Yuan Deng, Jieming Mao, Balasubramanian Sivan, and Kangning Wang
(Google Research, USA; Duke University, USA)

Publisher's Version

Pricing Ordered Items
Shuchi Chawla, Rojin Rezvan, Yifeng Teng, and Christos Tzamos
(University of Texas at Austin, USA; Google Research, USA; University of Wisconsin-Madison, USA)

Publisher's Version

Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-player General-Sum Games
Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, and Tuomas Sandholm
(Carnegie Mellon University, USA; Massachusetts Institute of Technology, USA)

Publisher's Version

Session 5A

Hamiltonian Complexity in the Thermodynamic Limit
Dorit Aharonov and Sandy Irani
(Hebrew University of Jerusalem, Israel; University of California at Irvine, USA)

Publisher's Version

Computational Complexity of the Ground State Energy Density Problem
James D. Watson and Toby S. Cubitt
(University College London, UK)

Publisher's Version

Optimizing Strongly Interacting Fermionic Hamiltonians
Matthew B. Hastings and Ryan O'Donnell
(Microsoft, USA; Carnegie Mellon University, USA)

Publisher's Version

Public-Key Quantum Money with a Classical Bank
Omri Shmueli
(Tel Aviv University, Israel)

Publisher's Version

Quantum Garbled Circuits
Zvika Brakerski and Henry Yuen
(Weizmann Institute of Science, Israel; Columbia University, USA)

Publisher's Version

Session 5B

Reproducibility in Learning
Russell Impagliazzo, Rex Lei, Toniann Pitassi, and Jessica Sorrell
(University of California at San Diego, USA; Columbia University, USA)

Publisher's Version

Kalman Filtering with Adversarial Corruptions
Sitan Chen, Frederic Koehler, Ankur Moitra, and Morris Yau
(University of California at Berkeley, USA; Stanford University, USA; Massachusetts Institute of Technology, USA)

Publisher's Version

Fast Rates for Nonparametric Online Learning: From Realizability to Learning in Games
Constantinos Daskalakis and Noah Golowich
(Massachusetts Institute of Technology, USA)

Publisher's Version

Binary Perceptron: Efficient Algorithms Can Find Solutions in a Rare Well-Connected Cluster
Emmanuel Abbe, Shuangping Li, and Allan Sly
(EPFL, Switzerland; Princeton University, USA)

Publisher's Version

Learning General Halfspaces with General Massart Noise under the Gaussian Distribution
Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, and Nikos Zarifis
(University of Wisconsin-Madison, USA; University of California at San Diego, USA)

Publisher's Version

Session 5C

Fast FPT-Approximation of Branchwidth
Fedor V. Fomin and Tuukka Korhonen
(University of Bergen, Norway)

Publisher's Version

Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion
Bart M. P. Jansen and Michał Włodarczyk
(Eindhoven University of Technology, Netherlands)

Publisher's Version

Fixed-Parameter Tractability of Graph Isomorphism in Graphs with an Excluded Minor
Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh
(University of California at Santa Barbara, USA; University of Warsaw, Poland; IMSc, India; University of Bergen, Norway)

Publisher's Version

Twin-Width IV: Ordered Graphs and Matrices
Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, and Szymon Toruńczyk
(LIP, France; ENS Lyon, France; CAMS, France; CNRS, France; University of California at Berkeley, USA; University of Warsaw, Poland)

Publisher's Version

Directed Flow-Augmentation
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, and Magnus Wahlström
(Université Paris-Dauphine, France; PSL Research University, France; CNRS, France; Humboldt University of Berlin, Germany; University of Warsaw, Poland; Royal Holloway University of London, UK)

Publisher's Version

Award Papers Session II: Best Student Papers

The Optimal Error Resilience of Interactive Communication over Binary Channels
Meghal Gupta and Rachel Yun Zhang
(Microsoft Research, USA; Massachusetts Institute of Technology, USA)

Publisher's Version

The Exact Complexity of Pseudorandom Functions and the Black-Box Natural Proof Barrier for Bootstrapping Results in Computational Complexity
Zhiyuan Fan, Jiatu Li, and Tianqi Yang
(Tsinghua University, China)

Publisher's Version

Session 6A

On Approximability of Satisfiable k-CSPs: I
Amey Bhangale, Subhash Khot, and Dor Minzer
(University of California at Riverside, USA; New York University, USA; Massachusetts Institute of Technology, USA)

Publisher's Version

A Characterization of Approximability for Biased CSPs
Euiwoong Lee and Suprovat Ghoshal
(University of Michigan, USA)

Publisher's Version

Parallel Repetition for All 3-Player Games over Binary Alphabet
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, and Wei Zhan
(Princeton University, USA; NTT Research, USA)

Publisher's Version

Constant Inapproximability for PPA
Argyrios Deligkas, John Fearnley, Alexandros Hollender, and Themistoklis Melissourgos
(Royal Holloway University of London, UK; University of Liverpool, UK; University of Oxford, UK; University of Essex, UK)

Publisher's Version

Complexity Classification of Counting Graph Homomorphisms Modulo a Prime Number
Andrei A. Bulatov and Amirhossein Kazeminia
(Simon Fraser University, Canada)

Publisher's Version

Session 6B

Towards Optimal Lower Bounds for k-Median and k-Means Coresets
Vincent Cohen-Addad, Kasper Green Larsen, David Saulpic, and Chris Schwiegelshohn
(Google Research, Switzerland; Aarhus University, Denmark; Sorbonne University, France)

Publisher's Version

Deterministic, Near-Linear 𝜀-Approximation Algorithm for Geometric Bipartite Matching
Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra, and Allen Xiao
(Duke University, USA; Dartmouth College, USA; Virginia Tech, USA)

Publisher's Version

Locality-Sensitive Orderings and Applications to Reliable Spanners
Arnold Filtser and Hung Le
(Bar-Ilan University, Israel; University of Massachusetts at Amherst, USA)

Publisher's Version

Nearly Optimal Vertex Fault-Tolerant Spanners in Optimal Time: Sequential, Distributed, and Parallel
Merav Parter
(Weizmann Institute of Science, Israel)

Publisher's Version

Maintaining Exact Distances under Multiple Edge Failures
Ran Duan and Hanlin Ren
(Tsinghua University, China; University of Oxford, UK)

Publisher's Version

Session 6C

Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime
Karl Bringmann, Alejandro Cassis, Nick Fischer, and Vasileios Nakos
(Saarland University, Germany; MPI-INF, Germany; RelationalAI, USA)

Publisher's Version

Edge Sampling and Graph Parameter Estimation via Vertex Neighborhood Accesses
Jakub Tětek and Mikkel Thorup
(University of Copenhagen, Denmark)

Publisher's Version

Low-Rank Approximation with 1/𝜖^1/3 Matrix-Vector Products
Ainesh Bakshi, Kenneth L. Clarkson, and David P. Woodruff
(Carnegie Mellon University, USA; IBM Research, USA)

Publisher's Version

Sublinear Time Spectral Density Estimation
Vladimir Braverman, Aditya Krishnan, and Christopher Musco
(Johns Hopkins University, USA; New York University, USA)

Publisher's Version

Memory Bounds for the Experts Problem
Vaidehi Srinivas, David P. Woodruff, Ziyu Xu, and Samson Zhou
(Northwestern University, USA; Carnegie Mellon University, USA)

Publisher's Version

Session 7A

A Strong Version of Cobham’s Theorem
Philipp Hieronymi and Christian Schulz
(University of Bonn, Germany; University of Illinois at Urbana-Champaign, USA)

Publisher's Version

3.1n − o(n) Circuit Lower Bounds for Explicit Functions
Jiatu Li and Tianqi Yang
(Tsinghua University, China)

Publisher's Version

The Approximate Degree of DNF and CNF Formulas
Alexander A. Sherstov
(University of California at Los Angeles, USA)

Publisher's Version

Verifying the Unseen: Interactive Proofs for Label-Invariant Distribution Properties
Tal Herman and Guy N. Rothblum
(Weizmann Institute of Science, Israel)

Publisher's Version

Randomized Communication and Implicit Graph Representations
Nathaniel Harms, Sebastian Wild, and Viktor Zamaraev
(University of Waterloo, Canada; University of Liverpool, UK)

Publisher's Version

Session 7B

Robustly Learning Mixtures of k Arbitrary Gaussians
Ainesh Bakshi, Ilias Diakonikolas, He Jia, Daniel M. Kane, Pravesh K. Kothari, and Santosh S. Vempala
(Carnegie Mellon University, USA; University of Wisconsin-Madison, USA; Georgia Institute of Technology, USA; University of California at San Diego, USA)

Publisher's Version

Clustering Mixtures with Almost Optimal Separation in Polynomial Time
Allen Liu and Jerry Li
(Massachusetts Institute of Technology, USA; Microsoft Research, USA)

Publisher's Version

Clustering Mixture Models in Almost-Linear Time via List-Decodable Mean Estimation
Ilias Diakonikolas, Daniel M. Kane, Daniel Kongsgaard, Jerry Li, and Kevin Tian
(University of Wisconsin-Madison, USA; University of California at San Diego, USA; Microsoft Research, USA; Stanford University, USA)

Publisher's Version

List-Decodable Covariance Estimation
Misha Ivkov and Pravesh K. Kothari
(Carnegie Mellon University, USA)

Publisher's Version

Session 7C

On the Optimal Time/Space Tradeoff for Hash Tables
Michael A. Bender, Martín Farach-Colton, John Kuszmaul, William Kuszmaul, and Mingmou Liu
(Stony Brook University, USA; Rutgers University, USA; Yale University, USA; Massachusetts Institute of Technology, USA; Nanyang Technological University, Singapore)

Publisher's Version

An Extendable Data Structure for Incremental Stable Perfect Hashing
Ioana Oriana Bercea and Guy Even
(IT University of Copenhagen, Denmark; Tel Aviv University, Israel)

Publisher's Version

Almost-Linear ε-Emulators for Planar Graphs
Hsien-Chih Chang, Robert Krauthgamer, and Zihan Tan
(Dartmouth College, USA; Weizmann Institute of Science, Israel; University of Chicago, USA)

Publisher's Version

Hop-Constrained Expander Decompositions, Oblivious Routing, and Distributed Universal Optimality
Bernhard Haeupler, Harald Räcke, and Mohsen Ghaffari
(Carnegie Mellon University, USA; ETH Zurich, Switzerland; TU Munich, Germany)

Publisher's Version

Optimal Oblivious Reconfigurable Networks
Daniel Amir, Tegan Wilson, Vishal Shrivastav, Hakim Weatherspoon, Robert Kleinberg, and Rachit Agarwal
(Cornell University, USA; Purdue University, USA)

Publisher's Version

Session 8A

Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead
Noga Ron-Zewi and Ron D. Rothblum
(University of Haifa, Israel; Technion, Israel)

Publisher's Version

Rate One-Third Non-malleable Codes
Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, and Sruthi Sekar
(National University of Singapore, Singapore; IISc Bangalore, India; Microsoft Research, India; University of California at Berkeley, USA)

Publisher's Version

Deniable Encryption in a Quantum World
Andrea Coladangelo, Shafi Goldwasser, and Umesh Vazirani
(University of California at Berkeley, USA; Simons Institute for the Theory of Computing Berkeley, USA)

Publisher's Version

On the Complexity of Two-Party Differential Privacy
Iftach Haitner, Noam Mazor, Jad Silbak, and Eliad Tsfadia
(Tel Aviv University, Israel)

Publisher's Version

Efficient Mean Estimation with Pure Differential Privacy via a Sum-of-Squares Exponential Mechanism
Samuel B. Hopkins, Gautam Kamath, and Mahbod Majid
(University of California at Berkeley, USA; Massachusetts Institute of Technology, USA; University of Waterloo, Canada)

Publisher's Version

Session 8B

Entropic Independence: Optimal Mixing of Down-Up Random Walks
Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, and Thuy-Duong Vuong
(Stanford University, USA)

Publisher's Version

Simple Parallel Algorithms for Single-Site Dynamics
Hongyang Liu and Yitong Yin
(Nanjing University, China)

Publisher's Version

Low-Temperature Ising Dynamics with Random Initializations
Reza Gheissari and Alistair Sinclair
(University of California at Berkeley, USA)

Publisher's Version

Computational Thresholds for the Fixed-Magnetization Ising Model
Charlie Carlson, Ewan Davies, Alexandra Kolla, and Will Perkins
(University of Colorado Boulder, USA; University of California at Santa Cruz, USA; University of Illinois at Chicago, USA)

Publisher's Version

Approximate Counting and Sampling via Local Central Limit Theorems
Vishesh Jain, Will Perkins, Ashwin Sah, and Mehtaab Sawhney
(Stanford University, USA; University of Illinois at Chicago, USA; Massachusetts Institute of Technology, USA)

Publisher's Version

Session 8C

Hardness of Approximation in P via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond
Amir Abboud, Karl Bringmann, Seri Khoury, and Or Zamir
(Weizmann Institute of Science, Israel; Saarland University, Germany; MPI-INF, Germany; University of California at Berkeley, USA; Institute for Advanced Study at Princeton, USA)

Publisher's Version

Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV
Timothy M. Chan, Virginia Vassilevska Williams, and Yinzhan Xu
(University of Illinois at Urbana-Champaign, USA; Massachusetts Institute of Technology, USA)

Publisher's Version

Tight Dynamic Problem Lower Bounds from Generalized BMM and OMv
Ce Jin and Yinzhan Xu
(Massachusetts Institute of Technology, USA)

Publisher's Version

Faster Min-Plus Product for Monotone Instances
Shucheng Chi, Ran Duan, Tianle Xie, and Tianyi Zhang
(Tsinghua University, China; Tel Aviv University, Israel)

Publisher's Version

Counting Small Induced Subgraphs with Hereditary Properties
Jacob Focke and Marc Roth
(CISPA, Germany; University of Oxford, UK)

Publisher's Version

Session 9A

Pseudodeterminism: Promises and Lowerbounds
Peter Dixon, A. Pavan, Jason Vander Woude, and N. V. Vinodchandran
(Ben-Gurion University of the Negev, Israel; Iowa State University, USA; University of Nebraska-Lincoln, USA)

Publisher's Version

Worst-Case to Average-Case Reductions via Additive Combinatorics
Vahid R. Asadi, Alexander Golovnev, Tom Gur, and Igor Shinkar
(University of Waterloo, Canada; Georgetown University, USA; University of Warwick, UK; Simon Fraser University, Canada)

Publisher's Version

Robustness of Average-Case Meta-Complexity via Pseudorandomness
Rahul Ilango, Hanlin Ren, and Rahul Santhanam
(Massachusetts Institute of Technology, USA; Oxford University, UK)

Publisher's Version

Extractors for Sum of Two Sources
Eshan Chattopadhyay and Jyun-Jie Liao
(Cornell University, USA)

Publisher's Version

Session 9B

Breaching the 2-Approximation Barrier for the Forest Augmentation Problem
Fabrizio Grandoni, Afrouz Jabal Ameli, and Vera Traub
(USI-SUPSI, Switzerland; ETH Zurich, Switzerland)

Publisher's Version

An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-subgraph Problem
Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan, and Xinzhi Zhang
(University of Washington, USA)

Publisher's Version

Improved Approximations for Euclidean k-Means and k-Median, via Nested Quasi-Independent Sets
Vincent Cohen-Addad, Hossein Esfandiari, Vahab Mirrokni, and Shyam Narayanan
(Google Research, Switzerland; Google Research, USA; Massachusetts Institute of Technology, USA)

Publisher's Version

Explainable k-Means: Don’t Be Greedy, Plant Bigger Trees!
Konstantin Makarychev and Liren Shan
(Northwestern University, USA)

Publisher's Version

Session 9C

Subquadratic Dynamic Path Reporting in Directed Graphs against an Adaptive Adversary
Adam Karczmarz, Anish Mukherjee, and Piotr Sankowski
(University of Warsaw, Poland; IDEAS NCBR, Poland)

Publisher's Version

Dynamic Suffix Array with Polylogarithmic Queries and Updates
Dominik Kempa and Tomasz Kociumaka
(Stony Brook University, USA; University of California at Berkeley, USA)

Publisher's Version

Dynamic Algorithms against an Adaptive Adversary: Generic Constructions and Lower Bounds
Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, and Uri Stemmer
(Ben-Gurion University of the Negev, Israel; Tel Aviv University, Israel; Google Research, Israel; Georgetown University, USA; University of Michigan, USA)

Publisher's Version

On the Complexity of Dynamic Submodular Maximization
Xi Chen and Binghui Peng
(Columbia University, USA)

Publisher's Version

proc time: 0.32