ACM Journal of Experimental Algorithmics, Volume 6

Volume 6, 2001

• Lars Arge, Laura Toma, Jeffrey Scott Vitter:
  I/O-Efficient Algorithms for Problems on Grid-Based Terrains. 1
  
• Camil Demetrescu, Irene Finocchi:
  Rwmoving 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 Rajpoot, Süleyman Cenk Sahinalp:
  The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression. 10
  

Last update Tue Feb 14 04:20:31 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page