Abstract is missing.
- Engineering Geometric Algorithms: Persistent Problems and Some Solutions (Abstract of invited talk)Dan Halperin. 3
- Engineering a Cache-Oblivious Sorting AlgorithGerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther. 4-17
- The Robustness of the Sum-of-Squares Algorithm for Bin PackingMichael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt. 18-30
- Practical aspects of Compressed Suffix Arrays and FM-Index in Searching DNA SequencesWing-Kai Hon, Tak Wah Lam, Wing-Kin Sung, Wai-Leuk Tse, Chi-Kwong Wong, Siu-Ming Yiu. 31-38
- Faster Placement of Hydrogens in Protein Structures by Dynamic ProgrammingAndrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink. 39-48
- An Experimental Analysis of a Compact Graph RepresentationDaniel K. Blandford, Guy E. Blelloch, Ian A. Kash. 49-61
- Kernelization Algorithms for the Vertex Cover Problem: Theory and ExperimentsFaisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, Christopher T. Symons. 62-69
- Safe Seperators for TreewidthHans Leo Bodlaender, Arie M. C. A. Koster. 70-78
- Efficient Implementation of Hotlink Assignment Algorithm for Web SitesArtur Alves Pessoa, Eduardo Sany Laber, Críston de Souza. 79-87
- Experimental Comparison of Shortest Path Approaches for Timetable InformationEvangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis. 88-99
- Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road NetworksRonald J. Gutman. 100-111
- Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance MeasuresJean Cardinal, David Eppstein. 112-119
- Approximating the Visible Region of a Point on a TerrainBoaz Ben-Moshe, Paz Carmi, Matthew J. Katz. 120-128
- A Computational Framework for Handling MotionLeonidas J. Guibas, Menelaos I. Karavelas, Daniel Russel. 129-141
- Engineering a Sorted List Data Structure for 32 Bit KeyRoman Dementiev, Lutz Kettner, Jens Mehnert, Peter Sanders. 142-151
- Theory and Practice of Probabilistic Counting Algorithms (Abstract of Invited Talk)Philippe Flajolet. 152
- Analysis of Randomized Selection Algorithm Motivated by the LZ 77 SchemeMark Daniel Ward, Wojciech Szpankowski. 153-160
- The Complexity of Jensen s Algorithm for Counting PolyominoesGill Barequet, Micha Moffie. 161-169
- Distribuional Analyses of Euclidean AlgorithmsViviane Baladi, Brigitte Vallée. 170-184
- A Simple Primality Test and th rth Smallest Prime FactorDaniel Panario, L. Bruce Richmond, Martha Yip. 185-193
- Gap-Free Samples of Geometric Random VariablesPawel Hitczenko, Arnold Knopfmacher. 194-198
- Computation of a Class of COntinued Fraction ConstantsLoïck Lhote. 199-210
- Compositions and Patricia Tries: No Fluctuations in the Variance!Helmut Prodinger. 211-215
- Quadratic Convergence for Scaling of MatricesMartin Fürer. 216-223
- Patial QuicksortConrado Martinez. 224-228