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