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
1984Average Case SelectionWalter Cunto, J. Ian Munro
1984Evaluating Logarithms in GF(2^n)Don Coppersmith
1984On k-hulls and Related ProblemsRichard Cole, Micha Sharir, Chee-Keng Yap
1984Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract)Kenneth L. Clarkson
1984Intersecting Is Easier than SortingBernard Chazelle
1984On the Pagenumber of Planar GraphsJonathan F. Buss, Peter W. Shor
1984Efficient Fault Tolerant Routings in NetworksAndrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons
1984Threshold Functions and Bounded Depth Monotone CircuitsRavi B. Boppana
1984Building a Complete Inverted File for a Set of Text Files in Linear TimeAnselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
1984An Area-Maximum Edge Length Tradeoff for VLSI LayoutNorbert Blum
1984A Minimum Area VLSI Network for O(log n) Time SortingGianfranco Bilardi, Franco P. Preparata
1984Some Unexpected Expected Behavior Results for Bin PackingJon Louis Bentley, David S. Johnson, Frank Thomson Leighton, Catherine C. McGeoch, Lyle A. McGeoch
1984The Complexity of Elementary Algebra and Geometry (Preliminary Abstract)Michael Ben-Or, Dexter Kozen, John H. Reif
1984Now You May Compose Temporal Logic SpecificationsHoward Barringer, Ruurd Kuiper, Amir Pnueli
1984Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract)Eric Bach, Gary L. Miller, Jeffrey O. Shallit
1984Finding Euler Circuits in Logarithmic Parallel TimeBaruch Awerbuch, Amos Israeli, Yossi Shiloach
1984An Efficient Network Synchronization ProtocolBaruch Awerbuch
1984Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract)Helmut Alt
1984A Theorem on Probabilistic Constant Depth ComputationsMikls Ajtai, Michael Ben-Or
1984A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller DimensionIlan Adler, Nimrod Megiddo
1983Some Structural Properties of Polynomial Reducibilities and Sets in NPPaul Young
1983A 3-Space Partition and Its Applications (Extended Abstract)F. Frances Yao
1983Exponential Lower Bounds for Restricted Monotone CircuitsLeslie G. Valiant
1983Probabilistic Analysis of Bandwidth Minimization AlgorithmsJonathan S. Turner
1983Topological MatchingQuentin F. Stout
4,0264,050 of 4,576← PreviousNext →

Comparable venues

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