Journals in DBLP

J. Algorithms
1994, volume: 17, number: 1

1. Joseph C. Culberson, Robert A. Reckhow
   Covering Polygons Is Hard. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1994, v:17, n:1, pp:2-44 [Journal]
   
2. Michael L. Fredman, Deborah L. Goldsmith
   Three Stacks. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1994, v:17, n:1, pp:44-70 [Journal]
   
3. Seth M. Malitz
   Graphs with E Edges Have Pagenumber O(sqrt(E)). [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1994, v:17, n:1, pp:71-84 [Journal]
   
4. Seth M. Malitz
   Genus g Graphs Have Pagenumber O(sqrt(g)). [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1994, v:17, n:1, pp:85-109 [Journal]
   
5. Yoram Moses, Orli Waarts
   Coordinated Traversal: (t + 1)- Round Byzantine Agreement in Polynomial Time. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1994, v:17, n:1, pp:110-156 [Journal]
   
6. Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish Rao
   Randomized Routing and Sorting on Fixed-Connection Networks. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1994, v:17, n:1, pp:157-205 [Journal]