🏠
홈
📊
트렌드
🏆
논문
👤
마이
💬 문의
CS-
Pedia
Trends
Best Papers
Best Papers
/
FOCS
FOCS Best Papers
IEEE Annual Symposium on Foundations of Computer Science
17 papers · 2020–2025
← FOCS Conference Info
🏆
2025
(5)
Best Paper Award
Breaking a Long-Standing Barrier: 2-ε Approximation for Steiner Forest
Ahmadi, Gholami, Hajiaghayi, Jabbarzade & Mahdavi
Approximation Algorithms
Graph Theory
Best Paper Award
Explicit Lossless Vertex Expanders
Hsieh, Lubotzky, Mohanty, Reiner & Zhang
Expander Graphs
Combinatorics
Best Paper Award
Quasipolynomial Bounds for the Corners Theorem
Jaber, Liu, Lovett, Ostuni & Sawhney
Combinatorics
Additive Combinatorics
Best Paper Award
Gödel in Cryptography: Effectively Zero Knowledge Proofs for NP with No Interaction, No Setup, and Perfect Soundness
Rahul Ilango
Zero-Knowledge Proofs
Best Paper Award
Obfuscation of Unitary Quantum Programs
Mi-Ying Huang, Er-Cheng Tang
Quantum Computing
🏆
2024
(4)
Best Paper Award
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
Bernhard Haeupler, Richard Hladík, Václav Rozhoň, Robert Tarjan, Jakub Tětek
Best Paper Award
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
Mohsen Ghaffari, Christoph Grunau
Best Paper Award
Capacity Threshold for the Ising Perceptron
Brice Huang
Best Paper Award
Optimal quantile estimation: beyond the comparison model
Mihir Singhal, Meghal Gupta, Hongxun Wu
🏆
2023
(2)
Best Paper Award
Strong Bounds for 3-Progressions
Kelley & Meka
Combinatorics
Additive
Best Paper Award
The Subspace Flatness Conjecture and Faster Integer Programming
Victor Reis & Thomas Rothvoss
🏆
2022
(2)
Best Paper Award
Negative-Weight Single-Source Shortest Paths in Near-Linear Time
Bernstein et al.
Shortest Paths
Algorithms
Best Paper Award
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
🏆
2021
(1)
Best Paper Award
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
Limaye, Srinivasan & Tavenas
Circuit Complexity
Lower Bounds
🏆
2020
(3)
Best Paper Award
An Equivalence Between Private Classification and Online Prediction
Mark Bun, Roi Livni, Shay Moran
Classification
Best Paper Award
Edge-Weighted Online Bipartite Matching
Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam
Best Paper Award
A New Minimax Theorem for Randomized Algorithms
Shalev Ben-David & Eric Blais
Randomized Algorithms