- Shyam Narayanan, Václav Rozhon, Jakub Tetek, Mikkel Thorup:
Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation. FOCS 2024: 658-688 - Michal Opler:
An Optimal Algorithm for Sorting Pattern-Avoiding Sequences. FOCS 2024: 689-699 - Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Obstructions to Erdös-Pósa Dualities for Minors. FOCS 2024: 31-52 - Renato Ferreira Pinto Jr.:
Directed Isoperimetry and Monotonicity Testing: A Dynamical Approach. FOCS 2024: 2295-2305 - Youming Qiao, Xiaorui Sun:
Canonical Forms for Matrix Tuples in Polynomial Time. FOCS 2024: 780-789 - Leonid Reyzin:
Proofs of Space with Maximal Hardness. FOCS 2024: 1159-1177 - Shiri Ron, Clayton Thomas, S. Matthew Weinberg, Qianfan Zhang:
Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier. FOCS 2024: 386-405 - Alexander A. Sherstov, Andrey A. Storozhenko:
The Communication Complexity of Approximating Matrix Rank. FOCS 2024: 433-462 - Shay Solomon, Amitai Uzrad, Tianyi Zhang:
A Lossless Deamortization for Dynamic Greedy Set Cover. FOCS 2024: 264-290 - Chunyang Wang, Yitong Yin:
A Sampling Lovász Local Lemma for Large Domain Sizes. FOCS 2024: 129-150 - Ryan Williams:
The Orthogonal Vectors Conjecture and Non-Uniform Circuit Lower Bounds. FOCS 2024: 1372-1387 - Tal Yankovitz:
A Stronger Bound for Linear 3-LCC. FOCS 2024: 1786-1801 - Dmitriy Zhuk:
∏2P vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem. FOCS 2024: 560-572 - 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024, Chicago, IL, USA, October 27-30, 2024. IEEE 2024, ISBN 979-8-3315-1674-1 [contents]