nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An algorithm to determine when certain sets have 0-density
|
Klarner, David A |
|
1981 |
2 |
1 |
p. 31-43 13 p. |
artikel |
2 |
A new memoryless algorithm for de Bruijn sequences
|
Ralston, A |
|
1981 |
2 |
1 |
p. 50-62 13 p. |
artikel |
3 |
Editorial Board
|
|
|
1981 |
2 |
1 |
p. i- 1 p. |
artikel |
4 |
Erratum
|
|
|
1981 |
2 |
1 |
p. 105- 1 p. |
artikel |
5 |
Exhaustive checking of sparse algebras
|
Hentzel, Irvin Roy |
|
1981 |
2 |
1 |
p. 44-49 6 p. |
artikel |
6 |
Finding the maximum, merging, and sorting in a parallel computation model
|
Shiloach, Yossi |
|
1981 |
2 |
1 |
p. 88-102 15 p. |
artikel |
7 |
On vectorial addition chains
|
Olivos, Jorge |
|
1981 |
2 |
1 |
p. 13-21 9 p. |
artikel |
8 |
Problems
|
Guibas, Leo J |
|
1981 |
2 |
1 |
p. 103-104 2 p. |
artikel |
9 |
Searching and sorting real numbers
|
Ehrlich, Gideon |
|
1981 |
2 |
1 |
p. 1-12 12 p. |
artikel |
10 |
Segments, rectangles, contours
|
Lipski Jr., Witold |
|
1981 |
2 |
1 |
p. 63-76 14 p. |
artikel |
11 |
The complexity of identifying redundant and essential elements
|
Moran, Shlomo |
|
1981 |
2 |
1 |
p. 22-30 9 p. |
artikel |
12 |
The spanning bound as a measure of range query complexity
|
Fredman, M.L |
|
1981 |
2 |
1 |
p. 77-87 11 p. |
artikel |