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
1981Optimal Wiring between RectanglesDanny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman
1981The omega-Sequence Equivalence Problem for DOL Systems Is DecidableKarel Culk II, Tero Harju
1981Unique Normal Forms in Term Rewriting Systems with Repeated VariablesPaul Chew
1981A Model of Computation for VLSI with Related Complexity ResultsBernard Chazelle, Louis Monier
1981Convex Decompositions of PolyhedraBernard Chazelle
1981Embedded Implicational Dependencies and their Inference ProblemAshok K. Chandra, Harry R. Lewis, Johann A. Makowsky
1981Equations between Regular Terms and an Application to Process LogicAshok K. Chandra, Joseph Y. Halpern, Albert R. Meyer, Rohit Parikh
1981Reversal Complexity of Counter MachinesTat-hung Chan
1981A Characterization of the Class of Functions Computable in Polynomial Time on Random Access MachinesAlberto Bertoni, Giancarlo Mauri, Nicoletta Sabadini
1981Properties of Acyclic Database SchemesCatriel Beeri, Ronald Fagin, David Maier, Alberto O. Mendelzon, Jeffrey D. Ullman, Mihalis Yannakakis
1981A Difference in Efficiency between Synchronous and Asynchronous SystemsEshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch
1981Low Level Complexity for Combinatorial GamesAkeo Adachi, Shigeki Iwata, Takumi Kasai
1980Space-time Tradeoffs and First Order Problems in a Model of ProgramsChee-Keng Yap
1980Efficient Dynamic Programming Using Quadrangle InequalitiesF. Frances Yao
1980A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown AutomataEsko Ukkonen
1980Deadlock- and Livelock-Free Packet Switching NetworksSam Toueg
1980Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space ImplementationsMartin Tompa
1980An Optimal Solution to a Wire-Routing Problem (Preliminary Version)Martin Tompa
1980Heuristics for Weighted Perfect MatchingKenneth J. Supowit, David A. Plaisted, Edward M. Reingold
1980Vector Execution of Flow Graphs (Extended Abstract)H. Raymond Strong
1980The Node Cost Measure for Embedding Graphs on the Planar Grid (Extended Abstract)James A. Storer
1980A Complete Axiomatization for a Large Class of Dependencies in Relational DatabasesFereidoon Sadri, Jeffrey D. Ullman
1980Random MatroidsJohn H. Reif, Paul G. Spirakis
1980Logics for Probabilistic Programming (Extended Abstract)John H. Reif
1980Dynamic Algebras and the Nature of InductionVaughan R. Pratt
4,1764,200 of 4,576← PreviousNext →

Comparable venues

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