The ACM Journal of Experimental Algorithmics

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

Article 1:
Irredundant Intervals, by Donald E. Knuth, Stanford University.

Article 2:
Predicting String Search Speed, by Arthur Gittelman, California State University at Long Beach.

Article 3:
Practical Parallel Algorithms for Personalized Communication and Integer Sorting, by David Bader, David Helman, and Joseph JáJá, University of Maryland.

Article 4:
The Influence of Caches on the Performance of Heaps, by Anthony LaMarca and Richard E. Ladner, University of Washington.

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 July 31, 1998, by editor@jea.acm.org