Journals in DBLP

J. Algorithms
2001, volume: 38, number: 1

1. Bernard M. E. Moret
   Foreword. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:38, n:1, pp:1- [Journal]
   
2. Bala Kalyanasundaram, Kirk Pruhs
   Eliminating Migration in Multi-processor Scheduling. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:38, n:1, pp:2-24 [Journal]
   
3. Jon M. Kleinberg, Amit Kumar
   Wavelength Conversion in Optical Networks. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:38, n:1, pp:25-50 [Journal]
   
4. Andrew V. Goldberg, Kostas Tsioutsiouliklis
   Cut Tree Algorithms: An Experimental Study. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:38, n:1, pp:51-83 [Journal]
   
5. Piotr Indyk
   A Small Approximately Min-Wise Independent Family of Hash Functions. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:38, n:1, pp:84-90 [Journal]
   
6. Gill Barequet, Sariel Har-Peled
   Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:38, n:1, pp:91-109 [Journal]
   
7. Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw
   Efficient Algorithms for Petersen's Matching Theorem. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:38, n:1, pp:110-134 [Journal]
   
8. Jeffrey D. Oldham
   Combinatorial Approximation Algorithms for Generalized Flow Problems. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:38, n:1, pp:135-169 [Journal]
   
9. Lenore Cowen
   Compact Routing with Minimum Stretch. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:38, n:1, pp:170-183 [Journal]
   
10. Alan Siegel
    Median Bounds and Their Application. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:184-236 [Journal]
    
11. David Bryant, Mike A. Steel
    Constructing Optimal Trees from Quartets. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:237-259 [Journal]
    
12. Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
    Placement Algorithms for Hierarchical Cooperative Caching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:260-302 [Journal]
    
13. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:303-333 [Journal]