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
2004Hierarchy Theorems for Probabilistic Polynomial Time.Lance Fortnow, Rahul Santhanam
2004Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games.Lisa Fleischer, Kamal Jain, Mohammad Mahdian
2004Randomly Coloring Constant Degree Graphs.Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
2004On the (Im)possibility of Cryptography with Imperfect Randomness.Yevgeniy Dodis, Shien Jin Ong, Manoj Prabhakaran, Amit Sahai
2004Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem.Irit Dinur, Omer Reingold
2004Dynamic Optimality - Almost.Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
2004Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity.Brian C. Dean, Michel X. Goemans, Jan Vondrk
2004Spectral Analysis of Random Graphs with Skewed Degree Distributions.Anirban Dasgupta, John E. Hopcroft, Frank McSherry
2004The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem.Harold S. Connamacher, Michael Molloy
2004The Hardness of Metric Labeling.Julia Chuzhoy, Joseph Naor
2004Machine Minimization for Scheduling Jobs with Interval Constraints.Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor
2004Algebras with Polynomial Identities and Computing the Determinant.Steve Chien, Alistair Sinclair
2004On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract).Qi Cheng, Daqing Wan
2004Edge-Disjoint Paths in Planar Graphs.Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2004Maximizing Quadratic Programs: Extending Grothendieck's Inequality.Moses Charikar, Anthony Wirth
2004On the Integrality Ratio for Asymmetric TSP.Moses Charikar, Michel X. Goemans, Howard J. Karloff
2004An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching.Amit Chakrabarti, Oded Regev
2004Learning with Errors in Answers to Membership Queries.Laurence Bisht, Nader H. Bshouty, Lawrance Khoury
2004Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap.Yonatan Bilu, Nathan Linial
2004Extracting Randomness Using Few Independent Sources.Boaz Barak, Russell Impagliazzo, Avi Wigderson
2004Universally Composable Protocols with Relaxed Set-Up Assumptions.Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafael Pass
2004Approximating Edit Distance Efficiently.Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
2004Dynamic Speed Scaling to Manage Energy and Temperature.Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs
2004Optimal Power-Down Strategies.John Augustine, Sandy Irani, Chaitanya Swamy
20040(sqrt (log n)) Approximation to SPARSEST CUT in (nSanjeev Arora, Elad Hazan, Satyen Kale
2,0012,025 of 4,193← PreviousNext →

Comparable venues

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