Volume 12,
1980
- Jeffrey M. Jaffe:
Efficient Scheduling of Tasks without Full Use of Processor Resources.
1-17 BibTeX
- N. Saheb-Djahromi:
CPO'S of Measures for Nondeterminism.
19-37 BibTeX
- Józef Winkowski:
Behaviours of Concurrent Systems.
39-60 BibTeX
- David Harel:
Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic.
61-81 BibTeX
- Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi:
Toward a Unified Approach for the Classification of NP-Complete Optimization Problems.
83-96 BibTeX
- Louis Monier:
Evaluation and Comparison of Two Efficient Probabilistic Primality Testing Algorithms.
97-108 BibTeX
- Maurice Mignotte:
Tests de Primalite.
109-117 BibTeX
- Philip W. Grant:
Some More Independence Results in Complexity Theory.
119-126 BibTeX
- Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On Ambiguity in E0L Systems.
127-134 BibTeX
- Hermann A. Maurer, Arto Salomaa, Derick Wood:
Synchronized E0L Forms.
135-159 BibTeX
- Dana Angluin:
On Counting Problems and the Polynomial-Time Hierarchy.
161-173 BibTeX
- Guy Cousineau:
An Algebraic Definition for Control Structures.
175-192 BibTeX
- John C. Beatty:
Two Iteration Theorems for the LL(k) Languages.
193-228 BibTeX
- Jerzy Tiuryn:
Unique Fixed Points Vs. Least Fixed Points.
229-254 BibTeX
- David P. Dobkin, J. Ian Munro:
Determining the Mode.
255-263 BibTeX
- Aravind K. Joshi, Leon S. Levy, Kang Yueh:
Local Constraints in Programming Languages Part I: Syntax.
265-290 BibTeX
- Derek C. Oppen:
Complexity, Convexity and Combinations of Theories.
291-302 BibTeX
- Leslie G. Valiant:
Negation can be Exponentially Powerful.
303-314 BibTeX
- J. Ian Munro, Mike Paterson:
Selection and Sorting with Limited Storage.
315-323 BibTeX
- Jean-Marie Boë, Aldo de Luca, Antonio Restivo:
Minimal Complete Sets of Words.
325-332 BibTeX
- John Gill, James Hunt, Janos Simon:
Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers.
333-338 BibTeX
- Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On a Bound for the D0L Sequence Equivalence Problem.
339-342 BibTeX
Copyright © Sun May 17 00:23:46 2009
by Michael Ley (ley@uni-trier.de)
