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