Review of "Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenge by Michael H. Goldwasser, David S. Johnson, Catherine C. McGeoch", American Mathematical Society 2002

1 Overview This book is in the area of searching data structures, and algorithms. It also has a discussion on experimental analysis of algorithms. The goal of DIMACS Implementation Challenges is projected as to promote top quality experimental research on algorithms, and data structures. The fifth challenge (1995-1996) was on dictionaries, and priority queues. The first part of the book is from the works in the fifth challenge. The sixth challenge (1998) was on near neighbor searching. The second part of the book is from the works in the sixth challenge. The third part of the book has general discussion articles on algorithm experiments.

[1]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[2]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).