Journal of Algorithms, Volume 6

Volume 6, Number 1, March 1985

Luc Devroye: The Expected Length of the Longest Probe Sequence for Bucket Searching when the Distribution is Not Uniform. 1-9 BibTeX
Z. Miller, James B. Orlin: NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings. 10-16 BibTeX
Garret Swart: Finding the Convex Hull Facet by Facet. 17-48 BibTeX
Brenda S. Baker: A New Proof for the First-Fit Decreasing Bin-Packing Algorithm. 49-70 BibTeX
Valery B. Alekseyev: On the Complexity of Some Algorithms of Matrix Multiplication. 71-85 BibTeX
Nathan Linial, Michael E. Saks: Searching Ordered Structures. 86-103 BibTeX
Colm Ó'Dúnlaing, Chee-Keng Yap: A "Retraction" Method for Planning the Motion of a Disc. 104-111 BibTeX
Richard P. Anstee: An Algorithmic Proof of Tutte's f-Factor Theorem. 112-131 BibTeX
Esko Ukkonen: Finding Approximate Patterns in Strings. 132-137 BibTeX
Markku Tamminen: Two Levels are as Good as Any. 138-144 BibTeX
David S. Johnson: The NP-Completeness Column: An Ongoing Guide. 145-159 BibTeX

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

Martin Farber, J. Mark Keil: Domination in Permutation Graphs. 309-321 BibTeX
Thomas G. Szymanski: Hash Table Reorganization. 322-335 BibTeX
Patricio V. Poblete, J. Ian Munro: The Analysis of a Fringe Heuristic for Binary Search Trees. 336-350 BibTeX
M. C. Er: The Complexity of the Generalised Cyclic Towers of Hanoi Problem. 351-358 BibTeX
Victor Klee, Michael C. Laskowski: Finding the Smallest Triangles Containing a Given Convex Polygon. 359-375 BibTeX
Peter B. Borwein: On the Complexity of Calculating Factorials. 376-380 BibTeX
David P. Dobkin, David G. Kirkpatrick: A Linear Algorithm for Determining the Separation of Convex Polyhedra. 381-392 BibTeX
Hiroyuki Nakayama, Takao Nishizeki, Nobuji Saito: Lower Bounds for Combinatorial Problems on Graphs. 393-399 BibTeX
Kohei Noshita: A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm. 400-408 BibTeX
Alon Itai, Michael Rodeh: Scheduling Transmissions in a Network. 409-429 BibTeX
Nimrod Megiddo: Partitioning with Two Lines in the Plane. 430-433 BibTeX
David S. Johnson: The NP-Completeness Column: An Ongoing Guide. 434-451 BibTeX

David P. Dobkin, J. Ian Munro: Efficient Uses of the Past. 455-465 BibTeX
Béla Bollobás, István Simon: Repeated Random Insertion into a Priority Queue. 466-477 BibTeX
William M. Kantor: Polynomial-Time Algorithms for Finding Elements of Prime Order and Sylow Subgroups. 478-514 BibTeX
Herbert Edelsbrunner, Mark H. Overmars: Batched Dynamic Solutions to Decomposable Searching Problems. 515-542 BibTeX
B. Domanski, M. Anshel: The Complexity of Dehn's Algorithm for Word Problems in Groups. 543-549 BibTeX
A. Bagchi, Pradip K. Srimani: Weighted Heuristic Search in Networks. 550-576 BibTeX
Robert W. Irving: An Efficient Algorithm for the "Stable Roommates" Problem. 577-595 BibTeX