Volume 15,
1981
- Gunther Schmidt:
Programs as Partial Graphs I: Flow Equivalence and Correctness.
1-25
- Ronald V. Book:
Bounded Query Machines: On NP and PSPACE.
27-39
- Ronald V. Book, Celia Wrathall:
Bounded Query Machines: On NP( ) and NPQERY( ).
41-50
- Toshiro Araki, Toyohiko Kagimasa, Nobuki Tokura:
Relations of Flow Languages to Petri Net Languages.
51-75
- Daniel Lazard:
Resolution des Systemes d'Equations Algebriques.
77-110
- Charles E. Hughes, Stanley M. Selkow:
The Finite Power Property for Context-Free Languages.
111-114
- Stephan Heilbrunner:
A Parsing Automata Approach to LR Theory.
117-157
- Gunther Schmidt:
Programs as Partial Graphs II: Recursion.
159-179
- Lawrence H. Landweber, Richard J. Lipton, Edward L. Robertson:
On the Structure of Sets in NP and Other Complexity Classes.
181-200
- A. Alder, Volker Strassen:
On the Algorithmic Complexity of Associative Algebras.
201-211
- Giorgio Germano, Andrea Maggiolo-Schettini:
Sequence Recursiveness Without Cylindrification and Limited Register Machines.
213-221
- James W. Thatcher, Eric G. Wagner, Jesse B. Wright:
More on Advice on Structuring Compilers and Proving them Correct.
223-249
- Azaria Paz, Shlomo Moran:
Non Deterministic Polynomial Optimization Problems and their Approximations.
251-277
- E. W. Leggett Jr., Daniel J. Moore:
Optimization Problems and the Polynomial Hierarchy.
279-289
- Howard P. Katseff, Michael Sipser:
Several Results in Program Size Complexity.
291-309
- Michael C. Loui:
A Space Bound for One-Tape Multidimensional Turing Machines.
311-320
- Claude Benzaken, S. Foldes:
Complexity of Graph Embeddability Problems.
321-328
- Richard Statman:
On the Existence of Closed Terms in the Typed lambda Calculus II: Transformations of Unification Problems.
329-338
Copyright © Fri Mar 12 17:33:05 2010
by Michael Ley (ley@uni-trier.de)
