b'@techreport{MPI-I-92-155,'b'\nTITLE = {Simple randomized algorithms for closest pair problems},\nAUTHOR = {Golin, Mordecai J. and Raman, Rajeev and Schwarz, Christian and Smid, Michiel},\nLANGUAGE = {eng},\nNUMBER = {MPI-I-92-155},\nINSTITUTION = {Max-Planck-Institut f{\\"u}r Informatik},\nADDRESS = {Saarbr{\\"u}cken},\nYEAR = {1992},\nDATE = {1992},\nABSTRACT = {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.},\nTYPE = {Research Report},\n}\n'