Skip to content

IEEE Symposium on Foundations of Computer Science

FOCS

A*

CORE rank

CORE rank (raw)

A*

Acceptance rate

30.0% (2023)

Fields of research

Theory of Computation

Papers indexed

4,193

1960–2025

Papers per year

1960142 peak2025

FOCS papers

4,193 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2010Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions.Matthew Andrews
2010Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity.Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak
2010Solving Linear Systems through Nested Dissection.Noga Alon, Raphael Yuster
2010A Non-linear Lower Bound for Planar Epsilon-Nets.Noga Alon
2009Symmetry and Approximability of Submodular Maximization Problems.Jan Vondrk
2009A Probabilistic Inequality with Applications to Threshold Direct-Product Theorems.Falk Unger
2009Distance Oracles for Sparse Graphs.Christian Sommer, Elad Verbin, Wei Yu
2009The Intersection of Two Halfspaces Has High Threshold Degree.Alexander A. Sherstov
2009Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut.Jonah Sherman
2009Smoothed Analysis of Multiobjective Optimization.Heiko Rglin, Shang-Hua Teng
2009Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function.Ben Reichardt
2009How to Round Any CSP.Prasad Raghavendra, David Steurer
2009Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES.Prasad Raghavendra, David Steurer
2009Exact and Approximate Pattern Matching in the Streaming Model.Benny Porat, Ely Porat
2009KKL, Kruskal-Katona, and Monotone Nets.Ryan O'Donnell, Karl Wimmer
2009Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions.Zeev Nutov
2009Bit Encryption Is Complete.Steven A. Myers, Abhi Shelat
2009Convergence to Equilibrium in Local Interaction Games.Andrea Montanari, Amin Saberi
2009Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size.Ankur Moitra
2009Combinatorial PCPs with Efficient Verifiers.Or Meir
2009The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection.Eyal Kushilevitz, Enav Weinreb
2009Reducibility among Fractional Stability Problems.Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng
2009SDP Integrality Gaps with Local ell_1-Embeddability.Subhash Khot, Rishi Saket
2009Faster Generation of Random Spanning Trees.Jonathan A. Kelner, Aleksander Madry
2009Higher Eigenvalues of Graphs.Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng
1,6011,625 of 4,193← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.