ACM Journal of Experimental Algorithmics, Volume 12

Volume 12, 2007

• Ulrik Brandes, Marco Gaertler, Dorothea Wagner:
  Engineering graph clustering: Models and experimental evaluation.
  
• Michael A. Maniscalco, Simon J. Puglisi:
  An efficient, versatile approach to suffix sorting.
  
• Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah:
  Symmetry breaking for pseudo-Boolean formulas.
  
• Marco Pellegrini, Giordano Fusco:
  Efficient IP table lookup via adaptive stratified trees with selective reconstructions.
  

• Lars Arge, Giuseppe F. Italiano:
  Preface.
  
• Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther:
  Engineering a cache-oblivious sorting algorithm.
  
• Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt:
  Sum-of-squares heuristics for bin packing and memory allocation.
  
• Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis:
  Efficient models for timetable information in public transportation systems.
  
• Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink, Xueyi Wang:
  Faster placement of hydrogens in protein structures by dynamic programming.
  

Volume 12, 2008

• Gonzalo Navarro, Nora Reyes:
  Dynamic spatial approximation trees.
  
• Ioannis Krommidas, Christos D. Zaroliagis:
  An experimental study of algorithms for fully dynamic transitive closure.
  
• Keqin Li:
  Experimental average-case performance evaluation of online algorithms for routing and wavelength assignment and throughput maximization in WDM optical networks.
  
• Paul Biggar, Nicholas Nash, Kevin Williams, David Gregg:
  An experimental study of sorting and branch prediction.
  
• Thomas Hazel, Laura Toma, Jan Vahrenhold, Rajiv Wickremesinghe:
  Terracost: Computing least-cost-path surfaces for massive grid terrains.
  
• Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton:
  A graph approach to the threshold all-against-all substring matching problem.
  
• Martin Dietzfelbinger, Martin Hühne, Christoph Weidling:
  A dictionary implementation based on dynamic perfect hashing.
  

• Camil Demetrescu, Roberto Tamassia:
  Papers from ALENEX 2005.
  
• Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
  On the adaptiveness of Quicksort.
  
• Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan:
  An experimental study of different approaches to solve the market equilibrium problem.
  
• Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders:
  Better external memory suffix array construction.
  
• Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret:
  Approximating the true evolutionary distance between two genomes.
  

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