- Hiroyuki Nakayama, Takao Nishizeki, Nobuji Saito:
Lower Bounds for Combinatorial Problems on Graphs. J. Algorithms 6(3): 393-399 (1985) - Kohei Noshita:
A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm. J. Algorithms 6(3): 400-408 (1985) - Colm Ó'Dúnlaing, Chee-Keng Yap:
A "Retraction" Method for Planning the Motion of a Disc. J. Algorithms 6(1): 104-111 (1985) - Patricio V. Poblete, J. Ian Munro:
The Analysis of a Fringe Heuristic for Binary Search Trees. J. Algorithms 6(3): 336-350 (1985) - Andrzej Proskurowski, Frank Ruskey:
Binary Tree Gray Codes. J. Algorithms 6(2): 225-238 (1985) - Quentin F. Stout:
Pyramid Computer Solutions of the Closest Pair Problem. J. Algorithms 6(2): 200-212 (1985) - Garret Swart:
Finding the Convex Hull Facet by Facet. J. Algorithms 6(1): 17-48 (1985) - Thomas G. Szymanski:
Hash Table Reorganization. J. Algorithms 6(3): 322-335 (1985) - Markku Tamminen:
Two Levels are as Good as Any. J. Algorithms 6(1): 138-144 (1985) - Esko Ukkonen:
Finding Approximate Patterns in Strings. J. Algorithms 6(1): 132-137 (1985) - Andrew Chi-Chih Yao:
On Optimal Arrangements of Keys with Double Hashing. J. Algorithms 6(2): 253-264 (1985)