DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 2002; 256 pp; hardcover Volume: 59 ISBN10: 0821828924 ISBN13: 9780821828922 List Price: US$96 Member Price: US$76.80 Order Code: DIMACS/59
 This book presents reviewed and revised papers from the fifth and sixth DIMACS Implementation Challenge workshops. These workshops, held approximately annually, aim at encouraging highquality work in experimental analysis of data structures and algorithms. The papers published in this volume are the results of yearlong coordinated research projects and contain new findings and insights. Three papers address the performance evaluation of implementations for two fundamental data structures, dictionaries and priority queues, as used in the context of real applications. Another four papers consider the still evolving topic of methodologies for experimental algorithmics. Five papers are concerned with implementations of algorithms for nearest neighbor search in high dimensional spaces, an area with applications in information retrieval and data mining on collections of Web documents, DNA sequences, images and various other data types. Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 17 were copublished with the Association for Computer Machinery (ACM). Readership Graduate students and researchers interested in algorithms and their experimental analysis; engineers working on algorithms for data processing. Table of Contents  R. Battiti  Partially persistent dynamic sets for historysensitive heuristics
 C. Silverstein  A practical perfect hashing algorithm
 A. V. Goldberg and C. Silverstein  Computational evaluation of hot queues
 K. Zatloukal, M. H. Johnson, and R. E. Ladner  Nearest neighbor search for data compression
 N. Katayama and S. Satoh  Experimental evaluation of diskbased data structures for nearest neighbor searching
 S. Maneewongvatana and D. M. Mount  Analysis of approximate nearest neighbor searching with clustered point sets
 J.C. PerezCortes and E. Vidal  Approximate nearest neighbor search using the extended general spacefilling curves heuristic
 P. N. Yianilos  Locally lifting the curse of dimensionality for nearest neighbor search
 R. J. Anderson  The role of experiment in the theory of algorithms
 B. M. E. Moret  Towards a discipline of experimental algorithmics
 D. S. Johnson  A theoretician's guide to the experimental analysis of algorithms
 C. C. McGeoch  A bibliography of algorithm experimentation
