Efficient randomized parallel algorithm for the closest pair problem in D-dimension

We present an efficient and simple randomized parallel algorithm, for finding the Closest Pair, in a set of n points in D - dimensional space, where (D≥2) is a fixed constant and the distances are measured in Lt metrics, 1≤t≤∞.