Table of Contents

• FOCS 2021 PrefaceNisheeth K. Vishnoi. [doi]
• A Better-Than-2 Approximation for Weighted Tree AugmentationVera Traub, Rico Zenklusen. 1-12 [doi]
• Integer programs with bounded subdeterminants and two nonzeros per rowSamuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky. 13-24 [doi]
• A constant-factor approximation algorithm for Nash Social Welfare with submodular valuationsWenzheng Li, Jan Vondrák. 25-36 [doi]
• A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function MinimizationDeeparnab Chakrabarty, Yu Chen, Sanjeev Khanna. 37-48 [doi]
• Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding BarrierAlessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry. 49-58 [doi]
• On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant RoundNai-Hui Chia, Kai-Min Chung, Qipeng Liu, Takashi Yamakawa. 59-67 [doi]
• SNARGs for $\mathcal{P}$ from LWEArka Rai Choudhuri, Abhihsek Jain, Zhengzhong Jin. 68-79 [doi]
• Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XORItai Dinur, Nathan Keller, Ohad Klein. 80-91 [doi]
• Demystifying the border of depth-3 algebraic circuitsPranjal Dutta, Prateek Dwivedi, Nitin Saxena 0001. 92-103 [doi]
• Fooling Constant-Depth Threshold Circuits (Extended Abstract)Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell. 104-115 [doi]
• Unambiguous DNFs and Alon-Saks-SeymourKaspars Balodis, Shalev Ben-David, Mika Göös, Siddhartha Jain 0002, Robin Kothari. 116-124 [doi]
• Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-WiseLijie Chen 0001, Roei Tell. 125-136 [doi]
• Rapid mixing of Glauber dynamics via spectral independence for all degreesXiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan Zhang. 137-148 [doi]
• Spectral Independence via Stability and Applications to Holant-Type ProblemsZongchen Chen, Kuikui Liu, Eric Vigoda. 149-160 [doi]
• A Matrix Trickle-Down Theorem on Simplicial Complexes and Applications to Sampling ColoringsDorna Abdolazimi, Kuikui Liu, Shayan Oveis Gharan. 161-172 [doi]
• Towards the sampling Lovász Local LemmaVishesh Jain, Huy Tuan Pham, Thuy Duong Vuong. 173-183 [doi]
• A Single-Exponential Time 2-Approximation Algorithm for TreewidthTuukka Korhonen. 184-192 [doi]
• Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic SpaceHans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis. 193-204 [doi]
• PPSZ is better than you thinkDominik Scheder. 205-216 [doi]
• n stable matchingsCory Palmer, Dömötör Pálvölgyi. 217-227 [doi]
• An Invariance Principle for the Multi-slice, with ApplicationsMark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer. 228-236 [doi]
• Applications of Random Algebraic Constructions to Hardness of ApproximationBoris Bukh, Karthik C. S., Bhargav Narayanan. 237-244 [doi]
• Almost Optimal Inapproximability of Multidimensional Packing ProblemsSai Sandeep. 245-256 [doi]
• Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classesAkash Kumar 0003, C. Seshadhri, Andrew Stolman. 257-268 [doi]
• Non-adaptive vs Adaptive Queries in the Dense Graph Testing ModelOded Goldreich 0001, Avi Wigderson. 269-275 [doi]
• Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity DichotomiesMarco Bressan 0002, Marc Roth. 276-285 [doi]
• Testability of relations between permutationsOren Becker, Alexander Lubotzky, Jonathan Mosheiff. 286-297 [doi]
• The Algorithmic Phase Transition of Random k-SAT for Low Degree PolynomialsGuy Bresler, Brice Huang. 298-309 [doi]
• One-step replica symmetry breaking of random regular NAE-SATDanny Nam, Allan Sly, Youngtak Sohn. 310-318 [doi]
• Sharp Thresholds in Random Simple Temporal GraphsArnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev. 319-326 [doi]
• Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric PerceptronEmmanuel Abbe, Shuangping Li, Allan Sly. 327-338 [doi]
• Approximating Maximum Independent Set for Rectangles in the PlaneJoseph S. B. Mitchell. 339-350 [doi]
• A Gap-ETH-Tight Approximation Scheme for Euclidean TSPSándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki. 351-362 [doi]
• Optimal Approximate Distance Oracle for Planar GraphsHung Le, Christian Wulff-Nilsen. 363-374 [doi]
• Covering Polygons is Even HarderMikkel Abrahamsen. 375-386 [doi]
• Robust recovery for stochastic block modelsJingqiu Ding, Tommaso d'Orsi, Rajai Nasser, David Steurer. 387-394 [doi]
• On statistical inference when fixed points of belief propagation are unstableSiqi Liu, Sidhanth Mohanty, Prasad Raghavendra. 395-405 [doi]
• Sum-of-Squares Lower Bounds for Sparse Independent SetChris Jones, Aaron Potechin, Goutham Rajendran, Madhur Tulsiani, Jeff Xu. 406-416 [doi]
• Chow-Liu++: Optimal Prediction-Centric Learning of Tree Ising ModelsEnric Boix-Adserà, Guy Bresler, Frederic Koehler. 417-426 [doi]
• The Minimum Formula Size Problem is (ETH) HardRahul Ilango. 427-432 [doi]
• The Hardest Explicit ConstructionOliver Korten. 433-444 [doi]
• Tradeoffs for small-depth Frege proofsToniann Pitassi, Prasanna Ramakrishnan, Li-Yang Tan. 445-456 [doi]
• Group isomorphism is nearly-linear time for most ordersHeiko Dietrich, James B. Wilson. 457-467 [doi]
• Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant FactorVincent Cohen-Addad, Debarati Das 0001, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup. 468-479 [doi]
• Embeddings of Planar Quasimetrics into Directed ℓ1 and Polylogarithmic Approximation for Directed Sparsest-CutKen-ichi Kawarabayashi, Anastasios Sidiropoulos. 480-491 [doi]
• Hop-Constrained Metric Embeddings and their ApplicationsArnold Filtser. 492-503 [doi]
• A Hitting Set Relaxation for $k$-Server and an Extension to Time-WindowsAnupam Gupta 0001, Amit Kumar 0001, Debmalya Panigrahi. 504-515 [doi]
• Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-RaoYu Gao, Yang P. Liu, Richard Peng. 516-527 [doi]
• Faster Sparse Minimum Cost Flow by Electrical Flow LocalizationKyriakos Axiotis, Aleksander Madry, Adrian Vladu. 528-539 [doi]
• 2-norm Flow Diffusion in Near-Linear TimeLi Chen, Richard Peng, Di Wang. 540-549 [doi]
• On the Power of Preconditioning in Sparse Linear RegressionJonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi. 550-561 [doi]
• Quantum learning algorithms imply circuit lower boundsSrinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor Carboni Oliveira, Aarthi Sundaram. 562-573 [doi]
• Exponential Separations Between Learning With and Without Quantum MemorySitan Chen, Jordan Cotler, Hsin-Yuan Huang, Jerry Li 0001. 574-585 [doi]
• Quantum soundness of testing tensor codesZhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright 0004, Henry Yuen. 586-597 [doi]
• Quasi-polynomial Time Approximation of Output Probabilities of Geometrically-local, Shallow Quantum CircuitsNolan J. Coble, Matthew Coudron. 598-609 [doi]
• Improved Extractors for Small-Space SourcesEshan Chattopadhyay, Jesse Goodman. 610-621 [doi]
• Affine Extractors for Almost Logarithmic EntropyEshan Chattopadhyay, Jesse Goodman, Jyun-Jie Liao. 622-633 [doi]
• Tight Bounds for General Computation in Noisy Broadcast NetworksKlim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena. 634-645 [doi]
• Constructive Separations and Their ConsequencesLijie Chen 0001, Ce Jin, Rahul Santhanam, R. Ryan Williams. 646-657 [doi]
• A Theory of PAC Learnability of Partial Concept ClassesNoga Alon, Steve Hanneke, Ron Holzman, Shay Moran. 658-671 [doi]
• Optimal Sub-Gaussian Mean Estimation in $\mathbb{R}$Jasper C. H. Lee, Paul Valiant. 672-683 [doi]
• Online and Distribution-Free Robustness: Regression and Contextual Bandits with Huber ContaminationSitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau. 684-695 [doi]
• Learning Deep ReLU Networks Is Fixed-Parameter TractableSitan Chen, Adam R. Klivans, Raghu Meka. 696-707 [doi]
• Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters. 708-719 [doi]
• List-decodability with large radius for Reed-Solomon codesAsaf Ferber, Matthew Kwan, Lisa Sauermann. 720-726 [doi]
• The zero-rate threshold for adversarial bit-deletions is less than 1/2Venkatesan Guruswami, Xiaoyu He, Ray Li. 727-738 [doi]
• Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and DeletionsJeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu. 739-750 [doi]
• On Worst-Case Learning in Relativized HeuristicaShuichi Hirahara, Mikito Nanashima. 751-758 [doi]
• Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic AlgorithmsRobert Robere, Jeroen Zuiddam. 759-769 [doi]
• LEARN-Uniform Circuit Lower Bounds and Provability in Bounded ArithmeticMarco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor Carboni Oliveira. 770-780 [doi]
• On Classifying Continuous Constraint Satisfaction problemsTillmann Miltzow, Reinier F. Schmiermann. 781-791 [doi]
• Breaking the Cubic Barrier for (Unweighted) Tree Edit DistanceXiao Mao. 792-803 [doi]
• Superpolynomial Lower Bounds Against Low-Depth Algebraic CircuitsNutan Limaye, Srikanth Srinivasan 0001, Sébastien Tavenas. 804-814 [doi]
• Combinatorial ContractsPaul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim. 815-826 [doi]
• FIXP-membership via Convex Optimization: Games, Cakes, and MarketsAris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender. 827-838 [doi]
• On the Nisan-Ronen conjectureGeorge Christodoulou 0001, Elias Koutsoupias, Annamária Kovács. 839-850 [doi]
• Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over TimeNeil Olver, Leon Sering, Laura Vargas Koch. 851-860 [doi]
• Fully Dynamic s-t Edge Connectivity in Subpolynomial Time (Extended Abstract)Wenyu Jin 0001, Xiaorui Sun. 861-872 [doi]
• Time-Optimal Sublinear Algorithms for Matching and Vertex CoverSoheil Behnezhad. 873-884 [doi]
• Small-space and streaming pattern matching with $k$ editsTomasz Kociumaka, Ely Porat, Tatiana Starikovskaya. 885-896 [doi]
• A Quantum Advantage for a Natural Streaming ProblemJohn Kallaugher. 897-908 [doi]
• Statistically Near-Optimal Hypothesis SelectionOlivier Bousquet, Mark Braverman, Gillat Kol, Klim Efremenko, Shay Moran. 909-919 [doi]
• Properly learning decision trees in almost polynomial timeGuy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan. 920-929 [doi]
• Sharper bounds on the Fourier concentration of DNFsVictor Lecomte, Li-Yang Tan. 930-941 [doi]
• Smoothed Analysis with Adaptive AdversariesNika Haghtalab, Tim Roughgarden, Abhishek Shetty. 942-953 [doi]
• Hiding Among the Clones: A Simple and Nearly Optimal Analysis of Privacy Amplification by ShufflingVitaly Feldman, Audra McMillan, Kunal Talwar. 954-964 [doi]
• Settling the Horizon-Dependence of Sample Complexity in Reinforcement LearningYuanzhi Li, Ruosong Wang, Lin F. Yang. 965-976 [doi]
• Feature Purification: How Adversarial Training Performs Robust Deep LearningZeyuan Allen Zhu, Yuanzhi Li. 977-988 [doi]
• Minor Sparsifiers and the Distributed Laplacian ParadigmSebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye. 989-999 [doi]
• Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear TimeAaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak. 1000-1008 [doi]
• Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network DecompositionMohsen Ghaffari, Fabian Kuhn. 1009-1020 [doi]
• Hardness of Approximate Diameter: Now for Undirected GraphsMina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams. 1021-1032 [doi]
• MAJORITY-3SAT (and Related Problems) in Polynomial TimeShyan Akmal, Ryan Williams. 1033-1043 [doi]
• A time and space optimal stable population protocol solving exact majorityDavid Doty, Mahsa Eftekhari, Leszek Gasieniec, Eric E. Severson, Przemyslaw Uznanski, Grzegorz Stachowiak. 1044-1055 [doi]
• Stochastic and Worst-Case Generalized Sorting RevisitedWilliam Kuszmaul, Shyam Narayanan. 1056-1067 [doi]
• Tight Space Complexity of the Coin ProblemMark Braverman, Sumegha Garg, Or Zamir. 1068-1079 [doi]
• A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspectsDong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus. 1080-1089 [doi]
• New data structure for univariate polynomial approximation and applications to root isolation, numerical multipoint evaluation, and other problemsGuillaume Moroz. 1090-1099 [doi]
• The supersingular isogeny path and endomorphism ring problems are equivalentBenjamin Wesolowski. 1100-1111 [doi]
• Harmonic Persistent Homology (extended abstract)Saugata Basu, Nathanael Cox. 1112-1123 [doi]
• A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple GraphsJason Li 0006, Debmalya Panigrahi, Thatchaphol Saranurak. 1124-1134 [doi]
• APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic TimeAmir Abboud, Robert Krauthgamer, Ohad Trabelsi. 1135-1146 [doi]
• Minimum Cuts in Directed Graphs via Partial SparsificationRuoxu Cen, Jason Li 0006, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud. 1147-1158 [doi]
• Spectral Hypergraph Sparsifiers of Nearly Linear SizeMichael Kapralov, Robert Krauthgamer, Jakab Tardos, Yuichi Yoshida. 1159-1170 [doi]
• Linear Probing Revisited: Tombstones Mark the Demise of Primary ClusteringMichael A. Bender, Bradley C. Kuszmaul, William Kuszmaul. 1171-1182 [doi]
• Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference EstimatorsDavid P. Woodruff, Samson Zhou. 1183-1196 [doi]
• Approximability of all finite CSPs with linear sketchesChi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy. 1197-1208 [doi]
• Terminal Embeddings in Sublinear TimeYeshwanth Cherapanamjeri, Jelani Nelson. 1209-1216 [doi]
• Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected GeographyKyle W. Burke, Matthew T. Ferland, Shang-Hua Teng. 1217-1228 [doi]
• Reachability in Vector Addition Systems is Ackermann-completeWojciech Czerwinski, Lukasz Orlikowski. 1229-1240 [doi]
• The Reachability Problem for Petri Nets is Not Primitive RecursiveJérôme Leroux. 1241-1252 [doi]
• Random Order Online Set Cover is as Easy as OfflineAnupam Gupta 0001, Gregory Kehne, Roie Levin. 1253-1264 [doi]
• Improved Online Correlated SelectionRuiquan Gao, Zhongtian He, Zhiyi Huang, Zipei Nie, Bijun Yuan, Yan Zhong. 1265-1276 [doi]
• Multiway Online Correlated SelectionGuy Blanc, Moses Charikar. 1277-1284 [doi]
• A direct product theorem for quantum communication complexity with applications to device-independent QKDRahul Jain 0001, Srijita Kundu. 1285-1295 [doi]
• Quantum supremacy and hardness of estimating output probabilities of quantum circuitsYasuhiro Kondo, Ryuhei Mori, Ramis Movassagh. 1296-1307 [doi]
• Noise and the Frontier of Quantum SupremacyAdam Bouland, Bill Fefferman, Zeph Landau, Yunchao Liu. 1308-1317 [doi]