🏠
홈
📊
트렌드
🏆
논문
👤
마이
💬 문의
CS-
Pedia
Trends
Best Papers
Best Papers
/
FOCS
FOCS Best Papers
IEEE Annual Symposium on Foundations of Computer Science
11 papers · 2020–2025
← FOCS Conference Info
🏆
2025
(3)
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
🏆
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