Volume 12,
Number 1,
13 February 1981
Volume 12,
Number 2,
13 April 1981
Volume 12,
Number 3,
13 June 1981
- Bruno Courcelle:
The Simultaneous Accessibility of Two Configurations of Two Equivalent DPDA's.
111-114
- Gary L. Peterson:
Myths About the Mutual Exclusion Problem.
115-116
- Will E. Leland, Raphael A. Finkel, Li Qiao, Marvin H. Solomon, Leonard Uhr:
High Density Graphs for Processor Interconnection.
117-120
- Ronald V. Book:
The Undecidability of a Word Problem: On a Conjecture of Strong, Maggiolo-Schettini and Rosen.
121-122
- Gerhard Lischke:
Two Types of Properties for Complexity Measures.
123-126
- Reinhard Wilhelm:
A Modified Tree-to-Tree Correction Problem.
127-132
- Robert J. Fowler, Mike Paterson, Steven L. Tanimoto:
Optimal Packing and Covering in the Plane are NP-Complete.
133-137
- Jerzy W. Jaromczyk:
Linear Decision Trees are too Weak for Convex Hull Problem.
138-141
- Alberto Bertoni, Giancarlo Mauri:
On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems.
142-145
- W. Erni, R. Lapsien:
On the Time and Tape Complexity of Weak Unification.
146-150
- Paolo Ancilotti, Maurelio Boari:
Information Streams Sharing a Finite Buffer: Protection Problems.
151-159
Volume 12,
Number 4,
13 August 1981
Volume 12,
Number 5,
13 October 1981
Copyright © Mon Mar 15 04:02:51 2010
by Michael Ley (ley@uni-trier.de)
