• Description

CHAPTERS

CHAPTERS

For selected items:
Full Access

Front Matter

pp. i–xx
Abstract
Full Access

Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates

pp. 1–47
Abstract
Full Access

Maintaining Expander Decompositions via Sparse Cuts

pp. 48–69
Abstract
Full Access

Fully Dynamic Exact Edge Connectivity in Sublinear Time

pp. 70–86
Abstract
Full Access

Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths

pp. 87–99
Abstract
Full Access

Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time

pp. 100–128
Abstract
Full Access

Dynamic Algorithms for Maximum Matching Size

pp. 129–162
Abstract
Full Access

Closing the Gap Between Directed Hopsets and Shortcut Sets

pp. 163–182
Abstract
Full Access

Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction

pp. 183–211
Abstract
Full Access

Faster and Unified Algorithms for Diameter Reducing Shortcuts and Minimum Chain Covers

pp. 212–239
Abstract
Full Access

Near-Linear Time Approximations for Cut Problems via Fair Cuts

pp. 240–275
Abstract
Full Access

Fast Discrepancy Minimization with Hereditary Guarantees

pp. 276–289
Abstract
Full Access

A tight quasi-polynomial bound for Global Label Min-Cut

pp. 290–303
Abstract
Full Access

Fair allocation of a multiset of indivisible items

pp. 304–331
Abstract
Full Access

The Price of Stability for First Price Auction

pp. 332–352
Abstract
Full Access

Competitive Information Design for Pandora's Box

pp. 353–381
Abstract
Full Access

Optimal Pricing Schemes for an Impatient Buyer

pp. 382–398
Abstract
Full Access

Pricing Query Complexity of Revenue Maximization

pp. 399–415
Abstract
Full Access

Interdependent Public Projects

pp. 416–443
Abstract
Full Access

Stronger 3SUM-Indexing Lower Bounds

pp. 444–455
Abstract
Full Access

Tight Bounds for Monotone Minimal Perfect Hashing

pp. 456–476
Abstract
Full Access

Tiny Pointers

pp. 477–508
Abstract
Full Access

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition

pp. 509–534
Abstract
Full Access

A Nearly-Tight Analysis of Multipass Pairing Heaps

pp. 535–548
Abstract
Full Access

A Tight Analysis of Slim Heaps and Smooth Heaps

pp. 549–567
Abstract
Full Access

Hierarchies of Minion Tests for PCSPs through Tensors

pp. 568–580
Abstract
Full Access

Short Synchronizing Words for Random Automata

pp. 581–604
Abstract
Full Access

Approximate Trace Reconstruction from a Single Trace

pp. 605–637
Abstract
Full Access

Sharp threshold sequence and universality for Ising perceptron models

pp. 638–674
Abstract
Full Access

On complex roots of the independence polynomial

pp. 675–699
Abstract
Full Access

Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time O(n log n) over all Finite Fields

pp. 700–737
Abstract
Full Access

Low Degree Testing over the Reals

pp. 738–792
Abstract
Full Access

Streaming algorithms for the missing item finding problem

pp. 793–818
Abstract
Full Access

Single-Pass Streaming Algorithms for Correlation Clustering

pp. 819–849
Abstract
Full Access

The ℓp-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines

pp. 850–877
Abstract
Full Access

Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut

pp. 878–924
Abstract
Full Access

Learning Hierarchical Cluster Structure of Graphs in Sublinear Time

pp. 925–939
Abstract
Full Access

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median

pp. 940–986
Abstract
Full Access

Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median

pp. 987–1011
Abstract
Full Access

A Nearly Tight Analysis of Greedy k-means++

pp. 1012–1070
Abstract
Full Access

On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem

pp. 1071–1089
Abstract
Full Access

Passing the Limits of Pure Local Search for Weighted k-Set Packing

pp. 1090–1137
Abstract
Full Access

An Improved Approximation for Maximum Weighted k-Set Packing

pp. 1138–1162
Abstract
Full Access

Testing and Learning Quantum Juntas Nearly Optimally

pp. 1163–1185
Abstract
Full Access

Mean estimation when you have the source code; or, quantum Monte Carlo methods

pp. 1186–1215
Abstract
Full Access

Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes

pp. 1216–1244
Abstract
Full Access

A Sublinear-Time Quantum Algorithm for Approximating Partition Functions

pp. 1245–1264
Abstract
Full Access

Quantum tomography using state-preparation unitaries

pp. 1265–1318
Abstract
Full Access

Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality

pp. 1319–1384
Abstract
Full Access

Halving by a Thousand Cuts or Punctures

pp. 1385–1397
Abstract
Full Access

On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings

pp. 1398–1413
Abstract
Full Access

Curve Simplification and Clustering under Fréchet Distance

pp. 1414–1432
Abstract
Full Access

Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours

pp. 1433–1463
Abstract
Full Access

Map matching queries on realistic input graphs under the Fréchet distance

pp. 1464–1492
Abstract
Full Access

Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures

pp. 1493–1511
Abstract
Full Access

Player-optimal Stable Regret for Bandit Learning in Matching Markets

pp. 1512–1522
Abstract
Full Access

Almost Tight Bounds for Online Facility Location in the Random-Order Model

pp. 1523–1544
Abstract
Full Access

Online Min-Max Paging

pp. 1545–1565
Abstract
Full Access

Online and Bandit Algorithms Beyond ℓp Norms

pp. 1566–1593
Abstract
Full Access

The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay

pp. 1594–1610
Abstract
Full Access

Online Prediction in Sub-linear Space

pp. 1611–1634
Abstract
Full Access

The Exact Bipartite Matching Polytope Has Exponential Extension Complexity

pp. 1635–1654
Abstract
Full Access

Shrunk subspaces via operator Sinkhorn iteration

pp. 1655–1668
Abstract
Full Access

Small Shadows of Lattice Polytopes

pp. 1669–1679
Abstract
Full Access

A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function

pp. 1680–1691
Abstract
Full Access

Integrality Gaps for Random Integer Programs via Discrepancy

pp. 1692–1733
Abstract
Full Access

Discrepancy Minimization via Regularization

pp. 1734–1758
Abstract
Full Access

A Subquadratic nε-approximation for the Continuous Fréchet Distance

pp. 1759–1776
Abstract
Full Access

Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs

pp. 1777–1805
Abstract
Full Access

Online Sorting and Translational Packing of Convex Polygons

pp. 1806–1833
Abstract
Full Access

Economical Convex Coverings and Applications

pp. 1834–1861
Abstract
Full Access

4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time

pp. 1862–1876
Abstract
Full Access

Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency

pp. 1877–1904
Abstract
Full Access

Minimizing Completion Times for Stochastic Jobs via Batched Free Times

pp. 1905–1930
Abstract
Full Access

Beating (1 - 1/e)-Approximation for Weighted Stochastic Matching

pp. 1931–1961
Abstract
Full Access

Superpolynomial lower bounds for decision tree learning and testing

pp. 1962–1994
Abstract
Full Access

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs

pp. 1995–2014
Abstract
Full Access

Secretary Problems: The Power of a Single Sample

pp. 2015–2029
Abstract
Full Access

Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)

pp. 2030–2068
Abstract
Full Access

Packing cycles in planar and bounded-genus graphs

pp. 2069–2086
Abstract
Full Access

Computing Square Colorings on Bounded-Treewidth and Planar Graphs

pp. 2087–2110
Abstract
Full Access

Excluding Single-Crossing Matching Minors in Bipartite Graphs

pp. 2111–2121
Abstract
Full Access

A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems

pp. 2122–2213
Abstract
Full Access

Shortest Cycles With Monotone Submodular Costs

pp. 2214–2227
Abstract
Full Access

A Framework for Approximation Schemes on Disk Graphs

pp. 2228–2241
Abstract
Full Access

Improved girth approximation in weighted undirected graphs

pp. 2242–2255
Abstract
Full Access

Approximate Graph Colouring and Crystals

pp. 2256–2267
Abstract
Full Access

Weisfeiler-Leman and Graph Spectra

pp. 2268–2285
Abstract
Full Access

Fast algorithms for solving the Hamilton Cycle problem with high probability

pp. 2286–2323
Abstract
Full Access

A simple and sharper proof of the hypergraph Moore bound

pp. 2324–2344
Abstract
Full Access

Small subgraphs with large average degree

pp. 2345–2353
Abstract
Full Access

Exact Flow Sparsification Requires Unbounded Size

pp. 2354–2367
Abstract
Full Access

Improved Approximation for Two-Edge-Connectivity

pp. 2368–2410
Abstract
Full Access

Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models

pp. 2411–2428
Abstract
Full Access

Approximation Algorithms for Steiner Tree Augmentation Problems

pp. 2429–2448
Abstract
Full Access

Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows

pp. 2449–2488
Abstract
Full Access

Faster Computation of 3-Edge-Connected Components in Digraphs

pp. 2489–2531
Abstract
Full Access

Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization

pp. 2532–2566
Abstract
Full Access

Fast Distributed Brooks' Theorem

pp. 2567–2588
Abstract
Full Access

Optimal Deterministic Massively Parallel Connectivity on Forests

pp. 2589–2631
Abstract
Full Access

Distributed Maximal Matching and Maximal Independent Set on Hypergraphs

pp. 2632–2676
Abstract
Full Access

Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries

pp. 2677–2727
Abstract
Full Access

A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander Graphs

pp. 2728–2745
Abstract
Full Access

The complete classification for quantified equality constraints

pp. 2746–2760
Abstract
Full Access

Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube Test

pp. 2761–2776
Abstract
Full Access

Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete

pp. 2777–2815
Abstract
Full Access

Algorithmizing the Multiplicity Schwartz-Zippel Lemma

pp. 2816–2835
Abstract
Full Access

Query Complexity of Inversion Minimization on Trees

pp. 2836–2866
Abstract
Full Access

Efficient resilient functions

pp. 2867–2874
Abstract
Full Access

Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole

pp. 2875–2897
Abstract
Full Access

Generalized Unrelated Machine Scheduling Problem

pp. 2898–2916
Abstract
Full Access

Improved Approximations for Unrelated Machine Scheduling

pp. 2917–2946
Abstract
Full Access

On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs

pp. 2947–2960
Abstract
Full Access

Approximating Knapsack and Partition via Dense Subset Sums

pp. 2961–2979
Abstract
Full Access

On Problems Related to Unbounded SubsetSum: A Unified Combinatorial Approach

pp. 2980–2990
Abstract
Full Access

Conflict-free hypergraph matchings

pp. 2991–3005
Abstract
Full Access

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth

pp. 3006–3028
Abstract
Full Access

Zigzagging through acyclic orientations of chordal graphs and hypergraphs

pp. 3029–3042
Abstract
Full Access

A half-integral Erdős-Pósa theorem for directed odd cycles

pp. 3043–3062
Abstract
Full Access

Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced Subgraphs

pp. 3063–3097
Abstract
Full Access

Graph Classes with Few Minimal Separators. II. A Dichotomy

pp. 3098–3178
Abstract
Full Access

Almost Consistent Systems of Linear Equations

pp. 3179–3217
Abstract
Full Access

Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints

pp. 3218–3228
Abstract
Full Access

Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation

pp. 3229–3244
Abstract
Full Access

Polynomial formulations as a barrier for reduction-based hardness proofs

pp. 3245–3281
Abstract
Full Access

A logic-based algorithmic meta-theorem for mim-width

pp. 3282–3304
Abstract
Full Access

Constant Approximating Parameterized k-SETCOVER is W[2]-hard

pp. 3305–3316
Abstract
Full Access

Subexponential mixing for partition chains on grid-like graphs

pp. 3317–3329
Abstract
Full Access

Improved Bounds for Sampling Solutions of Random CNF Formulas

pp. 3330–3361
Abstract
Full Access

Moser-Tardos Algorithm: Beyond Shearer's Bound

pp. 3362–3387
Abstract
Full Access

Deterministic counting Lovász local lemma beyond linear programming

pp. 3388–3425
Abstract
Full Access

Instability of backoff protocols with arbitrary arrival rates

pp. 3426–3436
Abstract
Full Access

From Algorithms to Connectivity and Back: Finding a Giant Component in Random k-SAT

pp. 3437–3470
Abstract
Full Access

Robust Voting Rules from Algorithmic Robust Statistics

pp. 3471–3512
Abstract
Full Access

Higher degree sum-of-squares relaxations robust against oblivious outliers

pp. 3513–3550
Abstract
Full Access

Non-Stochastic CDF Estimation Using Threshold Queries

pp. 3551–3572
Abstract
Full Access

Positivity of the symmetric group characters is as hard as the polynomial time hierarchy

pp. 3573–3586
Abstract
Full Access

Interactive Coding with Small Memory

pp. 3587–3613
Abstract
Full Access

Concentration of polynomial random matrices via Efron-Stein inequalities

pp. 3614–3653
Abstract
Full Access

Kernelization for Graph Packing Problems via Rainbow Matching

pp. 3654–3663
Abstract
Full Access

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs

pp. 3664–3683
Abstract
Full Access

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes

pp. 3684–3699
Abstract
Full Access

Fixed-Parameter Tractability of Maximum Colored Path and Beyond

pp. 3700–3712
Abstract
Full Access

Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage

pp. 3713–3733
Abstract
Full Access

Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in k2 and Linear in n

pp. 3734–3758
Abstract
Full Access

“Who is Next in Line?” On the Significance of Knowing the Arrival Order in Bayesian Online Settings

pp. 3759–3776
Abstract
Full Access

A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games

pp. 3777–3787
Abstract
Full Access

Bidder Subset Selection Problem in Auction Design

pp. 3788–3801
Abstract
Full Access

Simple Mechanisms for Non-linear Agents

pp. 3802–3816
Abstract
Full Access

Sampling Equilibria: Fast No-Regret Learning in Structured Games

pp. 3817–3855
Abstract
Full Access

Foundations of Transaction Fee Mechanism Design

pp. 3856–3899
Abstract
Full Access

Beating Greedy Matching in Sublinear Time

pp. 3900–3945
Abstract
Full Access

Spencer's theorem in nearly input-sparsity time

pp. 3946–3958
Abstract
Full Access

Near-Linear Sample Complexity for Lp Polynomial Regression

pp. 3959–4025
Abstract
Full Access

Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time

pp. 4026–4049
Abstract
Full Access

Testing Convex Truncation

pp. 4050–4082
Abstract
Full Access

Streaming complexity of CSPs with randomly ordered constraints

pp. 4083–4103
Abstract
Full Access

Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlăduţ-Zink bounds

pp. 4104–4114
Abstract
Full Access

On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions

pp. 4115–4126
Abstract
Full Access

Toeplitz Low-Rank Approximation with Sublinear Query Complexity

pp. 4127–4158
Abstract
Full Access

Smaller Low-Depth Circuits for Kronecker Powers

pp. 4159–4187
Abstract
Full Access

Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank

pp. 4188–4204
Abstract
Full Access

Equivalence Test for Read-Once Arithmetic Formulas

pp. 4205–4272
Abstract
Full Access

Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring

pp. 4273–4295
Abstract
Full Access

A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph

pp. 4296–4334
Abstract
Full Access

Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection

pp. 4335–4353
Abstract
Full Access

Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth

pp. 4354–4372
Abstract
Full Access

Massively Parallel Computation on Embedded Planar Graphs

pp. 4373–4408
Abstract
Full Access

Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond

pp. 4409–4447
Abstract
Full Access

Balanced Allocations with Heterogeneous Bins: The Power of Memory

pp. 4448–4477
Abstract
Full Access

A Near-Linear Time Sampler for the Ising Model with External Field

pp. 4478–4503
Abstract
Full Access

Almost-Linear Planted Cliques Elude the Metropolis Process

pp. 4504–4539
Abstract
Full Access

The Need for Seed (in the abstract Tile Assembly Model)

pp. 4540–4589
Abstract
Full Access

Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth

pp. 4590–4605
Abstract
Full Access

Spatial mixing and the random-cluster dynamics on lattices

pp. 4606–4621
Abstract
Full Access

Online Lewis Weight Sampling

pp. 4622–4666
Abstract
Full Access

Super-resolution and Robust Sparse Continuous Fourier Transform in Any Constant Dimension: Nearly Linear Time and Sample Complexity

pp. 4667–4767
Abstract
Full Access

Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms

pp. 4768–4845
Abstract
Full Access

Cubic Goldreich-Levin

pp. 4846–4892
Abstract
Full Access

Query Complexity of the Metric Steiner Tree Problem

pp. 4893–4935
Abstract
Full Access

Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders

pp. 4936–4965
Abstract
Full Access

Stronger Privacy Amplification by Shuffling for Renyi and Approximate Differential Privacy

pp. 4966–4981
Abstract
Full Access

Private Query Release via the Johnson-Lindenstrauss Transform

pp. 4982–5002
Abstract
Full Access

Almost Tight Error Bounds on Differentially Private Continual Counting

pp. 5003–5039
Abstract
Full Access

Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds

pp. 5040–5067
Abstract
Full Access

Private Convex Optimization in General Norms

pp. 5068–5089
Abstract
Full Access

Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching

pp. 5090–5121
Abstract
Full Access

Breaking the 𝒪(n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees

pp. 5122–5202
Abstract
Full Access

Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance

pp. 5203–5219
Abstract
Full Access

Optimal Square Detection Over General Alphabets

pp. 5220–5242
Abstract
Full Access

Time-Space Tradeoffs for Element Distinctness and Set Intersection via Pseudorandomness

pp. 5243–5281
Abstract
cover image Proceedings

Recommended Content

40 off sale logo