@techreport{MPI-I-92-155,
TITLE = {Simple randomized algorithms for closest pair problems},
AUTHOR = {Golin, Mordecai J. and Raman, Rajeev and Schwarz, Christian and Smid, Michiel},
LANGUAGE = {eng},
NUMBER = {MPI-I-92-155},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {1992},
DATE = {1992},
ABSTRACT = {We present a conceptually simple, randomized incremental algorithm for finding the closest pair in a set of $n$ points in $D$-dimensional space, where $D \geq 2$ is a fixed constant. Using dynamic perfect hashing, the algorithm runs in $O(n)$ expected time. In addition to being quick on the average, this algorithm is reliable: we show that it runs in $O(n \log n / \log\log n)$ time with high probability.},
TYPE = {Research Report},
}