1. Home
  2. Proceedings
  3. FOCS
  4. FOCS 2024
Default Cover Image

2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)

Oct. 27 2024 to Oct. 30 2024

Chicago, IL, USA

ISBN: 979-8-3315-1674-1

Table of Contents

ProceedingsFreely available from IEEE.pp. 1-1
Title PageFreely available from IEEE.pp. 1-1
Copyright PageFreely available from IEEE.pp. 1-1
Table of ContentsFreely available from IEEE.pp. v-xviii
Welcome MessageFreely available from IEEE.pp. xix-xix
Program CommitteeFreely available from IEEE.pp. xx-xx
ReviewersFreely available from IEEE.pp. xxi-xxxi
Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid TheoremFull-text access may be available. Sign in or learn about subscription options.pp. 1-20
by Meike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani, Irene Muzi
First-Order Model Checking on Monadically Stable Graph ClassesFull-text access may be available. Sign in or learn about subscription options.pp. 21-30
by Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michał Pilipczuk, Szymon Toruńczyk
Obstructions to Erdös-Pósa Dualities for MinorsFull-text access may be available. Sign in or learn about subscription options.pp. 31-52
by Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
Minor Containment and Disjoint Paths in Almost-Linear TimeFull-text access may be available. Sign in or learn about subscription options.pp. 53-61
by Tuukka Korhonen, Michał Pilipczuk, Giannos Stamoulis
Computing the 3-Edge-Connected Components of Directed Graphs in Linear TimeFull-text access may be available. Sign in or learn about subscription options.pp. 62-85
by Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
Three-Edge-Coloring Projective Planar Cubic Graphs: A Generalization of the Four Color TheoremFull-text access may be available. Sign in or learn about subscription options.pp. 86-105
by Yuta Inoue, Ken-Ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe
O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load ThresholdFull-text access may be available. Sign in or learn about subscription options.pp. 106-119
by Tolson Bell, Alan Frieze
Fast Mixing in Sparse Random Ising Models*Full-text access may be available. Sign in or learn about subscription options.pp. 120-128
by Kuikui Liu, Sidhanth Mohanty, Amit Rajaraman, David X. Wu
A Sampling Lovász Local Lemma for Large Domain SizesFull-text access may be available. Sign in or learn about subscription options.pp. 129-150
by Chunyang Wang, Yitong Yin
Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical DensityFull-text access may be available. Sign in or learn about subscription options.pp. 151-165
by Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin
Computational Dynamical SystemsFull-text access may be available. Sign in or learn about subscription options.pp. 166-202
by Jordan Cotler, Semon Rezchikov
Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains*Full-text access may be available. Sign in or learn about subscription options.pp. 203-215
by Kuikui Liu, Sidhanth Mohanty, Prasad Raghavendra, Amit Rajaraman, David X. Wu
Fully Dynamic k-\text{Clustering} with Fast Update Time and Small RecourseFull-text access may be available. Sign in or learn about subscription options.pp. 216-227
by Sayan Bhattacharya, Martín Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis
On Approximate Fully-Dynamic Matching and Online Matrix-Vector MultiplicationFull-text access may be available. Sign in or learn about subscription options.pp. 228-243
by Yang P. Liu
Predict to Minimize Swap Regret for All Payoff-Bounded TasksFull-text access may be available. Sign in or learn about subscription options.pp. 244-263
by Lunjia Hu, Yifan Wu
A Lossless Deamortization for Dynamic Greedy Set CoverFull-text access may be available. Sign in or learn about subscription options.pp. 264-290
by Shay Solomon, Amitai Uzrad, Tianyi Zhang
The Online Submodular Assignment ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 291-313
by Daniel Hathcock, Billy Jin, Kalen Patton, Sherry Sarkar, Michael Zlatin
Fully Dynamic Matching and Ordered Ruzsa-Szemerédi GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 314-327
by Soheil Behnezhad, Alma Ghafari
Fast List Decoding of Univariate Multiplicity and Folded Reed-Solomon CodesFull-text access may be available. Sign in or learn about subscription options.pp. 328-343
by Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
Decoding Quasi-Cyclic Quantum LDPC CodesFull-text access may be available. Sign in or learn about subscription options.pp. 344-368
by Louis Golowich, Venkatesan Guruswami
Optimal Coding for Randomized Kolmogorov Complexity and Its ApplicationsFull-text access may be available. Sign in or learn about subscription options.pp. 369-378
by Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima
Expansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable CodesFull-text access may be available. Sign in or learn about subscription options.pp. 379-385
by Irit Dinur, Ting-Chun Lin, Thomas Vidick
Communication Separations for Truthful Auctions: Breaking the Two-Player BarrierFull-text access may be available. Sign in or learn about subscription options.pp. 386-405
by Shiri Ron, Clayton Thomas, S. Matthew Weinberg, Qianfan Zhang
On Pigeonhole Principles and Ramsey in TFNPFull-text access may be available. Sign in or learn about subscription options.pp. 406-428
by Siddhartha Jain, Jiawei Li, Robert Robere, Zhiyang Xun
An XOR Lemma for Deterministic Communication ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 429-432
by Siddharth Iyer, Anup Rao
The Communication Complexity of Approximating Matrix RankFull-text access may be available. Sign in or learn about subscription options.pp. 433-462
by Alexander A. Sherstov, Andrey A. Storozhenko
Efficient Approximate Unitary Designs from Random Pauli RotationsFull-text access may be available. Sign in or learn about subscription options.pp. 463-475
by Jeongwan Haah, Yunchao Liu, Xinyu Tan
Efficient Unitary Designs from Random Sums and PermutationsFull-text access may be available. Sign in or learn about subscription options.pp. 476-484
by Chi-Fang Chen, Jordan Docter, Michelle Xu, Adam Bouland, Fernando G.S.L. Brandão, Patrick Hayden
Simple Constructions of Linear-Depth t-Designs and Pseudorandom UnitariesFull-text access may be available. Sign in or learn about subscription options.pp. 485-492
by Tony Metger, Alexander Poremba, Makrand Sinha, Henry Yuen
Gapped Clique Homology on Weighted Graphs is QMA1-Hard and Contained in QMAFull-text access may be available. Sign in or learn about subscription options.pp. 493-504
by Robbie King, Tamara Kohler
Reverse Mathematics of Complexity Lower BoundsFull-text access may be available. Sign in or learn about subscription options.pp. 505-527
by Lijie Chen, Jiatu Li, Igor C. Oliveira
Interactive Proofs for General Distribution PropertiesFull-text access may be available. Sign in or learn about subscription options.pp. 528-538
by Tal Herman, Guy Rothblum
Trading Determinism for Noncommutativity in Edmonds' ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 539-559
by V. Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
\prod_{2}^{P} vs PSpace Dichotomy for the Quantified Constraint Satisfaction ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 560-572
by Dmitriy Zhuk
Jump Operators, Interactive Proofs and Proof Complexity GeneratorsFull-text access may be available. Sign in or learn about subscription options.pp. 573-593
by Erfan Khaniki
Optimal Bounds for Open Addressing Without ReorderingFull-text access may be available. Sign in or learn about subscription options.pp. 594-605
by Martín Farach-Colton, Andrew Krapivin, William Kuszmaul
Tight Analyses of Ordered and Unordered Linear ProbingFull-text access may be available. Sign in or learn about subscription options.pp. 606-635
by Mark Braverman, William Kuszmaul
Tight Bounds for Classical Open AddressingFull-text access may be available. Sign in or learn about subscription options.pp. 636-657
by Michael A. Bender, William Kuszmaul, Renfei Zhou
Instance-Optimality in I/O-Efficient Sampling and Sequential EstimationFull-text access may be available. Sign in or learn about subscription options.pp. 658-688
by Shyam Narayanan, Václav Rozhoň, Jakub Tětek, Mikkel Thorup
An Optimal Algorithm for Sorting Pattern-Avoiding SequencesFull-text access may be available. Sign in or learn about subscription options.pp. 689-699
by Michal Opler
Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid ConstraintFull-text access may be available. Sign in or learn about subscription options.pp. 700-712
by Niv Buchbinder, Moran Feldman
On Approximating Cutwidth and PathwidthFull-text access may be available. Sign in or learn about subscription options.pp. 713-729
by Nikhil Bansal, Dor Katzelnick, Roy Schwartz
The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller Than 2Full-text access may be available. Sign in or learn about subscription options.pp. 730-753
by Jarosław Byrka, Fabrizio Grandoni, Vera Traub
Efficient Approximation of Fractional Hypertree WidthFull-text access may be available. Sign in or learn about subscription options.pp. 754-779
by Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
Canonical Forms for Matrix Tuples in Polynomial TimeFull-text access may be available. Sign in or learn about subscription options.pp. 780-789
by Youming Qiao, Xiaorui Sun
Polynomial Calculus Sizes Over the Boolean and Fourier Bases are IncomparableFull-text access may be available. Sign in or learn about subscription options.pp. 790-796
by Sasank Mouli
A Dense Model Theorem for the Boolean SliceFull-text access may be available. Sign in or learn about subscription options.pp. 797-805
by Gil Kalai, Noam Lifshitz, Dor Minzer, Tamar Ziegler
Dot-Product Proofs and Their ApplicationsFull-text access may be available. Sign in or learn about subscription options.pp. 806-825
by Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu
Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXsFull-text access may be available. Sign in or learn about subscription options.pp. 826-861
by Yotam Dikstein, Irit Dinur, Alexander Lubotzky
Constant Degree Direct Product Testers with Small SoundnessFull-text access may be available. Sign in or learn about subscription options.pp. 862-869
by Mitali Bafna, Noam Lifshitz, Dor Minzer
Chernoff Bounds and Reverse Hypercontractivity on HDXFull-text access may be available. Sign in or learn about subscription options.pp. 870-919
by Yotam Dikstein, Max Hopkins
Approximation Algorithms for Noncommutative CSPsFull-text access may be available. Sign in or learn about subscription options.pp. 920-929
by Eric Culf, Hamoon Mousavi, Taro Spirig
Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the \sqrt{n} Dimension ThresholdFull-text access may be available. Sign in or learn about subscription options.pp. 930-948
by Venkatesan Guruswami, Jun-Ting Hsieh, Prasad Raghavendra
Sum-of-Squares Lower Bounds for Non-Gaussian Component AnalysisFull-text access may be available. Sign in or learn about subscription options.pp. 949-958
by Ilias Diakonikolas, Sushrut Karmalkar, Shuo Pang, Aaron Potechin
Semirandom Planted Clique and the Restricted Isometry PropertyFull-text access may be available. Sign in or learn about subscription options.pp. 959-969
by Jarosław Błasiok, Rares-Darius Buhai, Pravesh K. Kothari, David Steurer
Efficient Certificates of Anti-Concentration Beyond GaussiansFull-text access may be available. Sign in or learn about subscription options.pp. 970-987
by Ainesh Bakshi, Pravesh K. Kothari, Goutham Rajendran, Madhur Tulsiani, Aravindan Vijayaraghavan
Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond GaussiansFull-text access may be available. Sign in or learn about subscription options.pp. 988-1006
by Jane H. Lee, Anay Mehrotra, Manolis Zampetakis
Tensor Cumulants for Statistical Inference on Invariant DistributionsFull-text access may be available. Sign in or learn about subscription options.pp. 1007-1026
by Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein
High-Temperature Gibbs States are Unentangled and Efficiently PreparableFull-text access may be available. Sign in or learn about subscription options.pp. 1027-1036
by Ainesh Bakshi, Allen Liu, Ankur Moitra, Ewin Tang
Structure Learning of Hamiltonians from Real-Time EvolutionFull-text access may be available. Sign in or learn about subscription options.pp. 1037-1050
by Ainesh Bakshi, Allen Liu, Ankur Moitra, Ewin Tang
Quantum Eigenvalue ProcessingFull-text access may be available. Sign in or learn about subscription options.pp. 1051-1062
by Guang Hao Low, Yuan Su
Quantum Computational Advantage with Constant-Temperature Gibbs SamplingFull-text access may be available. Sign in or learn about subscription options.pp. 1063-1085
by Thiago Bergamaschi, Chi-Fang Chen, Yunchao Liu
Optimal Tradeoffs for Estimating Pauli ObservablesFull-text access may be available. Sign in or learn about subscription options.pp. 1086-1105
by Sitan Chen, Weiyuan Gong, Qi Ye
A Computational Test of Contextuality and, Even Simpler Proofs of QuantumnessFull-text access may be available. Sign in or learn about subscription options.pp. 1106-1125
by Atul Singh Arora, Kishor Bharti, Alexandru Cojocaru, Andrea Coladangelo
Capacity Threshold for the Ising PerceptronFull-text access may be available. Sign in or learn about subscription options.pp. 1126-1136
by Brice Huang
Optimal Quantile Estimation: Beyond the Comparison ModelFull-text access may be available. Sign in or learn about subscription options.pp. 1137-1158
by Meghal Gupta, Mihir Singhal, Hongxun Wu
Proofs of Space with Maximal HardnessFull-text access may be available. Sign in or learn about subscription options.pp. 1159-1177
by Leonid Reyzin
Commitments are Equivalent to Statistically-Verifiable One-Way State GeneratorsFull-text access may be available. Sign in or learn about subscription options.pp. 1178-1192
by Rishabh Batra, Rahul Jain
Succinct Arguments for QMA from Standard Assumptions via Compiled Nonlocal GamesFull-text access may be available. Sign in or learn about subscription options.pp. 1193-1201
by Tony Metger, Anand Natarajan, Tina Zhang
Certifying Almost All Quantum States with Few Single-Qubit MeasurementsFull-text access may be available. Sign in or learn about subscription options.pp. 1202-1206
by Hsin-Yuan Huang, John Preskill, Mehdi Soleimanifar
How to Simulate Random Oracles with Auxiliary InputFull-text access may be available. Sign in or learn about subscription options.pp. 1207-1230
by Yevgeniy Dodis, Aayush Jain, Huijia Lin, Ji Luo, Daniel Wichs
Online Combinatorial Allocations and Auctions with Few SamplesFull-text access may be available. Sign in or learn about subscription options.pp. 1231-1250
by Paul Dütting, Thomas Kesselheim, Brendan Lucier, Rebecca Reiffenhäuser, Sahil Singla
Benchmark-Tight Approximation Ratio of Simple Mechanism for a Unit-Demand BuyerFull-text access may be available. Sign in or learn about subscription options.pp. 1251-1259
by Yaonan Jin, Pinyan Lu
Semi-Bandit Learning for Monotone Stochastic Optimization*Full-text access may be available. Sign in or learn about subscription options.pp. 1260-1274
by Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan
On Robustness to k-Wise Independence of Optimal Bayesian MechanismsFull-text access may be available. Sign in or learn about subscription options.pp. 1275-1293
by Nick Gravin, Zhiqi Wang
Hardness of Approximate Sperner and Applications to Envy-Free Cake CuttingFull-text access may be available. Sign in or learn about subscription options.pp. 1294-1331
by Ruiquan Gao, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
The Tractability Border of Reachability in Simple Vector Addition Systems with StatesFull-text access may be available. Sign in or learn about subscription options.pp. 1332-1354
by Dmitry Chistikov, Wojciech Czerwiński, Filip Mazowiecki, Łukasz Orlikowski, Henry Sinclair-Banks, Karol Węgrzycki
Hardness of Packing, Covering and Partitioning Simple Polygons with Unit SquaresFull-text access may be available. Sign in or learn about subscription options.pp. 1355-1371
by Mikkel Abrahamsen, Jack Stade
The Orthogonal Vectors Conjecture and Non-Uniform Circuit Lower BoundsFull-text access may be available. Sign in or learn about subscription options.pp. 1372-1387
by Ryan Williams
Strong vs. Weak Range Avoidance and the Linear Ordering PrincipleFull-text access may be available. Sign in or learn about subscription options.pp. 1388-1407
by Oliver Korten, Toniann Pitassi
Faster Isomorphism Testing of p-Groups of Frattini Class 2Full-text access may be available. Sign in or learn about subscription options.pp. 1408-1424
by Gábor Ivanyos, Euan J. Mendoza, Youming Qiao, Xiaorui Sun, Chuanqi Zhang
Boosting Uniformity in Quasirandom Groups: Fast and SimpleFull-text access may be available. Sign in or learn about subscription options.pp. 1425-1430
by Harm Derksen, Chin Ho Lee, Emanuele Viola
The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore TheoremFull-text access may be available. Sign in or learn about subscription options.pp. 1431-1450
by Guy Blanc, Alexandre Hayderi, Caleb Koch, Li-Yang Tan
On the Existence of Seedless Condensers: Exploring the TerrainFull-text access may be available. Sign in or learn about subscription options.pp. 1451-1469
by Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach
Tight Bounds for the Zig-Zag ProductFull-text access may be available. Sign in or learn about subscription options.pp. 1470-1499
by Gil Cohen, Itay Cohen, Gal Maor
Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of PseudorandomnessFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Jiatu Li, Edward Pyne, Roei Tell
Improved Condensers for Chor-Goldreich SourcesFull-text access may be available. Sign in or learn about subscription options.pp. 1513-1549
by Jesse Goodman, Xin Li, David Zuckerman
Improved Distance (Sensitivity) Oracles with Subquadratic SpaceFull-text access may be available. Sign in or learn about subscription options.pp. 1550-1558
by Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
Sparse Graph Counting and Kelley-Meka Bounds for Binary SystemsFull-text access may be available. Sign in or learn about subscription options.pp. 1559-1578
by Yuval Filmus, Hamed Hatami, Kaave Hosseini, Esty Kelman
Towards Instance-Optimal Euclidean SpannersFull-text access may be available. Sign in or learn about subscription options.pp. 1579-1609
by Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
Sensitivity, Proximity and FPT Algorithms for Exact Matroid ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 1610-1620
by Friedrich Eisenbrand, Lars Rohwedder, Karol Węgrzycki
Computational Hardness of Detecting Graph Lifts and Certifying Lift-Monotone Properties of Random Regular GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 1621-1633
by Dmitriy Kunisky, Xifan Yu
New Structures and Algorithms for Length-Constrained Expander DecompositionsFull-text access may be available. Sign in or learn about subscription options.pp. 1634-1645
by Bernhard Haeupler, D Ellis Hershkowitz, Zihan Tan
Showing 100 out of 141
Load More
Load All