default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal 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 - Zevi Miller, James B. Orlin
:
NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings. 10-16 - Garret Swart:
Finding the Convex Hull Facet by Facet. 17-48 - Brenda S. Baker:
A New Proof for the First-Fit Decreasing Bin-Packing Algorithm. 49-70 - Valery B. Alekseyev:
On the Complexity of Some Algorithms of Matrix Multiplication. 71-85 - Nathan Linial, Michael E. Saks:
Searching Ordered Structures. 86-103 - Colm Ó'Dúnlaing, Chee-Keng Yap:
A "Retraction" Method for Planning the Motion of a Disc. 104-111 - Richard P. Anstee:
An Algorithmic Proof of Tutte's f-Factor Theorem. 112-131 - Esko Ukkonen:
Finding Approximate Patterns in Strings. 132-137 - Markku Tamminen:
Two Levels are as Good as Any. 138-144 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 145-159
Volume 6, Number 2, June 1985
- Donald E. Knuth:
Dynamic Huffman Coding. 163-180 - Donald E. Knuth:
An Analysis of Optimum Caching. 181-199 - Quentin F. Stout:
Pyramid Computer Solutions of the Closest Pair Problem. 200-212 - Herbert Edelsbrunner:
Computing the Extreme Distances Between Two Convex Polygons. 213-224 - Andrzej Proskurowski, Frank Ruskey:
Binary Tree Gray Codes. 225-238 - Fanica Gavril, Johanan Schönheim:
Constructing Trees with Prescribed Cardinalities for the Components of Their Vertex Deleted Subgraphs. 239-252 - Andrew Chi-Chih Yao:
On Optimal Arrangements of Keys with Double Hashing. 253-264 - Refael Hassin, Nimrod Megiddo:
An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function. 265-274 - Edward A. Bender, Herbert S. Wilf:
A Theoretical Analysis of Backtracking in the Graph Coloring Problem. 275-282 - Leonidas J. Guibas:
Problems. 283-290 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 291-305
Volume 6, Number 3, September 1985
- Martin Farber, J. Mark Keil:
Domination in Permutation Graphs. 309-321 - Thomas G. Szymanski:
Hash Table Reorganization. 322-335 - Patricio V. Poblete, J. Ian Munro:
The Analysis of a Fringe Heuristic for Binary Search Trees. 336-350 - M. C. Er:
The Complexity of the Generalised Cyclic Towers of Hanoi Problem. 351-358 - Victor Klee, Michael C. Laskowski:
Finding the Smallest Triangles Containing a Given Convex Polygon. 359-375 - Peter B. Borwein:
On the Complexity of Calculating Factorials. 376-380 - David P. Dobkin, David G. Kirkpatrick:
A Linear Algorithm for Determining the Separation of Convex Polyhedra. 381-392 - Hiroyuki Nakayama, Takao Nishizeki, Nobuji Saito:
Lower Bounds for Combinatorial Problems on Graphs. 393-399 - Kohei Noshita:
A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm. 400-408 - Alon Itai, Michael Rodeh:
Scheduling Transmissions in a Network. 409-429 - Nimrod Megiddo:
Partitioning with Two Lines in the Plane. 430-433 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 434-451
Volume 6, Number 4, December 1985
- David P. Dobkin, J. Ian Munro:
Efficient Uses of the Past. 455-465 - Béla Bollobás, István Simon:
Repeated Random Insertion into a Priority Queue. 466-477 - William M. Kantor:
Polynomial-Time Algorithms for Finding Elements of Prime Order and Sylow Subgroups. 478-514 - Herbert Edelsbrunner, Mark H. Overmars:
Batched Dynamic Solutions to Decomposable Searching Problems. 515-542 - Bernard Domanski, M. Anshel:
The Complexity of Dehn's Algorithm for Word Problems in Groups. 543-549 - A. Bagchi, Pradip K. Srimani:
Weighted Heuristic Search in Networks. 550-576 - Robert W. Irving:
An Efficient Algorithm for the "Stable Roommates" Problem. 577-595
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-01 15:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
