- David E. Muller, Paul E. Schupp:
Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems. STOC 1981: 46-54 - James B. Orlin:
The Complexity of Dynamic Languages and Dynamic Optimization Problems. STOC 1981: 218-227 - Francesco Parisi-Presicce:
On the Faithful Regular Extensions of Iterative Algebras. STOC 1981: 368-374 - Mike Paterson, Walter L. Ruzzo
, Lawrence Snyder:
Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract). STOC 1981: 293-299 - John H. Reif, Paul G. Spirakis:
Distributed Algorithms for Synchronizing Interprocess Communication within Real Time. STOC 1981: 133-145 - Janos Simon:
Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version). STOC 1981: 158-167 - Daniel Dominic Sleator, Robert Endre Tarjan:
A Data Structure for Dynamic Trees. STOC 1981: 114-122 - Robert S. Streett:
Propositional Dynamic Logic of Looping and Converse. STOC 1981: 375-383 - Esko Ukkonen, Eljas Soisalon-Soininen:
LALR(k) Testing is PSPACE-Complete. STOC 1981: 202-206 - Leslie G. Valiant, Gordon J. Brebner
:
Universal Schemes for Parallel Communication. STOC 1981: 263-277 - Mihalis Yannakakis:
Issues of Correctness in Database Concurrency Control by Locking. STOC 1981: 363-367 - Andrew Chi-Chih Yao:
On the Parallel Computation for the Knapsack Problem. STOC 1981: 123-127 - Andrew Chi-Chih Yao:
The Entropic Limitations on VLSI Computations (Extended Abstract). STOC 1981: 308-311 - Proceedings of the 13th Annual ACM Symposium on Theory of Computing, May 11-13, 1981, Milwaukee, Wisconsin, USA. ACM 1981 [contents]