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