STOC A*

36 papers

YearTitle / Authors
1974A Characterization of the Power of Vector Machines
Vaughan R. Pratt, Michael O. Rabin, Larry J. Stockmeyer
1974A New Grammatical Transformation into LL(k) Form (Extended Abstract)
Michael Hammer
1974A Partial Solution to the Reachability-Problem for Vector-Addition Systems
Jan van Leeuwen
1974An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract)
Laurent Hyafil, F. Prusker, Jean Vuillemin
1974Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications
Zvi M. Kedem
1974Comparisons of Polynomial-Time Reducibilities
Richard E. Ladner, Nancy A. Lynch, Alan L. Selman
1974Complete Problems for Deterministic Polynomial Time
Neil D. Jones, William T. Laaser
1974Complexity Measures for Regular Expressions
Andrzej Ehrenfeucht, H. Paul Zeiger
1974Computational Complexity and Numerical Stability
Webb Miller
1974Computational Complexity of Probabilistic Turing Machines
John T. Gill III
1974Computational Parallels between the Regular and Context-Free Languages
Harry B. Hunt III, Daniel J. Rosenkrantz
1974Construction with Parallel Derivatives of the Closure of a Parallel Program Schema
Jonathan K. Millen
1974Degrees of Translatability and Canonical Forms in Program Schemas: Part I
Ashok K. Chandra
1974Determining Graph Properties from Matrix Representations
David G. Kirkpatrick
1974Efficient Stable Sorting with Minimal Extra Space
Edward C. Horvath
1974Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract)
Ronald V. Book, Maurice Nivat, Mike Paterson
1974Limitations of Synchronization Primitives with Conditional Branching and Global Variables
Richard J. Lipton
1974Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report)
John E. Hopcroft, J. K. Wong
1974Managing Storage for Extendible Arrays
Arnold L. Rosenberg
1974New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions
H. T. Kung
1974Observations on Nondeterministic Multidimensional Iterative Arrays
Joel I. Seiferas
1974On Some Generalizations of Binary Search
David P. Dobkin, Richard J. Lipton
1974On the Complexity of the Theories of Weak Direct Products: A Preliminary Report
Charles Rackoff
1974On the Lengths of Proofs in the Propositional Calculus (Preliminary Version)
Stephen A. Cook, Robert A. Reckhow
1974On the Number of Additions to Compute Specific Polynomials (Preliminary Version)
Allan Borodin, Stephen A. Cook
1974Parallel Scheduling of Programs in a Restricted Model of Computation
K. Vairavan, Richard A. DeMillo
1974Polynomial and Abstract Subrecursive Classes
Kurt Mehlhorn
1974Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1974, Seattle, Washington, USA
Robert L. Constable, Robert W. Ritchie, Jack W. Carlyle, Michael A. Harrison
1974Semantics and Axiomatics of a Simple Recursive Language
Bruno Courcelle, Jean Vuillemin
1974Some Restrictions on W-Grammars
Sheila A. Greibach
1974Some Simplified NP-Complete Problems
M. R. Garey, David S. Johnson, Larry J. Stockmeyer
1974Storage Requirements for Deterministic Polynomial Time Recognizable Languages
Stephen A. Cook, Ravi Sethi
1974Structure of Complexity in the Weak Monadic Second-Order Theories of the Natural Numbers
Edward L. Robertson
1974Testing Graph Connectivity
Robert Endre Tarjan
1974The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata
Leslie G. Valiant
1974The Power of Negative Thinking in Multiplying Boolean Matrices
Vaughan R. Pratt