STOC A*

31 papers

YearTitle / Authors
1976A Consistent and Complete Deductive System for the Verification of Parallel Programs
Susan S. Owicki
1976A New Incompleteness Result for Hoare's System
Mitchell Wand
1976A Useful Device for Showing the Solvability of Some Decision Problems
Oscar H. Ibarra, Chul E. Kim
1976An Algebraic System for Process Structuring and Interprocess Communication
Takayuki Kimura
1976Associative Retrieval Trie Hash-Coding
Walter A. Burkhard
1976Complexity of Decision Problems Based on Finite Two-Person Perfect-Information Games
Thomas J. Schaefer
1976Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract)
Harry B. Hunt III, Thomas G. Szymanski
1976Divide-and-Conquer in Multidimensional Space
Jon Louis Bentley, Michael Ian Shamos
1976Evaluation of Polynomials with Super-Preconditioning
Richard J. Lipton, Larry J. Stockmeyer
1976Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report
E. Cardoza, Richard J. Lipton, Albert R. Meyer
1976Finding the Depth of a Flow Graph
Amelia C. Fong, Jeffrey D. Ullman
1976Linear Unification
Mike Paterson, Mark N. Wegman
1976Location of a Point in a Planar Subdivision and its Applications
D. T. Lee, Franco P. Preparata
1976NP-Complete Decision Problems for Quadratic Polynomials
Kenneth L. Manders, Leonard M. Adleman
1976On Abstractions of Parallel Programs
Thomas W. Doeppner Jr.
1976On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store
Ivan Hal Sudborough
1976On Isomorphisms and Density of NP and Other Complete Sets
Juris Hartmanis, Leonard Berman
1976On Line Context Free Language Recognition in Less than Cubic Time (Extended Abstract)
Susan L. Graham, Michael A. Harrison, Walter L. Ruzzo
1976On Structuring Flowcharts (Preliminary Version)
S. Rao Kosaraju
1976On the Average Behavior of Set Merging Algorithms (Extended Abstract)
Andrew Chi-Chih Yao
1976Parallel Algorithms for the Transitive Closure and the Connected Component Problems
Daniel S. Hirschberg
1976Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3-5, 1976, Hershey, Pennsylvania, USA
Ashok K. Chandra, Detlef Wotschke, Emily P. Friedman, Michael A. Harrison
1976Real-Time Algorithms for String-Matching and Palindrome Recognition
Zvi Galil
1976Simple Gödel Numberings, Translations, and the P-Hierarchy
Michael Machtey, Paul Young
1976Some Complexity Results for the Traveling Salesman Problem
Christos H. Papadimitriou, Kenneth Steiglitz
1976Some NP-Complete Geometric Problems
M. R. Garey, Ronald L. Graham, David S. Johnson
1976Sorting on a Mesh-Connected Parallel Computer
Clark D. Thompson, H. T. Kung
1976Space Bounds for a Game of Graphs
Wolfgang J. Paul, Robert Endre Tarjan, James R. Celoni
1976The Analysis of Double Hashing (Extended Abstract)
Leonidas J. Guibas, Endre Szemerédi
1976The Realization of Monotone Boolean Functions (Preliminary Version)
Nicholas Pippenger
1976Universal Circuits (Preliminary Report)
Leslie G. Valiant