ACM Journal of Experimental Algorithms, Volume 6

Volume 6, 2001

Special Issue Articles
Selected papers from the Second Workshop on Algorithmic Engineering and Experiments (ALENEX 00), January 2000, San Francisco

Lars Arge, Laura Toma, Jeffrey Scott Vitter: I/O-Efficient Algorithms for Problems on Grid-Based Terrains. 1 BibTeX
Camil Demetrescu, Irene Finocchi: Rwmoving Cycles for Minimizing Crossings. 2- BibTeX
Harold N. Gabow, Tadayoshi Kohno: A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis. 3 BibTeX
Raj Iyer, David R. Karger, Hariharan Rahul, Mikkel Thorup: An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms. 4 BibTeX
Vincenzo Liberatore: Caching and Scheduling for Broadcast Disk Systems. 5 BibTeX
Giri Narasimhan, Martin Zachariasen: Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions. 6 BibTeX
Naila Rahman, Rajeev Raman: Adapting Radix Sort to the Memory Hierarchy. 7 BibTeX

Regular Articles

Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh: Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization. 8 BibTeX
Daniele Frigioni, Tobias Miller, Umberto Nanni, Christos D. Zaroliagis: An Experimental Study of Dynamic Algorithms for Transitive Closure. 9 BibTeX
Yossi Matias, Nasir Rajpoot, Süleyman Cenk Sahinalp: The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression. 10 BibTeX