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
1980On the Distribution of Independent Formulae of Number TheoryDavid A. Plaisted
1980Comparative Schematology and Pebbling with Auxiliary Pushdowns (Preliminary Version)Nicholas Pippenger
1980An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version)Wolfgang J. Paul, Joel I. Seiferas, Janos Simon
1980Dynamically Maintaining Configurations in the Plane (Detailed Abstract)Mark H. Overmars, Jan van Leeuwen
1980Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondeterministic InterpretationsGrazyna Mirkowska
1980Isomorphism Testing for Graphs of Bounded GenusGary L. Miller
1980Definability in Dynamic LogicAlbert R. Meyer, Rohit Parikh
1980Fast Allocation of Nearby Resources in a Distributed SystemNancy A. Lynch
1980Critical Path Scheduling of Task Systems with Resource and Processor Constraints (Extended Abstract)Errol L. Lloyd
1980Isomorphism for Graphs Embeddable on the Projective PlaneDavid Lichtenstein
1980Linear Expected-Time Algorithms for Connectivity Problems (Extended Abstract)Richard M. Karp, Robert Endre Tarjan
1980Some Connections between Nonuniform and Uniform Complexity ClassesRichard M. Karp, Richard J. Lipton
1980The Orbit Problem is DecidableRavindran Kannan, Richard J. Lipton
1980Independence Results in Computer Science? (Preliminary Version)Deborah Joseph, Paul Young
1980Time-Space Tradeoffs for some Algebraic ProblemsJoseph F. JJ
1980The Complexity of the Equivalence Problem for Straight-Line ProgramsOscar H. Ibarra, Brian S. Leininger
1980On Some Deterministic Space Complexity ProblemsJia-Wei Hong
1980Testing Isomorphism on Cone Graphs (Extended Abstract)Christoph M. Hoffmann
1980Testing Polynomials which Are Easy to Compute (Extended Abstract)Joos Heintz, Claus-Peter Schnorr
1980On Translating a Set of RectanglesLeonidas J. Guibas, F. Frances Yao
1980Generalized Selection and Ranking (Preliminary Version)Greg N. Frederickson, Donald B. Johnson
1980Optimal Tree Layout (Preliminary Version)Michael J. Fischer, Mike Paterson
1980A Polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus (Working Paper)I. S. Filotti, Jack N. Mayer
1980Horn Clauses and Database Dependencies (Extended Abstract)Ronald Fagin
1980Complexity of Implementations on the Level of Algebraic SpecificationsHartmut Ehrig, Bernd Mahr
4,2014,225 of 4,576← PreviousNext →

Comparable venues

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