ACM logo

The ACM Journal of Experimental Algorithmics

VOLUME 6, 2001

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 the ACM Digital Library, Journal of Experimental Algorithmics, Volume 6.

Special Issue Articles

Dedicated to selected papers from the Second Workshop on Algorithmic Engineering and Experiments (ALENEX 00), held in January 2000 in San Francisco, with guest co-editor Andrew Goldberg (Microsoft Research).

Article 1:
I/O-Efficient Algorithms for Problems on Grid-Based Terrains, by Lars Arge, Laura Toma, and Jeffrey Scott Vitter, Duke University.

Article 2:
Removing Cycles for Minimizing Crossings, by Camil Demestrescu and Irene Finocchi, Universitá di Roma "La Sapienza".

Article 3:
A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis, by Harold Gabow, University of Colorado, and Tadayoshi Kohno, Reliable Software Technologies.

Article 4:
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms, by Raj Iyer, David Karger, Hariharan Rahul, MIT, and Mikkel Thorup, AT\&T Research.

Article 5:
Caching and Scheduling for Broadcast Disk Systems, by Vincenzo Liberatore, Case Western Reserve University.

Article 6:
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions, by Giri Narasimhan, University of Memphis, and Martin Zachariasen, University of Copenhagen.

Article 7:
Adapting Radix Sort to the Memory Hierarchy, by Naila Rahman and Rajeev Raman, King's College London.


Regular Articles:

Article 8:
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization, by Matthias Stallmann, Franc Brglez, and Debabrata Ghosh, North Carolina State University.

Article 9:
An Experimental Study of Dynamic Algorithms for Transitive Closure, by Daniele Frigioni, Universitá di Roma "La Sapienza", Tobias Miller, Transport-, Informatik-, und Logistik-Consulting GmbH, Frankfurt, Umberto Nanni, Universitá di L'Aquila, and Christos Zaroliagis, University of Patras.

Article 10:
The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression, by Yossi Matias, Tel Aviv University, Nasir Rajpoot, Warwick University, and Cenk Sahinalp, Case Western Reserve University.



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 December 26, 2002, by editor@jea.acm.org