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
1984Digital Disks and a Digital Compactness MeasureChul E. Kim, Timothy A. Anderson
1984A Fast Parallel Algorithm for the Maximal Independent Set ProblemRichard M. Karp, Avi Wigderson
1984A Probabilistic Analysis of Multidimensional Bin Packing ProblemsRichard M. Karp, Michael Luby, Alberto Marchetti-Spaccamela
1984A New Polynomial-Time Algorithm for Linear ProgrammingNarendra Karmarkar
1984Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental NumbersRavindran Kannan, Arjen K. Lenstra, Lszl Lovsz
1984Every Poset Has a Good ComparisonJeff Kahn, Michael E. Saks
1984Factorization of Polynomials over Finite Fields and Factorization of Primes in Algebraic Number FieldsMing-Deh A. Huang
1984Powers of Graphs: A Powerful Approximation Technique for Bottleneck ProblemsDorit S. Hochbaum, David B. Shmoys
1984Modelling Fair ProcessesMatthew Hennessy
1984Probabilistic Temporal Logics for Finite and Bounded ModelsSergiu Hart, Micha Sharir
1984A General Result on Infinite Trees and Its Applications (Preliminary Report)David Harel
1984Determining Equivalence of Expressions in Random Polynomial Time (Extended Abstract)Gaston H. Gonnet
1984On Finding the Exact Solution of a Zero-One Knapsack ProblemAndrew V. Goldberg, Alberto Marchetti-Spaccamela
1984Transition Logic: How to Reason About Temporal Properties in a Compositional WayRob Gerth
1984Optimal Parallel Algorithms for String MatchingZvi Galil
1984Scaling and Related Techniques for Geometry ProblemsHarold N. Gabow, Jon Louis Bentley, Robert Endre Tarjan
1984Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version)Greg N. Frederickson, Mandayam A. Srinivas
1984The Impact of Synchronous Communication on the Problem of Electing a Leader in a RingGreg N. Frederickson, Nancy A. Lynch
1984An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of IntervalsDeborah S. Franzblau, Daniel J. Kleitman
1984Deciding Branching Time LogicE. Allen Emerson, A. Prasad Sistla
1984Lower Bounds on Communication ComplexityPavol Duris, Zvi Galil, Georg Schnitger
1984Correcting Faults in Write-Once MemoryDanny Dolev, David Maier, Harry G. Mairson, Jeffrey D. Ullman
1984A New Look at Fault Tolerant Network RoutingDanny Dolev, Joseph Y. Halpern, Barbara Simons, H. Raymond Strong
1984On the Possibility and Impossibility of Achieving Clock SynchronizationDanny Dolev, Joseph Y. Halpern, H. Raymond Strong
1984Liveness Properties as Convergence in Metric SpacesPierpaolo Degano, Ugo Montanari
4,0014,025 of 4,576← PreviousNext →

Comparable venues

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