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
1987Analysis of Backoff Protocols for Multiple Access Channels (Extended Abstract)Johan Hstad, Frank Thomson Leighton, Brian Rogoff
1987Reconfiguring a Hypercube in the Presence of Faults (Extended Abstract)Johan Hstad, Frank Thomson Leighton, Mark Newman
1987How to Play any Mental Game or A Completeness Theorem for Protocols with Honest MajorityOded Goldreich, Silvio Micali, Avi Wigderson
1987Towards a Theory of Software Protection and Simulation by Oblivious RAMsOded Goldreich
1987Solving Minimum-Cost Flow Problems by Successive ApproximationAndrew V. Goldberg, Robert Endre Tarjan
1987Parallel Symmetry-Breaking in Sparse GraphsAndrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon
1987The Power of Randomness for Communication Complexity (Preliminary Version)Martin Frer
1987A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract)Greg N. Frederickson
1987The Complexity of Perfect Zero-Knowledge (Extended Abstract)Lance Fortnow
1987Zero Knowledge Proofs of IdentityUriel Feige, Amos Fiat, Adi Shamir
1987Two Algorithms for Maintaining Order in a ListPaul F. Dietz, Daniel Dominic Sleator
1987Matrix Multiplication via Arithmetic ProgressionsDon Coppersmith, Shmuel Winograd
1987Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract)Kenneth L. Clarkson
1987The Complexity of Cutting Convex PolytopesBernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas
1987The Boolean Formula Value Problem Is in ALOGTIMESamuel R. Buss
1987An Optimal Online Algorithm for Metrical Task SystemsAllan Borodin, Nathan Linial, Michael E. Saks
1987Size-Time Complexity of Boolean Networks for Prefix ComputationsGianfranco Bilardi, Franco P. Preparata
1987Optimal Bounds for Decision Problems on the CRCW PRAMPaul Beame, Johan Hstad
1987Finite Monoids and the Fine Structure of NC¹David A. Mix Barrington, Denis Thrien
1987Realistic Analysis of Some Randomized AlgorithmsEric Bach
1987Permutation Groups in NCLszl Babai, Eugene M. Luks, kos Seress
1987Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary)Baruch Awerbuch
1987Some Consequences of the Existence of Pseudorandom GeneratorsEric Allender
1987Deterministic Simulation in LOGSPACEMikls Ajtai, Jnos Komls, Endre Szemerdi
1987A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex PolygonAlok Aggarwal, Leonidas J. Guibas, James B. Saxe, Peter W. Shor
3,8513,875 of 4,576← PreviousNext →

Comparable venues

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