The ACM Journal of Experimental Algorithmics

VOLUME 9, 2004

Find Volume 9 in the ACM Digital Library.

Section 1: Regular Articles

Article 1.1: Generating node coordinates for shortest-path computations in transportation networks, by Ulrik Brandes, Frank Schultz, Dorthea Wagner, and Thomas Willhalm. 16 pages.

Article 1.2: A performance study of data layout techniques for improving data locality in refinement-based pathfinding, by Robert Niewiadomski, José Nelson Amaral, and Robert C. Holte. 20 pages.

Article 1.3: An experimental study of a simple, distributed edge coloring algorithm, by Madhav V. Marathe, Alessandro Panconesi, and Larry D. Risinger, Jr. 18 pages.

Article 1.4: Average-optimal single and multiple approximate string matching, by Kimmo Fredriksson and Gonzalo Navarro. 45 pages.

Article 1.5: Cache-conscious sorting of large sets of strings with dynamic tries, by Ranjan Sinha and Justin Zobel. 32 pages.

To appear: Selected Papers from ALENEX'04

Selected papers from the Fifth Workshop on Algorithm Engineering and Experiments, held in January 2004, with guest co-editors Lars Arge and Guiseppe Italiano, will appear in Volume 10.

To appear: Selected Papers from WEA'04

Selected papers from the III Workshop on Efficient and Experimental Algorithms held in May 2004, with guest co-editors Celso Ribeiro and Simone Martins, will appear in Volume 10.