1. Andoni, A., Indyk, P., Pǎtrascu, M.: On the optimality of the dimensionality reduction method. In: Proc. 47th IEEE Symp. on Foundations of Computer Science, pp. 449–458 (2006)
2. Barkol, O., Rabani, Y.: Tighter lower bounds for nearest neighbor search and related problems in the cell probe model. In: Proc. 32nd ACM Symp. on the Theory of Computing, pp. 388–396 (2000)
3. Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is “nearest neighbor” meaningful. In: Proc. 7-th Intern. Conf. on Database Theory, ICDT-99, Jerusalem, pp. 217–235 (1999)
4. Borodin, A., Ostrovsky, R., Rabani, Y.: Lower bounds for high-dimensional nearest neighbor search and related problems. In: Proc. 31st Annual ACS Sympos. Theory Comput, pp. 312–321 (1999)
5. Bustos, B., Navarro, G., Chávez, E.: Pivot selection techniques for proximity searching in metric spaces. Pattern Recognit. Lett. 24, 2357–2366 (2003)