Asymptotics of divide-and-conquer recurrences: Batcher's sorting algorithm and a minimum Euclidean matching heuristic

Hsien-Kuei Hwang. Asymptotics of divide-and-conquer recurrences: Batcher's sorting algorithm and a minimum Euclidean matching heuristic. Algorithmica, 22:4 (1998), 529-546. MathReview: 2000j:68206

Download: pdf (224 KB) | gz (129 KB)