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
2002On the Decidability of Self-Assembly of Infinite Ribbons.Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus
2002The Asymptotic Order of the Random k -SAT Threshold.Dimitris Achlioptas, Cristopher Moore
2001Sequential and Parallel Algorithms for Mixed Packing and Covering.Neal E. Young
2001Compact Oracles for Reachability and Approximate Distances in Planar Digraphs.Mikkel Thorup
2001Extractors from Reed-Muller Codes.Amnon Ta-Shma, David Zuckerman, Shmuel Safra
2001Unique Sink Orientations of Cubes.Tibor Szab, Emo Welzl
2001Coding Theory: Tutorial and Survey.Madhu Sudan
2001Deterministic Computation of the Frobenius Form.Arne Storjohann
2001Distributions on Level-Sets with Applications to Approximation Algorithms.Aravind Srinivasan
2001Lower Bounds for Matrix Product.Amir Shpilka
2001Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator.Ronen Shaltiel, Christopher Umans
2001Designing Networks for Selfish Users is Hard.Tim Roughgarden
2001Game Theory and Mathematical Economics: A Theoretical Computer Scientist's Introduction.Christos H. Papadimitriou
2001Building Low-Diameter P2P Networks.Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
2001Facility Location with Nonuniform Hard Capacities.Martin Pl, va Tardos, Tom Wexler
2001Designing Networks Incrementally.Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
2001Online Facility Location.Adam Meyerson
2001Spectral Partitioning of Random Graphs.Frank McSherry
2001Linear-time Recognition of Circular-arc Graphs.Ross M. McConnell
2001Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions.Vladlen Koltun
2001Tight Approximation Results for General Covering Integer Programs.Stavros G. Kolliopoulos, Neal E. Young
2001Lower Bounds for Quantum Communication Complexity.Hartmut Klauck
2001Improved Inaproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring.Subhash Khot
2001Glauber Dynamics on Trees and Hyperbolic Graphs.Claire Kenyon, Elchanan Mossel, Yuval Peres
2001Algorithmic Applications of Low-Distortion Geometric Embeddings.Piotr Indyk
2,1762,200 of 4,193← PreviousNext →

Comparable venues

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