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

Title Page

Welcome from the Program Chair

STOC 2022 Conference Organization

Sponsors

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

Article Search

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

Article Search

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; University of Waterloo, Canada)

Article Search

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)

Article Search

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

Article Search

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

Article Search

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

Article Search

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

Preprint

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)

Article Search

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

Article Search

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

Article Search

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

Article Search

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)

Article Search

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

Article Search

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)

Article Search

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

Article Search

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

Article Search

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

Article Search

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

Article Search

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

Article Search

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

Article Search Archive submitted (520 kB)

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

Preprint

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)

Article Search

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

Article Search

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)

Article Search

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)

Article Search

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

Preprint

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)

Article Search Info

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

Preprint

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

Article Search

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)

Article Search

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

Article Search

Deterministic, Near-Linear $\varepsilon$-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)

Article Search

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

Preprint

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)

Article Search

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

Article Search

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)

Article Search

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

Article Search

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, n.n.)

Article Search

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)

Article Search Info

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

Article Search

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

Preprint

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

Article Search

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

Preprint

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)

Article Search

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)

Article Search

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

Article Search

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)

Preprint

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

Article Search

(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)

Article Search

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

Article Search

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

Article Search

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

Article Search

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)

Article Search

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

Article Search

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

Article Search

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)

Article Search

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

Article Search

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)

Preprint

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)

Article Search

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)

Article Search

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

Article Search

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, n.n.; Princeton University, USA; CWI, Netherlands)

Article Search

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

Article Search

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

Article Search

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)

Article Search

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, n.n.; Google Research, USA; Massachusetts Institute of Technology, USA)

Preprint

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

Preprint

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

Article Search

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)

Preprint

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

Article Search

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)

Article Search

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

Article Search

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)

Preprint

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)

Article Search

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

Article Search

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

Article Search

Expanders via Local Edge Flips in Quasilinear Time
George Giakkoupis 
(Inria, France)

Preprint

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)

Article Search

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)

Article Search

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)

Article Search

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)

Article Search

Distributed $\Delta$-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)

Article Search

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)

Article Search

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

Article Search

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)

Article Search

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)

Article Search

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)

Article Search

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

Article Search

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

Article Search

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

Article Search

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)

Article Search

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

Article Search

Deterministic $(1+\varepsilon)$-Approximate Maximum Matching with $poly(1 / \varepsilon)$ 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)

Article Search Info

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)

Article Search

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)

Article Search

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

Article Search

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

Article Search

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

Article Search

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)

Preprint

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

Article Search

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

Article Search

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)

Article Search

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

Article Search

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)

Article Search

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

Article Search

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

Article Search

Sparsified Block Elimination for Directed Laplacians
Richard Peng and Zhuoqing Song 
(Georgia Institute of Technology, USA; Fudan University, China)

Article Search

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

Article Search

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

Article Search

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

Article Search

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

Article Search

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)

Article Search

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

Article Search

Matrix Anti-concentration Inequalities with Applications
Zipei Nie 
(Lagrange Mathematics and Computing Research Center, France)

Preprint

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

Preprint

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)

Article Search

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

Preprint

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)

Article Search

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)

Article Search

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; University of California at Berkeley, USA; Institute for Advanced Study, n.n.)

Article Search

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

Article Search Info

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)

Article Search

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

Article Search

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

Article Search

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, n.n.)

Preprint

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

Article Search

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

Article Search

Undirected (1+epsilon)-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)

Article Search

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

Preprint

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)

Article Search

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

Article Search

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

Article Search

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)

Article Search