Volume 11, 1980
- David P. Dobkin, Steven P. Reiss:
The Complexity of Linear Programming.
1-18
- Jan A. Bergstra, Jan Willem Klop:
Invertible Terms in the Lambda Calculus.
19-37
- John Staples:
Speeding up Subtree Replacement Systems.
39-47
- Nicholas Pippenger:
On Another Boolean Matrix.
49-56
- Anna R. Bruss, Albert R. Meyer:
On Time-Space Classes and their Relation to the Theory of Real Addition.
59-69
- Leonard Berman:
The Complexitiy of Logical Theories.
71-77
- Masato Morisaki, Kô Sakai:
A Complete Axiom System for Rational Sets with Multiplicity.
79-92
- Ludek Kucera, Jaroslav Nesetril, Ales Pultr:
Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs.
93-106
- Günter Hotz:
Eine neue Invariante für Kontextfreie Sprachen.
107-116
- Frank Harary:
Graph Theoretic Models.
117-121
- Egon Börger, Hans Kleine Büning:
The Reachability Problem for Petri Nets and Decision Problems for Skolem Arithmetic.
123-143
- Arnold L. Rosenberg, Larry J. Stockmeyer, Lawrence Snyder:
Uniform Data Encodings.
145-165
- W. M. Beynon:
On the Structure of Free Finite State Machines.
167-180
- André Arnold, Maurice Nivat:
Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs.
181-205
- B. Bougaut:
Algorithme Explicite pour la Recherche du P.G.C.D. dans certains Anneaux Principaux d'Entiers de Corps de Nombres.
207-220
- Bernard Vauquelin, Paul Franchi-Zannettacci:
Automates a File.
221-225
- Matthew Hennessy, Edward A. Ashcroft:
A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus.
227-245
- Hartmut Ehrig, Barry K. Rosen:
Parallelism and Concurrency of Graph Manipulations.
247-275
- Dexter Kozen:
Indexings of Subrecursive Classes.
277-301
- Norbert Blum, Kurt Mehlhorn:
On the Average Number of Rebalancing Operations in Weight-Balanced Trees.
303-320
- Joos Heintz, Malte Sieveking:
Lower Bounds for Polynomials with Algebraic Coefficients.
321-330
- Joachim von zur Gathen, Volker Strassen:
Some Polynomials that are Hard to Compute.
331-335
- Angelo Barone Netto:
There are Infinitely Many Complete Prefix Codes of Constant Length l (l greater than 3).
337-339
- Mordechai Ben-Ari:
Comments on "Tautology Testing with a Generalized Matrix Reduction Method".
341
Copyright © Fri Mar 12 17:33:05 2010
by Michael Ley (ley@uni-trier.de)
