Hagedoorn, Michiel Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Hagedoorn, M. (2003). Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size. In Database Theory - ICDT 2003: 9th International Conference (pp. 440-454). New York, USA: Springer.
