|
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 analysis of optimum caching |
Knuth, Donald E |
1985 |
6 | 2 |
p. 181-199 19 p. |
article |
|
| 2 | An optimal algorithm for finding all the jumps of a monotone step-function |
Hassin, Refael |
1985 |
6 | 2 |
p. 265-274 10 p. |
article |
|
| 3 | A theoretical analysis of backtracking in the graph coloring problem |
Bender, Edward A |
1985 |
6 | 2 |
p. 275-282 8 p. |
article |
|
| 4 | Binary tree gray codes |
Proskurowski, Andrzej |
1985 |
6 | 2 |
p. 225-238 14 p. |
article |
|
| 5 | Computing the extreme distances between two convex polygons |
Edelsbrunner, H |
1985 |
6 | 2 |
p. 213-224 12 p. |
article |
|
| 6 | Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs |
Gavril, Fanica |
1985 |
6 | 2 |
p. 239-252 14 p. |
article |
|
| 7 | Dynamic huffman coding |
Knuth, Donald E |
1985 |
6 | 2 |
p. 163-180 18 p. |
article |
|
| 8 | On optimal arrangements of keys with double hashing |
Yao, Andrew C |
1985 |
6 | 2 |
p. 253-264 12 p. |
article |
|
| 9 | Papers to appear in forthcoming issues |
1985 |
6 | 2 |
p. 306-307 2 p. |
article |
||
| 10 | Problems |
Guibas, Leo J |
1985 |
6 | 2 |
p. 283-290 8 p. |
article |
|
| 11 | Pyramid computer solutions of the closest pair problem |
Stout, Quentin F |
1985 |
6 | 2 |
p. 200-212 13 p. |
article |
|
| 12 | The NP-completeness column: An ongoing guide |
Johnson, David S |
1985 |
6 | 2 |
p. 291-305 15 p. |
article |
12 results found