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.
- Gary L. Peterson:
Myths About the Mutual Exclusion Problem.
- Will E. Leland, Raphael A. Finkel, Li Qiao, Marvin H. Solomon, Leonard Uhr:
High Density Graphs for Processor Interconnection.
- Ronald V. Book:
The Undecidability of a Word Problem: On a Conjecture of Strong, Maggiolo-Schettini and Rosen.
- Gerhard Lischke:
Two Types of Properties for Complexity Measures.
- Reinhard Wilhelm:
A Modified Tree-to-Tree Correction Problem.
- Robert J. Fowler, Mike Paterson, Steven L. Tanimoto:
Optimal Packing and Covering in the Plane are NP-Complete.
- Jerzy W. Jaromczyk:
Linear Decision Trees are too Weak for Convex Hull Problem.
- Alberto Bertoni, Giancarlo Mauri:
On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems.
- W. Erni, R. Lapsien:
On the Time and Tape Complexity of Weak Unification.
- Paolo Ancilotti, Maurelio Boari:
Information Streams Sharing a Finite Buffer: Protection Problems.
Volume 12, Number 4, 13 August 1981
Volume 12, Number 5, 13 October 1981
Last update Sat May 25 20:34:42 2013
CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page