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
1983The Complexity of Approximate Counting (Preliminary Version)Larry J. Stockmeyer
1983Transitive Orientation in O(n²) TimeJeremy P. Spinrad
1983Self-Adjusting Binary TreesDaniel Dominic Sleator, Robert Endre Tarjan
1983A Complexity Theoretic Approach to RandomnessMichael Sipser
1983Borel Sets and Circuit ComplexityMichael Sipser
1983A Logarithmic Time Sort for Linear Size NetworksJohn H. Reif, Leslie G. Valiant
1983On the Extremely Fair Treatment of Probabilistic AlgorithmsAmir Pnueli
1983A Characterization of Hoare's Logic for Programs with Pascal-like ProceduresErnst-Rdiger Olderog
1983Retraction: A New Approach to Motion-Planning (Extended Abstract)Colm 'Dnlaing, Micha Sharir, Chee-Keng Yap
1983The Random Access Hierarchy (Preliminary Report)Dale Myers
1983How Discreet is the Discrete Log?Douglas L. Long, Avi Wigderson
1983Factoring Multivariate Polynomials over Finite Fields (Extended Abstract)Arjen K. Lenstra
1983Solvability by Radicals is in Polynomial TimeSusan Landau, Gary L. Miller
1983A Probabilistic PDLDexter Kozen
1983Alternation and the Power of NondeterminismRavi Kannan
1983Improved Algorithms for Integer Programming and Related Lattice ProblemsRavi Kannan
1983Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract)Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi
1983Unique Decomposability of Shuffled Strings: A Formal Treatment of Asynchronous Time-Multiplexed CommunicationKazuo Iwama
1983Languages Which Capture Complexity Classes (Preliminary Report)Neil Immerman
1983A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack ProblemFriedhelm Meyer auf der Heide
1983Sparse Sets in NP-P: EXPTIME versus NEXPTIMEJuris Hartmanis, Vivian Sewelson, Neil Immerman
1983A Logic to Reason about LikelihoodJoseph Y. Halpern, Michael O. Rabin
1983Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi DiagramsLeonidas J. Guibas, Jorge Stolfi
1983Strong Signature SchemesShafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao
1983Parallel algorithms for algebraic problemsJoachim von zur Gathen
4,0514,075 of 4,576← PreviousNext →

Comparable venues

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