Journals in DBLP

J. Algorithms
1985, volume: 6, number: 1

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