|
|
Journals in DBLP
J. Algorithms
1985, volume: 6, number: 2
- Donald E. Knuth
Dynamic Huffman Coding. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1985, v:6, n:2, pp:163-180 [Journal]
- Donald E. Knuth
An Analysis of Optimum Caching. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1985, v:6, n:2, pp:181-199 [Journal]
- Quentin F. Stout
Pyramid Computer Solutions of the Closest Pair Problem. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1985, v:6, n:2, pp:200-212 [Journal]
- Herbert Edelsbrunner
Computing the Extreme Distances Between Two Convex Polygons. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1985, v:6, n:2, pp:213-224 [Journal]
- Andrzej Proskurowski, Frank Ruskey
Binary Tree Gray Codes. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1985, v:6, n:2, pp:225-238 [Journal]
- Fanica Gavril, Johanan Schönheim
Constructing Trees with Prescribed Cardinalities for the Components of Their Vertex Deleted Subgraphs. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1985, v:6, n:2, pp:239-252 [Journal]
- Andrew Chi-Chih Yao
On Optimal Arrangements of Keys with Double Hashing. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1985, v:6, n:2, pp:253-264 [Journal]
- Refael Hassin, Nimrod Megiddo
An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1985, v:6, n:2, pp:265-274 [Journal]
- Edward A. Bender, Herbert S. Wilf
A Theoretical Analysis of Backtracking in the Graph Coloring Problem. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1985, v:6, n:2, pp:275-282 [Journal]
- Leonidas J. Guibas
Problems. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1985, v:6, n:2, pp:283-290 [Journal]
- David S. Johnson
The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1985, v:6, n:2, pp:291-305 [Journal]
|
