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
2000Balanced allocations: the heavily loaded case.Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vcking
2000Tighter bounds for nearest neighbor search and related problems in the cell probe model.Omer Barkol, Yuval Rabani
2000A unified approach to approximating resource allocation and scheduling.Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber
2000Tight(er) worst-case bounds on dynamic searching and priority queues.Arne Andersson, Mikkel Thorup
2000Computing with highly mixed states (extended abstract).Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani
2000Quantum lower bounds by quantum arguments.Andris Ambainis
2000Approximation algorithms for geometric shortest path problems.Lyudmil Aleksandrov, Anil Maheshwari, Jrg-Rdiger Sack
2000Space complexity in propositional calculus.Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
2000A random graph model for massive graphs.William Aiello, Fan R. K. Chung, Linyuan Lu
2000Quantum bit escrow.Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao
2000Compression using efficient multicasting.Micah Adler, Frank Thomson Leighton
2000Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract).Dimitris Achlioptas
1999Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems.Uri Zwick
1999All Pairs Lightest Shortest Paths.Uri Zwick
1999A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow.Kevin D. Wayne
1999Robust Logics.Leslie G. Valiant
1999Construction of Extractors Using Pseudo-Random Generators (Extended Abstract).Luca Trevisan
1999Pseudorandom Generators Without the XOR Lemma (Extended Abstract).Madhu Sudan, Luca Trevisan, Salil P. Vadhan
1999A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines.Martin Skutella, Gerhard J. Woeginger
1999Computational Sample Complexity and Attribute-Efficient Learning.Rocco A. Servedio
1999Molecular Scale Heat Engines and Scalable Quantum Computation.Leonard J. Schulman, Umesh V. Vazirani
1999Majorizing Estimators and the Approximation of #P-Complete Problems.Leonard J. Schulman, Vijay V. Vazirani
1999From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.Christian Scheideler, Berthold Vcking
1999Random Sampling of Large Planar Maps and Convex Polyhedra.Gilles Schaeffer
1999Graph Ramsey Theory and the Polynomial Hierarchy.Marcus Schaefer
2,9512,975 of 4,576← PreviousNext →

Comparable venues

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