| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A modified tree-to-tree correction problem
|
Wilhelm, Reinhard
|
|
1981
|
12 |
3 |
p. 127-132
6 p.
|
article
|
| 2 |
High density graphs for processor interconnection
|
Leland, Will
|
|
1981
|
12 |
3 |
p. 117-120
4 p.
|
article
|
| 3 |
Information streams sharing a finite buffer: Protection problems
|
Ancilotti, P.
|
|
1981
|
12 |
3 |
p. 151-159
9 p.
|
article
|
| 4 |
Linear decision trees are too weak for convex hull problem
|
Jaromczyk, Jerzy W.
|
|
1981
|
12 |
3 |
p. 138-141
4 p.
|
article
|
| 5 |
Myths about the mutual exclusion problem
|
Peterson, G.L.
|
|
1981
|
12 |
3 |
p. 115-116
2 p.
|
article
|
| 6 |
On efficient computation of the coefficients of some polynomials with applications to some enumeration problems
|
Bertoni, Alberto
|
|
1981
|
12 |
3 |
p. 142-145
4 p.
|
article
|
| 7 |
On the time and tape complexity of weak unification
|
Erni, W.
|
|
1981
|
12 |
3 |
p. 146-150
5 p.
|
article
|
| 8 |
Optimal packing and covering in the plane are NP-complete
|
Fowler, Robert J.
|
|
1981
|
12 |
3 |
p. 133-137
5 p.
|
article
|
| 9 |
The simultaneous accessibility of two configurations of two equivalent DPDA's
|
Courcelle, Bruno
|
|
1981
|
12 |
3 |
p. 111-114
4 p.
|
article
|
| 10 |
The undecidability of a word problem: On a conjecture of strong, Maggiolo-Schettini and Rosen
|
Book, Ronald V.
|
|
1981
|
12 |
3 |
p. 121-122
2 p.
|
article
|
| 11 |
Two types of properties for complexity measures
|
Lischke, Gerhard
|
|
1981
|
12 |
3 |
p. 123-126
4 p.
|
article
|
Journal description