- Krishnamurthy Dj Dvijotham, H. Brendan McMahan, Krishna Pillutla, Thomas Steinke, Abhradeep Thakurta:
Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy. FOCS 2024: 2306-2317 - Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki:
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. FOCS 2024: 1610-1620 - Shai Evra, Shay Gadot, Ohad Klein, Ilan Komargodski:
Verifying Groups in Linear Time. FOCS 2024: 2131-2147 - Martín Farach-Colton, Andrew Krapivin, William Kuszmaul:
Optimal Bounds for Open Addressing Without Reordering. FOCS 2024: 594-605 - Yuval Filmus, Hamed Hatami, Kaave Hosseini, Esty Kelman:
Sparse Graph Counting and Kelley-Meka Bounds for Binary Systems. FOCS 2024: 1559-1578 - Arnold Filtser, Gramoz Goranci, Neel Patel, Maximilian Probst Gutenberg:
Near-Optimal (1+ε)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs. FOCS 2024: 2078-2098 - Simone Fioravanti, Steve Hanneke, Shay Moran, Hilla Schefler, Iska Tsubari:
Ramsey Theorems for Trees and a General 'Private Learning Implies Online Learning' Theorem. FOCS 2024: 1983-2009 - Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time. FOCS 2024: 62-85 - George Giakkoupis, Marcos Kiwi, Dimitrios Los:
Naively Sorting Evolving Data is Optimal and Robust. FOCS 2024: 2217-2242 - Louis Golowich, Venkatesan Guruswami:
Decoding Quasi-Cyclic Quantum LDPC Codes. FOCS 2024: 344-368 - Noah Golowich, Ankur Moitra, Dhruv Rohatgi:
Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning. FOCS 2024: 1953-1967 - Jesse Goodman, Xin Li, David Zuckerman:
Improved Condensers for Chor-Goldreich Sources. FOCS 2024: 1513-1549 - Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Fast List Decoding of Univariate Multiplicity and Folded Reed-Solomon Codes. FOCS 2024: 328-343 - Nick Gravin, Zhiqi Wang:
On Robustness to k-Wise Independence of Optimal Bayesian Mechanisms. FOCS 2024: 1275-1293 - Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou:
A Strong Separation for Adversarially Robust ℓ0 Estimation for Linear Sketches. FOCS 2024: 2318-2343 - Meghal Gupta, Mihir Singhal, Hongxun Wu:
Optimal Quantile Estimation: Beyond the Comparison Model. FOCS 2024: 1137-1158 - Venkatesan Guruswami, Jun-Ting Hsieh, Prasad Raghavendra:
Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the √n Dimension Threshold. FOCS 2024: 930-948 - Jeongwan Haah, Yunchao Liu, Xinyu Tan:
Efficient Approximate Unitary Designs from Random Pauli Rotations. FOCS 2024: 463-475 - Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps. FOCS 2024: 2099-2130 - Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan:
New Structures and Algorithms for Length-Constrained Expander Decompositions. FOCS 2024: 1634-1645 - Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak:
Dynamic Deterministic Constant-Approximate Distance Oracles with nε Worst-Case Update Time. FOCS 2024: 2033-2044 - Steve Hanneke, Kasper Green Larsen, Nikita Zhivotovskiy:
Revisiting Agnostic PAC Learning. FOCS 2024: 1968-1982 - Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan:
An Improved Line-Point Low-Degree Test. FOCS 2024: 1883-1892 - Daniel Hathcock, Billy Jin, Kalen Patton, Sherry Sarkar, Michael Zlatin:
The Online Submodular Assignment Problem. FOCS 2024: 291-313 - Meike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani, Irene Muzi:
Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem. FOCS 2024: 1-20 - Tal Herman, Guy N. Rothblum:
Interactive Proofs for General Distribution Properties. FOCS 2024: 528-538 - Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima:
Optimal Coding for Randomized Kolmogorov Complexity and Its Applications. FOCS 2024: 369-378 - Hiroshi Hirai, Keiya Sakabe:
Gradient Descent for Unbounded Convex Functions on Hadamard Manifolds and its Applications to Scaling Problems. FOCS 2024: 2387-2402 - Ivor van der Hoog, Daniel Rutschmann:
Tight Bounds for Sorting Under Partial Information. FOCS 2024: 2243-2252 - Max Hopkins, Russell Impagliazzo, Daniel M. Kane, Sihan Liu, Christopher Ye:
Replicability in High Dimensional Statistics. FOCS 2024: 1-8