The ACM Journal of Experimental Algorithmics

Please note: The articles in this volume now appear in the ACM Digital Library. You can find the table of contents, together with browsing and indexing services, at ACM Digital Library, Journal of Experimental Algorithmics, Volume 4.

Regular Articles:

Article 1:
A Memetic Algorithm to Schedule Planned Maintenance for the National Grid, by E.K. Burke and A.J. Smith, University of Nottingham

Article 2:
A New String-Pattern Matching Algorithm Using Partitioning and Hashing Efficiently, by Sun Kim, University of Illinois

Special Issue Articles (WAE 98)

Article 3:
Matrix Multiplication: A Case Study of Enhanced Data Cache Utilization, by N. Eiron, Technion, and M. Rodeh and I. Steinwarts, IBM Haifa

Article 4:
Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks, by T. Erlebach, Eidgenössische Technische Hochschule Zürich, and K. Jansen, Christian-Alberts Universität Kiel

Article 5:
Hybrid Tree Reconstruction Methods, by D. Huson, S. Nettles, K. Rice, T. Warnow, and S. Yooseph, University of Pennsylvania

Article 6:
A Computational Study of Routing Algorithms for Realistic Transportation Networks, by R. Jacob, Aarhus University, and M. Marathe and K. Nagel, Los Alamos National Laboratory

Article 7:
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design, by M. Müller-Hannemann and A. Schwartz, Technische Universität Berlin

Article 8:
Computing the Width of a Three-Dimensional Point Set: An Experimental Study, by J. Schwerdt and M. Smid, Universität Magdeburg, J. Majhi, Mentor Graphics Corp., and R. Janardan, University of Minnesota

Please note that the source text and Postscript/PDF versions are the definitive versions; the HTML version is provided for quick online perusal only.

   Last updated and validated May 21, 2000, by editor@jea.acm.org