


default search action
ACM Journal of Experimental Algorithmics, Volume 6
Volume 6, 2001
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 - Camil Demetrescu, Irene Finocchi
:
Removing Cycles for Minimizing Crossings. 2 - Harold N. Gabow, Tadayoshi Kohno:
A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis. 3 - Raj Iyer, David R. Karger
, Hariharan Rahul, Mikkel Thorup:
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms. 4 - Vincenzo Liberatore
:
Caching and Scheduling for Broadcast Disk Systems. 5 - Giri Narasimhan
, Martin Zachariasen
:
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions. 6 - Naila Rahman, Rajeev Raman
:
Adapting Radix Sort to the Memory Hierarchy. 7
- Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh:
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization. 8 - Daniele Frigioni
, Tobias Miller, Umberto Nanni
, Christos D. Zaroliagis
:
An Experimental Study of Dynamic Algorithms for Transitive Closure. 9 - Yossi Matias, Nasir M. Rajpoot
, Süleyman Cenk Sahinalp:
The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression. 10

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.