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