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
1996Noise-Tolerant Learning Near the Information-Theoretic Bound.Nicol Cesa-Bianchi, Eli Dichterman, Paul Fischer, Hans Ulrich Simon
1996Adaptively Secure Multi-Party Computation.Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor
1996Noise-Tolerant Distribution-Free Learning of General Geometric Concepts.Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki
1996Towards the Learnability of DNF Formulae.Nader H. Bshouty
1996Dynamic Deflection Routing on Arrays (Preliminary Version).Andrei Z. Broder, Eli Upfal
1996Adversarial Queueing Theory.Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson
1996Constructing Evolutionary Trees in the Presence of Polymorphic Characters.Maria Luisa Bonet, Cynthia A. Phillips, Tandy J. Warnow, Shibu Yooseph
1996A Constant-factor Approximation Algorithm for theAvrim Blum, R. Ravi, Santosh S. Vempala
1996Pushing Disks Together - The Continuous-Motion Case.Marshall W. Bern, Amit Sahai
1996Reconstructing a Three-Dimensional Model with Arbitrary Errors.Bonnie Berger, Jon M. Kleinberg, Frank Thomson Leighton
1996Learning Sat-Francesco Bergadano, Dario Catalano, Stefano Varricchio
1996ApproximatingAndrs A. Benczr, David R. Karger
1996Adaptive Zero Knowledge and Computational Equivocation (Extended Abstract).Donald Beaver
1996Correlated Pseudorandomness and the Complexity of Private Computations.Donald Beaver
1996Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract).Saugata Basu, Richard Pollack, Marie-Franoise Roy
1996On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets.Saugata Basu
1996Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing.Yair Bartal, Amos Fiat, Stefano Leonardi
1996Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs.Lszl Babai, Anna Gl, Jnos Kollr, Lajos Rnyai, Tibor Szab, Avi Wigderson
1996Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract).Baruch Awerbuch, Yossi Azar, Amos Fiat, Frank Thomson Leighton
1996Modular Competitiveness for Distributed Algorithms.James Aspnes, Orli Waarts
1996Robot Navigation with Range Queries.Dana Angluin, Jeffery R. Westbrook, Wenhong Zhu
1996Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract).Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang
1996The Space Complexity of Approximating the Frequency Moments.Noga Alon, Yossi Matias, Mario Szegedy
1996The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract).Eric Allender, Robert Beals, Mitsunori Ogihara
1996Generating Hard Instances of Lattice Problems (Extended Abstract).Mikls Ajtai
3,2513,275 of 4,576← PreviousNext →

Comparable venues

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