- 1981
- Akeo Adachi, Shigeki Iwata, Takumi Kasai:
Low Level Complexity for Combinatorial Games. STOC 1981: 228-237 - Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch:
A Difference in Efficiency between Synchronous and Asynchronous Systems. STOC 1981: 128-132 - Catriel Beeri, Ronald Fagin, David Maier, Alberto O. Mendelzon, Jeffrey D. Ullman, Mihalis Yannakakis:
Properties of Acyclic Database Schemes. STOC 1981: 355-362 - Alberto Bertoni, Giancarlo Mauri, Nicoletta Sabadini:
A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines. STOC 1981: 168-176 - Tat-hung Chan:
Reversal Complexity of Counter Machines. STOC 1981: 146-157 - Ashok K. Chandra, Joseph Y. Halpern, Albert R. Meyer, Rohit Parikh:
Equations between Regular Terms and an Application to Process Logic. STOC 1981: 384-390 - Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky:
Embedded Implicational Dependencies and their Inference Problem. STOC 1981: 342-354 - Bernard Chazelle:
Convex Decompositions of Polyhedra. STOC 1981: 70-79 - Bernard Chazelle, Louis Monier:
A Model of Computation for VLSI with Related Complexity Results. STOC 1981: 318-325 - Paul Chew:
Unique Normal Forms in Term Rewriting Systems with Repeated Variables. STOC 1981: 7-18 - Karel Culík II, Tero Harju:
The omega-Sequence Equivalence Problem for DOL Systems Is Decidable. STOC 1981: 1-6 - Danny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman:
Optimal Wiring between Rectangles. STOC 1981: 312-317 - Pavol Duris, Zvi Galil:
Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version). STOC 1981: 177-188 - Faith E. Fich:
Lower Bounds for the Cycle Detection Problem. STOC 1981: 96-105 - Zvi Galil, Wolfgang J. Paul:
An Efficient General Purpose Parallel Computer. STOC 1981: 247-262 - Zvi Galil, Joel I. Seiferas:
Time-Space-Optimal String Matching. STOC 1981: 106-113 - Gaston H. Gonnet, J. Ian Munro:
A Linear Probing Sort and its Analysis (Preliminary Draft). STOC 1981: 90-95 - Frank M. Hawrusik, K. N. Venkataraman, Ann Yasuhara:
Classes of Functions for Computing on Binary Trees (Extended Abstract). STOC 1981: 19-27 - Jia-Wei Hong, H. T. Kung:
I/O Complexity: The Red-Blue Pebble Game. STOC 1981: 326-333 - Jia-Wei Hong, Arnold L. Rosenberg:
Graphs that Are Almost Binary Trees (Preliminary Version). STOC 1981: 334-341 - Deborah Joseph, Paul Young:
Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract). STOC 1981: 55-61 - Chul E. Kim, Azriel Rosenfeld:
Digital Straightness and Convexity (Extended Abstract). STOC 1981: 80-89 - K. N. King:
Measures of Parallelism in Alternating Computation Trees (Extended Abstract). STOC 1981: 189-201 - Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller:
New Layouts for the Shuffle-Exchange Graph (Extended Abstract). STOC 1981: 278-292 - S. Rao Kosaraju:
Localized Search in Sorted Lists. STOC 1981: 62-69 - Balakrishnan Krishnamurthy, Robert N. Moll:
Examples of Hard Tautologies in the Propositional Calculus. STOC 1981: 28-37 - Daniel Leivant:
The Complexity of Parameter Passing in Polymorphic Procedures (or: Programming Language Theorems Independent of Very Strong Theories). STOC 1981: 38-45 - Richard J. Lipton, Robert Sedgewick:
Lower Bounds for VLSI. STOC 1981: 300-307 - Ernst W. Mayr:
An Algorithm for the General Petri Net Reachability Problem. STOC 1981: 238-246 - Burkhard Monien, Ivan Hal Sudborough:
Bandwidth Constrained NP-Complete Problems. STOC 1981: 207-217