FOCS 2025 Schedule

66th IEEE Symposium on Foundations of Computer Science

Dec 15 - Dec 17, 2025
Day
Show
Export current view:
Workshops Sunday, December 14
09:00 - 10:00
Track A Blackwattle 1
Breaking and Making Quantum Speedups
Organised by: Siddhartha Jain, Seyoon Ragavan, Alexander Schmidhuber, and Noah Shutty Website β†—
Track B Blackwattle 2
Approximate Nearest Neighbor Search: Bridging Theoretical Foundations and Industrial Frontiers
Organised by: Piotr Indyk, Rajesh Jayaram, and Ravi Krishnaswamy Website β†—
Track C Blackwattle 3
Space: Connecting Classical and Catalytic Approaches
Organised by: Ian Mertz and Ted Pyne Website β†—
10:00 - 10:30
Break
10:30 - 12:00
Track A Blackwattle 1
Breaking and Making Quantum Speedups
Organised by: Siddhartha Jain, Seyoon Ragavan, Alexander Schmidhuber, and Noah Shutty Website β†—
Track B Blackwattle 2
Approximate Nearest Neighbor Search: Bridging Theoretical Foundations and Industrial Frontiers
Organised by: Piotr Indyk, Rajesh Jayaram, and Ravi Krishnaswamy Website β†—
Track C Blackwattle 3
Space: Connecting Classical and Catalytic Approaches
Organised by: Ian Mertz and Ted Pyne Website β†—
12:00 - 13:30
Lunch break
13:30 - 15:00
Track A Blackwattle 1
Breaking and Making Quantum Speedups
Organised by: Siddhartha Jain, Seyoon Ragavan, Alexander Schmidhuber, and Noah Shutty Website β†—
Track B Blackwattle 2
Approximate Nearest Neighbor Search: Bridging Theoretical Foundations and Industrial Frontiers
Organised by: Piotr Indyk, Rajesh Jayaram, and Ravi Krishnaswamy Website β†—
Track C Blackwattle 3
The Localization Method for High-dimensional Inequalities
Organised by: Santosh S. Vempala Website β†—
15:00 - 15:30
Break
15:30 - 16:30
Track A Blackwattle 1
Breaking and Making Quantum Speedups
Organised by: Siddhartha Jain, Seyoon Ragavan, Alexander Schmidhuber, and Noah Shutty Website β†—
Track B Blackwattle 2
Approximate Nearest Neighbor Search: Bridging Theoretical Foundations and Industrial Frontiers
Organised by: Piotr Indyk, Rajesh Jayaram, and Ravi Krishnaswamy Website β†—
Track C Blackwattle 3
The Localization Method for High-dimensional Inequalities
Organised by: Santosh S. Vempala Website β†—
16:30 - 16:45
Break
16:45 - 17:30
18:00 - 20:00
Day 1 Monday, December 15
9:00 - 10:30
Track A (1A) Blackwattle 1
9:00-9:18 Online Edge Coloring: Sharp Thresholds
J. Blikstad, O. Svensson, R. Vintan, D. Wajc
graph algorithmsonline algorithms+1randomized algorithms
9:18-9:36 Edge-weighted Matching in the Dark
Z. Huang, E. Sun, X. Wu, J. Zhao
approximation algorithmsonline algorithms
9:36-9:54 Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
T. Kesselheim, M. Molinaro, K. Patton, S. Singla
approximation algorithmsonline algorithms
9:54-10:12 Optimal 4-Approximation for the Correlated Pandora’s Problem
N. Bansal, Z. Huang, Z. Zhu
approximation algorithmsonline algorithms
10:12-10:30 A Little Clairvoyance Is All You Need
A. Gupta, H. Kaplan, A. Lindermayr, J. SchlΓΆter, S. Yingchareonthawornchai
online algorithms
Track B (1B) Blackwattle 2
9:00-9:18 Integer multiplication is at least as hard as matrix transposition
D. Harvey, J. van der Hoeven
algebraic computationcomputational complexity
9:18-9:36 Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)
L. Wulf
approximation algorithmscombinatorial optimization+4combinatorics and graph theorycomputational complexitycomputational geometryhigh-dimensional algorithms
9:36-9:54 Asymptotically Optimal Inapproximability of E$k$-SAT Reconfiguration
S. Hirahara, N. Ohsaka
approximation algorithmscombinatorial optimization+1computational complexity
9:54-10:12 Ineffectiveness for Search and Undecidability of PCSP Meta-Problems
A. Larrauri
combinatorial optimizationcomputational complexity
10:12-10:30 Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices
V. Bhattiprolu, V. Guruswami, E. Lee, X. Ren
algorithmic coding theoryapproximation algorithms+3computational complexitycontinuous optimizationpseudorandomness and derandomization
Track C (1C) Blackwattle 3
9:00-9:18 Group Order is in QCMA
F. Le Gall, H. Nishimura, D. Thakkar
algebraic computationcomputational complexity+2quantum computingrandomized algorithms
9:18-9:36 Exponential improvements to the average-case hardness of BosonSampling
A. Bouland, S. Datta, B. Fefferman, F. Hernandez
quantum computing
9:36-9:54 RE-completeness of entangled constraint satisfaction problems
E. Culf, K. Mastel
computational complexityquantum computing
9:54-10:12 Gap-preserving reductions and RE-completeness of Independent Set Games
L. Mančinska, P. Spaas, T. Spirig, M. Vernooij
computational complexityquantum computing
10:12-10:30 Incompressibility and spectral gaps of random circuits
C. Chen, J. Haah, J. Haferkamp, Y. Liu, T. Metger, X. Tan
circuit complexitypseudorandomness and derandomization+1quantum computing
10:30 - 10:50
Break
10:50 - 12:02
Track A (2A) Blackwattle 1
10:50-11:08 Weighted k-Path and Other Problems in Almost O*(2^k) Deterministic Time via Dynamic Representative Sets
J. Nederlof
combinatorics and graph theorydata structures+2graph algorithmsparametrized algorithms
11:08-11:26 Improved 2-Approximate Shortest Paths for close vertex pairs
M. Gupta
data structuresgraph algorithms+1randomized algorithms
11:26-11:44 Paths and Intersections: Exact Emulators for Planar Graphs
G. Li, Z. Tan, T. Zhang
combinatorics and graph theorydata structures+1graph algorithms
11:44-12:02 Distance Approximating Minors for Planar and Minor-Free Graphs
H. Chang, J. Conroy
data structuresgraph algorithms
Track B (2B) Blackwattle 2
10:50-11:08 Factorization Norms and an Inverse Theorem for MaxCut
I. Balla, L. Hambardzumyan, I. Tomon
combinatorics and graph theorycommunication complexity+1spectral methods
11:08-11:26 More efficient sifting for grid norms, and applications to multiparty communication complexity
Z. Kelley, X. Lyu
combinatorics and graph theorycommunication complexity+1pseudorandomness and derandomization
11:26-11:44 Sign-Rank of k-Hamming Distance is Constant
M. GΓΆΓΆs, N. Harms, V. Imbach, D. Sokolov
communication complexitycomputational complexity
11:44-12:02 Direct Product Theorems for Randomized Query Complexity
S. Ben-David, E. Blais
analysis of Boolean functionscomputational complexity
Track C (2C) Blackwattle 3
10:50-11:08 The Sponge is Quantum Indifferentiable
G. Alagic, J. Carolan, C. Majenz, S. Tokat
cryptographyquantum computing+1quantum cryptography
11:08-11:26 Parallel Repetition for Post-Quantum Arguments
A. Huang, Y. Kalai
cryptographyquantum cryptography
11:26-11:44 On the Impossibility of SNARGs with Short CRS (or: Revisiting Gentry-Wichs Barrier in the Non-adaptive Setting)
L. Chen, Z. Jin
cryptography
11:44-12:02 On Succinct Obfuscation via Propositional Logic (or: How to use pv-IO)
A. Jain, Z. Jin, S. Mathialagan, O. Paneth
cryptography
12:02 - 13:30
Lunch break
13:30 - 14:30
Plenary Talk
Shafi Goldwasser, MIT and Berkeley
Recent Results In ML Safety using a Complexity/Cryptography Perspectives
14:30 - 15:00
Break
15:00 - 16:12
Track A (3A) Blackwattle 1
15:00-15:18 An Improved Greedy Approximation for (Metric) $k$-Means
M. Charikar, V. Cohen-Addad, R. Gao, F. Grandoni, E. Lee, E. van Wijland
approximation algorithms
15:18-15:36 Stochastic Knapsack without Relaxing the Capacity
A. De, S. Khanna, N. White
approximation algorithms
15:36-15:54 Adaptivity Gaps for Stochastic Probing with Subadditive Functions
J. Li, Y. Liu, Y. Zhang
approximation algorithmsonline algorithms
15:54-16:12 Stochastic scheduling with Bernoulli-type jobs through policy stratification
A. Antoniadis, R. Hoeksma, K. Schewior, M. Uetz
approximation algorithmscombinatorial optimization
Track B (3B) Blackwattle 2
15:00-15:18 Deterministic factorization of constant-depth algebraic circuits in subexponential time
S. Bhattacharjee, M. Kumar, V. Ramanathan, R. Saptharishi, S. Saraf
algebraic computationcomputational complexity+1pseudorandomness and derandomization
15:18-15:36 Rank Bounds and PIT for $\Sigma^3 \Pi \Sigma \Pi^d$ circuits via a non-linear Edelstein-Kelly theorem
A. Garg, R. Oliveira, A. Sengupta
algebraic computationcomputational geometry+1pseudorandomness and derandomization
15:36-15:54 Kronecker Powers, Orthogonal Vectors, and the Asymptotic Spectrum
J. Alman, B. Li
algebraic computationcircuit complexity
15:54-16:12 Complexity theory of orbit closure intersection for tensors: reductions, completeness, and graph isomorphism hardness
V. Lysikov, M. Walter
algebraic computationcomputational complexity
Track C (3C) Blackwattle 3
15:00-15:18 Cryptography meets worst-case complexity: Optimal security and more from iO and worst-case assumptions
R. Ilango, A. Lombardi
average-case algorithms and complexitycomputational complexity+1cryptography
15:18-15:36 Solving Linear Inequalities over Convex Sets & its Applications to Cryptography and Hydrodynamics
S. Basu, H. Khorasgani, H. Maji, H. Nguyen
communication complexitycomputational geometry+1cryptography
15:36-15:54 Binary Codes for Computationally Bounded Errors Under Standard Crypto Assumptions
G. Lu, J. Silbak, D. Wichs
cryptography
15:54-16:12 Succinct Homomorphic MACs from Groups and Applications
Y. Ishai, H. Li, H. Lin
cryptography
16:12 - 16:30
Break
16:30 - 17:24
Track A (4A) Blackwattle 1
16:30-16:48 Faster Mixing of the Jerrum-Sinclair Chain
X. Chen, W. Feng, Z. Ju, T. Miao, Y. Yin, X. Zhang
randomized algorithms
16:48-17:06 Rapid Mixing on Random Regular Graphs beyond Uniqueness
X. Chen, Z. Chen, Z. Chen, Y. Yin, X. Zhang
randomized algorithms
17:06-17:24 Deterministic counting from coupling independence
X. Chen, W. Feng, H. Guo, X. Zhang, Z. Zou
randomized algorithms
Track B (4B) Blackwattle 2
16:30-16:48 Bipartite Matching is in Catalytic Logspace
A. Agarwala, I. Mertz
computational complexitygraph algorithms+1pseudorandomness and derandomization
16:48-17:06 Collapsing Catalytic Classes
M. Koucky, I. Mertz, E. Pyne, S. Sami
computational complexitypseudorandomness and derandomization
17:06-17:24 Shuffling Cards When You Are of Very Little Brain: Low Memory Generation of Permutations
M. Naor, B. Menuhin
cryptographypseudorandomness and derandomization+2randomized algorithmsstreaming algorithms
Track C (4C) Blackwattle 3
16:30-16:48 A distillation–teleportation protocol for fault-tolerant QRAM
A. Dalzell, C. Hann, A. GilyΓ©n, S. McArdle, G. Salton, Q. Nguyen, A. Kubica, F. Brandao
quantum computing
16:48-17:06 Adversarially robust quantum state learning and testing
M. Aliakbarpour, V. Braverman, N. Chia, Y. Liu
computational complexityhigh-dimensional algorithms+1quantum computing
17:06-17:24 Learning quantum Gibbs states locally and efficiently
C. Chen, A. Anshu, Q. Nguyen
computational learning theoryquantum computing
18:00 - 19:30
Business Meeting Blackwattle 1-2
Day 2 Tuesday, December 16
9:00 - 10:30
Track A (5A) Blackwattle 1
9:00-9:18 Near-Optimal Fault-Tolerant Strong Connectivity Preservers
G. Hoppenworth, T. Saranurak, B. Wang
combinatorics and graph theorydata structures+2graph algorithmsparametrized algorithms
9:18-9:36 Deterministic Almost-Linear-Time Gomory-Hu Trees
A. Abboud, R. Kyng, J. Li, D. Panigrahi, M. Probst, T. Saranurak, W. Yuan, W. Yuan
combinatorics and graph theorydata structures+1graph algorithms
9:36-9:54 Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs
A. Bernstein, J. Blikstad, J. Li, T. Saranurak, T. Tu
graph algorithms
9:54-10:12 Generalized Flow in Nearly-linear Time on Moderately Dense Graphs
S. Jiang, M. Kapralov, L. Er Lu, A. Sidford
continuous optimizationgraph algorithms+1spectral methods
10:12-10:30 Almost Tight Additive Guarantees for $k$-Edge-Connectivity
N. Kumar, C. Swamy
approximation algorithmscombinatorial optimization
Track B (5B) Blackwattle 2
9:00-9:18 Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent
M. Levi, J. Mosheiff, N. Shagrithaya
combinatorics and graph theorypseudorandomness and derandomization
9:18-9:36 Maximally Extendable Product Codes are Good Coboundary Expanders
G. Kalachev, P. Panteleev
algorithmic coding theorycomputational complexity+1quantum computing
9:36-9:54 Near-Asymptotically-Good Quantum Codes with Transversal CCZ Gates and Sublinear-Weight Parity-Checks
L. Golowich, V. Guruswami
algorithmic coding theoryquantum computing
9:54-10:12 A k^{q/q-2} Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
O. Janzer, P. Manohar
algorithmic coding theorycombinatorics and graph theory+1spectral methods
10:12-10:30 Improved Lower Bounds for all Odd-Query Locally Decodable Codes
A. Basu, J. Hsieh, P. Kothari, A. Lin
algorithmic coding theorycombinatorics and graph theory+1spectral methods
Track C (5C) Blackwattle 3
9:00-9:18 An Improved Bound for the Beck-Fiala Conjecture
N. Bansal, H. Jiang
combinatorics and graph theoryrandomized algorithms
9:18-9:36 A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
R. Bourneuf, P. Charbit, S. Thomasse
combinatorial optimizationcombinatorics and graph theory
9:36-9:54 Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
B. Bedert, T. Nakajima, K. Okrasa, S. Zivny
approximation algorithmscombinatorics and graph theory
9:54-10:12 Cycle-factors of regular graphs via entropy
E. Hurley, A. Girao, L. Michel, N. Draganic, A. MΓΌyesser, M. Christoph
combinatorics and graph theorygraph algorithms+1randomized algorithms
10:12-10:30 Polynomial Bounds for the Graph Minor Structure Theorem
M. Gorsky, M. Seweryn, S. Wiederrecht
combinatorics and graph theorygraph algorithms+1parametrized algorithms
10:30 - 10:50
Break
10:50 - 12:02
Track A (6A) Blackwattle 1
10:50-11:08 The Power of Recursive Embeddings for $\ell_p$ Metrics
R. Krauthgamer, N. Petruschka, S. Sapir
approximation algorithmscomputational geometry+3data structureshigh-dimensional algorithmsrandomized algorithms
11:08-11:26 Embeddings into Similarity Measures for Nearest Neighbor Search
A. Andoni, N. Nosatzki
computational geometrydata structures+2high-dimensional algorithmssublinear algorithms
11:26-11:44 Average-Distortion Sketching
Y. Bao, A. Baweja, N. Menand, E. Waingarten, N. White, T. Zhang
streaming algorithmssublinear algorithms
11:44-12:02 Query-Efficient Fixpoints of $\ell_p$-Contractions
S. Haslebacher, J. Lill, P. Schnider, S. Weber
algorithmic game theorycomputational complexity+2computational geometryhigh-dimensional algorithms
Track B (6B) Blackwattle 2
10:50-11:08 Undirected Multicast Network Coding Gaps via Locally Decodable Codes
Z. He, M. Braverman
algorithmic coding theory
11:08-11:26 Constant Rate Codes for Adaptive Broadcasts Do Not Exist
K. Efremenko, G. Kol, D. Paramonov, R. Saxena
algorithmic coding theorycommunication complexity
11:26-11:44 List Decoding Expander-Based Codes up to Capacity in Near-Linear Time
S. Srivastava, M. Tulsiani
algorithmic coding theorycombinatorics and graph theory+2pseudorandomness and derandomizationspectral methods
11:44-12:02 Robust Local Testability of Tensor Products of Constant-Rate Algebraic Geometry Codes
S. Garg, A. Sengupta
algebraic computationalgorithmic coding theory+1computational complexity
Track C (6C) Blackwattle 3
10:50-11:08 How Global Calibration Strengthens Multiaccuracy
S. Casacuberta, P. Gopalan, V. Kanade, O. Reingold
computational complexitycomputational learning theory+2foundations of fairness and privacyfoundations of machine learning
11:08-11:26 High dimensional online calibration in polynomial time
B. Peng
algorithmic game theorycomputational learning theory+2foundations of machine learninghigh-dimensional algorithms
11:26-11:44 Near-Optimal Algorithms for Omniprediction
P. Okoroafor, B. Kleinberg, M. Kim
foundations of fairness and privacyfoundations of machine learning
11:44-12:02 Density Measures for Language Generation
J. Kleinberg, F. Wei
computational learning theoryfoundations of machine learning
12:02 - 13:30
Lunch break
13:30 - 14:30
Plenary Talk
Sebastien Bubeck, OpenAI (remote)
Recent advances in LLMs for Mathematics
14:30 - 15:10
Break
15:10 - 16:22
Track A (7A) Blackwattle 1
15:10-15:28 Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair
L. Beretta, V. Cohen-Addad, R. Jayaram, E. Waingarten
high-dimensional algorithmsrandomized algorithms+1sublinear algorithms
15:28-15:46 Root Ridge Leverage Score Sampling for $\ell_p$ Subspace Approximation
D. Woodruff, T. Yasuda
randomized algorithmsstreaming algorithms
15:46-16:04 Perfect L_p Sampling with Polylogarithmic Update Time
W. Swartworth, D. Woodruff, S. Zhou
streaming algorithms
16:04-16:22 β„“2/β„“2 Sparse Recovery via Weighted Hypergraph Peeling
N. Fischer, V. Nakos
streaming algorithmssublinear algorithms
Track B (7B) Blackwattle 2
15:10-15:28 Fingerprint Filters are Optimal
W. Kuszmaul, J. Liang, R. Zhou
data structuresrandomized algorithms
15:28-15:46 Static Retrieval Revisited: To Optimality and Beyond
Y. Hu, W. Kuszmaul, J. Liang, H. Yu, J. Zhang, R. Zhou
data structuresrandomized algorithms
15:46-16:04 Stronger Cell Probe Lower Bounds via Local PRGs
O. Korten, T. Pitassi, R. Impagliazzo
circuit complexitycommunication complexity+4computational complexitycryptographydata structurespseudorandomness and derandomization
16:04-16:22 Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance
D. Das, J. Gilbert, T. Kociumaka, M. Hajiaghayi, B. Saha
approximation algorithms
Track C (7C) Blackwattle 3
15:10-15:28 Overcomplete Tensor Decomposition via Koszul-Young Flattenings
P. Kothari, A. Moitra, A. Wein
algebraic computationfoundations of machine learning
15:28-15:46 Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models
I. Diakonikolas, D. Kane
computational learning theoryfoundations of machine learning
15:46-16:04 Robust Learning of Multi-index Models via Iterative Subspace Approximation
I. Diakonikolas, G. Iakovidis, D. Kane, N. Zarifis
computational learning theoryfoundations of machine learning
16:04-16:22 Solving Zero-Sum Games with Fewer Matrix-Vector Products
I. Karmarkar, L. O'Carroll, A. Sidford
algorithmic game theorycontinuous optimization+1foundations of machine learning
16:22 - 16:40
Break
16:40 - 17:34
Track A (8A) Blackwattle 1
16:40-16:58 Fast Algorithms for Graph Arboricity and Related Problems
R. Cen, H. Fleischmann, G. Li, J. Li, D. Panigrahi
graph algorithms
16:58-17:16 Dynamic Treewidth in Logarithmic Time
T. Korhonen
combinatorics and graph theorydata structures+2graph algorithmsparametrized algorithms
17:16-17:34 Random-Shift Revisited: Tight Approximations for Tree Embeddings and β„“1-Oblivious Routings
M. Probst, R. Kyng, T. Rieder
combinatorial optimizationcombinatorics and graph theory+4data structuresgraph algorithmsparallel and distributed algorithmsrandomized algorithms
Track B (8B) Blackwattle 2
16:40-16:58 Ramanujan bigraphs and applications
S. Evra, B. Feigon, O. Parzanchevski, K. Maurischat
combinatorics and graph theorypseudorandomness and derandomization+1spectral methods
16:58-17:16 Extractors for Samplable Distributions with Polynomially Small Min-Entropy
R. Shaltiel
pseudorandomness and derandomization
17:16-17:34 Finding Colorings in One-Sided Expanders
R. Buhai, Y. Hua, D. Steurer, A. VΓ‘ri-Kakas
graph algorithmsspectral methods
Track C (8C) Blackwattle 3
16:40-16:58 Faster exact learning of k-term DNFs with membership and equivalence queries
J. Alman, S. Nadimpalli, S. Patel, R. Servedio
computational learning theory
16:58-17:16 Computational-Statistical Tradeoffs from NP-hardness
G. Blanc, C. Koch, C. Strassle, L. Tan
computational learning theoryfoundations of machine learning
17:16-17:34 Theoretical limitations of multi-layer Transformer
L. Chen, B. Peng, H. Wu
circuit complexitycommunication complexity+2computational learning theoryfoundations of machine learning
18:00 - 21:00
Day 3 Wednesday, December 17
9:00 - 10:30
Track A (9A) Blackwattle 1
9:00-9:18 Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
M. Ghaffari, C. Grunau
parallel and distributed algorithms
9:18-9:36 Parallel $(1+\epsilon)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
B. Haeupler, Y. Jiang, Y. Long, T. Saranurak, S. Wang
graph algorithmsparallel and distributed algorithms
9:36-9:54 On the Parallel Complexity of Finding a Matroid Basis
S. Khanna, A. Putterman, J. Song
combinatorial optimizationparallel and distributed algorithms
9:54-10:12 Constant Approximation of Arboricity in Near-Optimal Sublinear Time
J. Dai, M. Ghaffari, J. Portmann
parallel and distributed algorithmsrandomized algorithms+1sublinear algorithms
10:12-10:30 Lower Bounds for Non-adaptive Local Computation Algorithms
A. Azarmehr, S. Behnezhad, A. Ghafari, M. Sudan
parallel and distributed algorithmssublinear algorithms
Track B (9B) Blackwattle 2
9:00-9:18 On Inverse Theorems and Combinatorial Lines
A. Bhangale, S. Khot, Y. Liu, D. Minzer
analysis of Boolean functionscombinatorics and graph theory+1computational complexity
9:18-9:36 NP-hardness of the Minimum Circuit Size Problem from Well-Studied Assumptions
S. Hirahara, R. Ilango
circuit complexitycomputational complexity
9:36-9:54 The Proof Analysis Problem
N. Arteche, A. Atserias, S. de Rezende, E. Khaniki
computational complexity
9:54-10:12 High-to-Low Dimensional PPA-completeness: Borsuk-Ulam, Tucker, Consensus Halving, and Ham Sandwich
R. Gao, A. Hollender, A. Rubinstein
computational complexityeconomics and computation
10:12-10:30 Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences
J. Leake, K. Lindberg, S. Gharan
approximation algorithmscombinatorics and graph theory+3graph algorithmsrandomized algorithmsspectral methods
Track C (9C) Blackwattle 3
9:00-9:18 Characterization of Priority-Neutral Matching Lattices
C. Thomas
algorithmic game theoryeconomics and computation
9:18-9:36 Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness
X. Bu, B. Tao
algorithmic game theory
9:36-9:54 Beyond Regularity: Simple versus Optimal Mechanisms, Revisited
Y. Feng, Y. Jin
algorithmic game theoryeconomics and computation
9:54-10:12 Polynomial-Time Approximation Schemes via Utility Alignment: Unit-Demand Pricing and More
R. Bowers, M. Garbea, E. Pountourakis, S. Taggart
algorithmic game theoryapproximation algorithms+1economics and computation
10:12-10:30 Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade
S. Di Gregorio, P. Duetting, F. Fusco, C. Schwiegelshohn
algorithmic game theorycomputational learning theory+1economics and computation
10:30 - 10:50
Break
10:50 - 12:02
Track A (10A) Blackwattle 1
10:50-11:08 Radial Isotropic Position via an Implicit Newton's Method
A. Jambulapati, J. Li, K. Tian
computational learning theorycontinuous optimization+1graph algorithms
11:08-11:26 Faster logconcave sampling from a cold start in high dimension
Y. Kook, S. Vempala
high-dimensional algorithmsrandomized algorithms
11:26-11:44 Optimal Smoothed Analysis of the Simplex Method
E. Bach, S. Huiberts
average-case algorithms and complexitycombinatorial optimization
11:44-12:02 Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
H. An, M. Kao, C. Lee, M. Lee
approximation algorithms
Track B (10B) Blackwattle 2
10:50-11:08 Distributed Triangle Detection is Hard in Few Rounds
S. Assadi, J. Sundaresan
communication complexityparallel and distributed algorithms+2streaming algorithmssublinear algorithms
11:08-11:26 Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
S. Khoury, A. Schild
parallel and distributed algorithms
11:26-11:44 Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
Y. Fei, D. Minzer, S. Wang
analysis of Boolean functionsapproximation algorithms+2communication complexitystreaming algorithms
11:44-12:02 A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
S. Khanna, A. Padaki, K. Singal, E. Waingarten
computational geometryhigh-dimensional algorithms+2streaming algorithmssublinear algorithms
Track C (10C) Blackwattle 3
10:50-11:08 On optimal distinguishers for Planted Clique
A. Nagda, P. Raghavendra
average-case algorithms and complexitycomputational complexity+1cryptography
11:08-11:26 Tight Low Degree Hardness for Optimizing Pure Spherical Spin Glasses
M. Sellke
average-case algorithms and complexitycontinuous optimization+1high-dimensional algorithms
11:26-11:44 The Quasi-Polynomial Low-Degree Conjecture is False
R. Buhai, J. Hsieh, A. Jain, P. Kothari
average-case algorithms and complexityfoundations of machine learning
11:44-12:02 PTF Testing Lower Bounds for Non-Gaussian Component Analysis
I. Diakonikolas, D. Kane, S. Liu, T. Pittas
computational learning theoryfoundations of machine learning
12:02 - 13:30
Lunch break
13:30 - 14:24
Track A (11A) Blackwattle 1
13:30-13:48 Near-Optimal Property Testers for Pattern Matching
C. Jin, T. Kociumaka
sublinear algorithms
13:48-14:06 Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance
A. Azarmehr, S. Behnezhad, M. Roghani, A. Rubinstein
sublinear algorithms
14:06-14:24 Instance-Optimal Uniformity Testing and Tracking
G. Blanc, C. Canonne, E. Waingarten
computational learning theorysublinear algorithms
Track B (11B) Blackwattle 2
13:30-13:48 Efficiently Batching Unambiguous Interactive Proofs
B. Berger, R. Goyal, M. Hong, Y. Kalai
computational complexitycryptography
13:48-14:06 Improved Round-by-round Soundness IOPs via Reed-Muller Codes
D. Minzer, K. Zheng
computational complexity
14:06-14:24 Proving Natural Distribution Properties is Harder than Testing Them
T. Herman, G. Rothblum
computational complexitycryptography+1sublinear algorithms
Track C (11C) Blackwattle 3
13:30-13:48 Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
T. Chan, H. Chang, J. Gao, S. Kisfaludi-Bak, H. Le, D. Zheng
computational geometrydata structures+1graph algorithms
13:48-14:06 Shortest Paths on Convex Polyhedral Surfaces
H. Wang
computational geometry
14:06-14:24 Pattern Matching under Weighted Edit Distance
P. Charalampopoulos, T. Kociumaka, P. Wellnitz
data structures
14:24 - 14:55
Break
14:55 - 16:25
Session 12
14:55-15:25 Godel in Cryptography: Effectively Zero Knowledge Proofs for NP with No Interaction, No Setup, and Perfect Soundness
R. Ilango
computational complexity
15:25-15:55 Obfuscation of Unitary Quantum Programs
M. Huang, E. Tang
cryptographyquantum cryptography
15:55-16:25 Explicit Lossless Vertex Expanders
J. Hsieh, A. Lubotzky, S. Mohanty, A. Reiner, R. Zhang
algorithmic coding theorycombinatorics and graph theory+1pseudorandomness and derandomization
16:25 - 16:50
Break
16:50 - 17:50
Session 13
16:50-17:20 Quasipolynomial bounds for the corners theorem
M. Jaber, Y. Liu, S. Lovett, A. Ostuni, M. Sawhney
combinatorics and graph theorycommunication complexity
17:20-17:50 Breaking a Long-Standing Barrier: 2-$\varepsilon$ Approximation for Steiner Forest
A. Ahmadi, I. Gholami, M. Hajiaghayi, P. Jabbarzade, M. Mahdavi
approximation algorithmscombinatorial optimization