ACM Symposium on Theory of Computing

STOC

CORE rank

CORE rank (raw)

Acceptance rate

29.0% (2024)

Fields of research

Theory of Computation

Papers indexed

4,576

1969–2026

Best Theory of Computation conferences

Papers per year

1969219 peak2026

Most published authors

STOC papers

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

Year	Title	Authors
2000	Better algorithms for unfair metrical task systems and applications.	Amos Fiat, Manor Mendel
2000	Sharing the cost of muliticast transmissions (preliminary version).	Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker
2000	Approximating the minimum bisection size (extended abstract).	Uriel Feige, Robert Krauthgamer, Kobbi Nissim
2000	Approximating the domatic number.	Uriel Feige, Magns M. Halldrsson, Guy Kortsarz
2000	Finding long paths and cycles in sparse Hamiltonian graphs.	Toms Feder, Rajeev Motwani, Carlos S. Subi
2000	Computing the median with uncertainty.	Toms Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom
2000	Random walks with "back buttons" (extended abstract).	Ronald Fagin, Anna R. Karlin, Jon M. Kleinberg, Prabhakar Raghavan, Sridhar Rajagopalan, Ronitt Rubinfeld, Madhu Sudan, Andrew Tomkins
2000	Improved approximations of crossings in graph drawings.	Guy Even, Sudipto Guha, Baruch Schieber
2000	Smoothing and cleaning up slivers.	Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper ngr, Noel Walkington
2000	Self-testing of universal and fault-tolerant sets of quantum gates.	Wim van Dam, Frdric Magniez, Michele Mosca, Miklos Santha
2000	A new algorithm approach to the general Lovsz local lemma with applications to scheduling and satisfiability problems (extended abstract).	Artur Czumaj, Christian Scheideler
2000	On the sum-of-squares algorithm for bin packing.	Jnos Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
2000	On zero-knowledge proofs (extended abstract): "from membership to decision".	Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung
2000	On the complexity of verifiable secret sharing and multiparty computation.	Ronald Cramer, Ivan Damgrd, Stefan Dziembowski
2000	Faster suffix tree construction with missing suffix links.	Richard Cole, Ramesh Hariharan
2000	Shortest path queries in planar graphs.	Danny Z. Chen, Jinhui Xu
2000	Query strategies for priced information (extended abstract).	Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai
2000	Randomized metarounding (extended abstract).	Robert D. Carr, Santosh S. Vempala
2000	Resettable zero-knowledge (extended abstract).	Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali
2000	Hard-Potato routing.	Costas Busch, Maurice Herlihy, Roger Wattenhofer
2000	Are bitvectors optimal?	Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh
2000	Finding smooth integers in short intervals using CRT decoding.	Dan Boneh
2000	Noise-tolerant learning, the parity problem, and the statistical query model.	Avrim Blum, Adam Kalai, Hal Wasserman
2000	A proof of the security of quantum key distribution (extended abstract).	Eli Biham, Michel Boyer, P. Oscar Boykin, Tal Mor, Vwani P. Roychowdhury
2000	Improvements in throughout maximization for real-time scheduling.	Piotr Berman, Bhaskar DasGupta

2,926–2,950 of 4,576← Previous Next →

Comparable venues

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