Accepted Papers

WAE 2001

5th Workshop on Algorithm Engineering
BRICS, University of Aarhus, Denmark, August 28-30, 2001

ALGO 2002
September 16-21
Rome ``La Sapienza''
ALGO 2001
-Online Registration (closed)
-Registration fees
-Travel and tourist Information
-Author index
ESA 2001
-Accepted papers
-Call for papers
WAE 2001
-Accepted papers
-Call for papers
WABI 2001
-Accepted papers
-Accepted posters
-Call for papers
-Call for posters
-Accepted papers
-Call for papers
[ Site map ]
  1. Efficient Resource Allocation with Noisy Functions
    Arne Andersson and Per Carlsson and Fredrik Ygge
  2. Compact DFA Representation for Fast Regular Expression Search
    Gonzalo Navarro and Mathieu Raffinot
  3. Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
    David A. Bader and Ajith K. Illendula and Bernard M.E. Moret
  4. An Experimental Study of Data Migration Algorithms
    Eric Anderson, Joe Hall, Jason Hartline, Michael Hobbs, Anna Karlin, Jared Saia, Ram Swaminathan, John Wilkes
  5. Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry
    Chris Barrett and Doug Cook and Vance Faber and Gregory Hicks and Achla Marathe and Madhav Marathe and Aravind Srinivasan and Yoram J. Sussmann and Heidi Thornquist
  6. An Adaptable and Extensible Geometry Kernel
    Susan Hert and Michael Hoffmann and Lutz Kettner and Sylvain Pion and Michael Seel
  7. The max-shift algorithm for approximate string matching
    Costas S. Iliopoulos, Laurent Mouchard and Yoan J. Pinzon
  8. Fractal Matrix Multiplication: a Case Study on Portability of Cache Performance
    Gianfranco Bilardi, Paolo D'Aberto and Alexandru Nicolau
  9. Exploiting Partial Knowledge of Satisfying Assignments
    Kazuo Iwama and Suguru Tamaki
  10. An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks
    Ioannis Chatzigiannakis and Sotiris Nikoletseas and Nearchos Paspallis and Paul Spirakis and Christos Zaroliagis
  11. Experiences with the design and implementation of space-efficient deques
    Jyrki Katajainen and Bjarke Buur Mortensen
  12. Designing and implementing a general purpose halfedge data structure
    Hervé Brönnimann
  13. Pareto Shortest Paths is Often Feasible in Practice
    Matthias Mueller-Hannemann and Karsten Weihe
  14. Optimised Predecessor Data Structures for Internal Memory
    Naila Rahman, Richard Cole, Rajeev Raman
  15. Improving the efficiency of Branch and Bound Algortihms for the Simple Plant Location Problem
    Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma

Page maintained by Gerth Stølting Brodal