Journals in DBLP
J. Algorithms 2001, volume: 38, number: 1
Bernard M. E. Moret Foreword. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2001, v:38, n:1, pp:1- [Journal ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Lenore Cowen Compact Routing with Minimum Stretch. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2001, v:38, n:1, pp:170-183 [Journal ] Alan Siegel Median Bounds and Their Application. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2001, v:38, n:1, pp:184-236 [Journal ] 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 ] 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 ] 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 ]