Skip to content

ACM Symposium on Theory of Computing

STOC

A*

CORE rank

CORE rank (raw)

A*

Acceptance rate

29.0% (2024)

Fields of research

Theory of Computation

Papers indexed

4,576

1969–2026

Papers per year

1969219 peak2026

STOC papers

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

YearTitleAuthors
2002Optimal rate-based scheduling on multiprocessors.Anand Srinivasan, James H. Anderson
2002Reimer's inequality and tardos' conjecture.Clifford D. Smyth
2002Algorithmic derandomization via complexity theory.D. Sivakumar
2002A new average case analysis for completion time scheduling.Mark Scharbrodt, Thomas Schickinger, Angelika Steger
2002Recognizing string graphs in NP.Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
2002Space lower bounds for distance approximation in the data stream model.Michael E. Saks, Xiaodong Sun
2002The price of anarchy is independent of the network topology.Tim Roughgarden
2002Resolution lower bounds for the weak pigeonhole principle.Ran Raz
2002On the complexity of matrix product.Ran Raz
2002The Joy of Theory.Christos H. Papadimitriou
2002Hardness amplification within NP.Ryan O'Donnell
2002On communication over an entanglement-assisted quantum channel.Ashwin Nayak, Julia Salzman
2002Models and thresholds for random constraint satisfaction problems.Michael Molloy
2002The Glauber dynamics on colourings of a graph with high girth and maximum degree.Michael Molloy
2002Improved cryptographic hash functions with worst-case/average-case connection.Daniele Micciancio
2002Expanders from symmetric codes.Roy Meshulam, Avi Wigderson
2002Girth and euclidean distortion.Nathan Linial, Avner Magen, Assaf Naor
2002On the composition of authenticated byzantine agreement.Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
2002Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines.Spyros C. Kontogiannis
2002On the power of unique 2-prover 1-round games.Subhash Khot
2002Hardness results for approximate hypergraph coloring.Subhash Khot
2002Finding nearest neighbors in growth-restricted metrics.David R. Karger, Matthias Ruhl
2002Random sampling in residual graphs.David R. Karger, Matthew S. Levine
2002Meldable heaps and boolean union-find.Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
2002Equitable cost allocations via primal-dual-type algorithms.Kamal Jain, Vijay V. Vazirani
2,7012,725 of 4,576← PreviousNext →

Comparable venues

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