The ACM Journal of Experimental Algorithmics

VOLUME 5, 2000

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

Regular Articles:

Article 1:
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs, by David Eppstein, University of California at Irvine.

Article 2:
Correspondence-Based Data Structures for Double-Ended Priority Queues, by Kyun-Rak Chong, HongIk University (Korea), and Sartaj Sahni, University of Florida.

Article 3:
Improving Memory Performance of Sorting Algorithms, by Li Xiao, Xiaodong Zhang, and Stefan A. Kubricht, College of William and Mary.

Article 4:
Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata, by Gonzalo Navarro, University of Chile, and Mathieu Raffinot, Institut Gaspard Monge.

Special Issue Articles: ALENEX 99

Dedicated to selected papers from the First Workshop on Algorithmic Engineering and Experiments (ALENEX 99), held in January 1999 in Baltimore, with guest editors Michael Goodrich (Johns Hopkins University) and Catherine McGeoch (Amherst College).

Article 5:
Design and Implementation of Move-Based Heuristics for VLSI Hypergraph Partitioning, by Andrew E. Caldwell, Andrew B. Kahng, and Igor L. Markov, University of California at Los Angeles.

Article 6:
Finding the Right Cutting Planes for the TSP, by Matthew S. Levine, Massachusetts Institute of Technology.

Article 7:
Fast Priority Queues for Cached Memory, by Peter Sanders, Max Planck Institut für Informatik.

Article 8:
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study, by Matthias Müller-Hannemann and Alexander Schwartz, Technische Universität Berlin.

Article 9:
Computing the nxm Shortest Paths Efficiently, by Tetsuo Shibuya, IBM Research Division, Tokyo Laboratory.

Special Issue Articles: WAE 99

Dedicated to selected papers from the Third Workshop on Algorithmic Engineering (WAE 99), held in July 1999 in London, England, with guest editors Christos Zaroliagis (King's College, London, now University of Patras, Greece) and Jeff Vitter (Duke University).

Introduction to the Special Issue available in Postscript or PDF.

Article 10:
Experiments With List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism, by Shlomit Dascal and Uzi Vishkin, University of Maryland.

Article 11:
Finding Minimum Congestion Spanning Trees, by Renato Werneck and João Setubal, University of Campinas, Brazil.

Article 12:
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport, by Frank Schulz, Dorothea Wagner, and Karsten Weihe, Universität Konstanz.

Article 13:
The Design and Implementation of Planar Maps in CGAL, by Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, and Eti Ezra, Tel Aviv University.

Article 14:
Analysing Cache Effects in Distribution Sorting, by Naila Rahman and Rajeev Raman, King's College, London.

Article 15:
Performance Engineering Case Study: Heap Construction, by Jesper Bojesen, Jyrki Katajainen, and Maz Spork, University of Copenhagen.

Article 16:
Rapid Software Prototyping in Molecular Modeling Using the Biochemical Algorithms Library (BALL), by N.P. Boghossian, O. Kohlbacher, and H.P. Lenhof, Max-Planck Institut für Informatik.

Article 17:
An Experimental Study of Priority Queues in External Memory, by Klaus Brengel, Andreas Crauser, Paolo Ferragina, and Ulrich Meyer, Max-Planck Institut für Informatik.

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 October 11, 2001, by moret@jea.acm.org