Data structures, near neibor searches, and methodology : fifth and sixth DIMACS implementation challenges : papers related to the DIMACS challenge on dictionaries and priority queues (1995-1996) and the DIMACS challenge on near neighbor searches (1998-1999)
Michael H. Goldwasser, David S. Johnson, Catherine C. McGeoch · American Mathematical Society eBooks · 2002
Partially persistent dynamic sets for history-sensitive heuristics by R. Battiti A practical perfect hashing algorithm by C. Silverstein Computational evaluation of hot queues by A. V. Goldberg and C. Silverstein Nearest neighbor search for data compression by K. Zatloukal, M. H. Johnson, and R. E. Ladner Experimental evaluation of disk-based data structures for nearest neighbor searching by N. Katayama and S. Satoh Analysis of approximate nearest neighbor searching with clustered point sets by S. Maneewongvatana and D. M. Mount Approximate nearest neighbor search using the extended general space-filling curves heuristic by J.-C. Perez-Cortes and E. Vidal Locally lifting the curse of dimensionality for nearest neighbor search by P. N. Yianilos The role of experiment in the theory of algorithms by R. J. Anderson Towards a discipline of experimental algorithmics by B. M. E. Moret A theoretician's guide to the experimental analysis of algorithms by D. S. Johnson A bibliography of algorithm experimentation by C. C. McGeoch.