5. WAE 2001: Aarhus, Denmark

@proceedings{DBLP:conf/wae/2001,
  editor    = {Gerth St{\o}lting Brodal and
               Daniele Frigioni and
               Alberto Marchetti-Spaccamela},
  title     = {Algorithm Engineering, 5th International Workshop, WAE 2001 Aarhus,
               Denmark, August 28-31, 2001, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2141},
  year      = {2001},
  isbn      = {3-540-42500-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Gonzalo Navarro, Mathieu Raffinot:
  Compact DFA Representation for Fast Regular Expression Search. 1-12
  Electronic Edition (Springer LINK) BibTeX
• Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzon:
  The Max-Shift Algorithm for Approximate String Matching. 13-25
  Electronic Edition (Springer LINK) BibTeX
• Gianfranco Bilardi, Paolo D'Alberto, Alexandru Nicolau:
  Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance. 26-38
  Electronic Edition (Springer LINK) BibTeX
• Jyrki Katajainen, Bjarke Buur Mortensen:
  Experiences with the Design and Implementation of Space-Efficient Deques. 39-50
  Electronic Edition (Springer LINK) BibTeX
• Hervé Brönnimann:
  Designing and Implementing a General Purpose Halfedge Data Structure. 51-66
  Electronic Edition (Springer LINK) BibTeX
• Naila Rahman, Richard Cole, Rajeev Raman:
  Optimised Predecessor Data Structures for Internal Memory. 67-78
  Electronic Edition (Springer LINK) BibTeX
• Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel:
  An Adaptable and Extensible Geometry Kernel. 79-90
  Electronic Edition (Springer LINK) BibTeX
• Arne Andersson, Per Carlsson, Fredrik Ygge:
  Efficient Resource Allocation with Noisy Functions. 91-105
  Electronic Edition (Springer LINK) BibTeX
• Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma:
  Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem. 106-117
  Electronic Edition (Springer LINK) BibTeX
• Kazuo Iwama, Suguru Tamaki:
  Exploiting Partial Knowledge of Satisfying Assignments. 118-128
  Electronic Edition (Springer LINK) BibTeX
• David A. Bader, Ajith K. Illendula, Bernard M. E. Moret, Nina R. Weisse-Bernstein:
  Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture. 129-144
  Electronic Edition (Springer LINK) BibTeX
• Eric J. Anderson, Joseph Hall, Jason D. Hartline, Michael Hobbs, Anna R. Karlin, Jared Saia, Ram Swaminathan, John Wilkes:
  An Experimental Study of Data Migration Algorithms. 145-158
  Electronic Edition (Springer LINK) BibTeX
• Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Nearchos Paspallis, Paul G. Spirakis, Christos D. Zaroliagis:
  An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks. 159-171
  Electronic Edition (Springer LINK) BibTeX
• Christopher L. Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist:
  Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry. 172-184
  Electronic Edition (Springer LINK) BibTeX
• Matthias Müller-Hannemann, Karsten Weihe:
  Pareto Shortest Paths is Often Feasible in Practice. 185-198
  Electronic Edition (Springer LINK) BibTeX