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

DOI10.1007/PL00009238zbMath0914.68048OpenAlexW2002086210MaRDI QIDQ1277380

Hsien-Kuei Hwang

Publication date: 21 June 1999

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009238

zbMATH Keywords

sorting algorithmminimum Euclidean matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items (3)

Batcher's odd-even exchange revisited: a generating functions approach ⋮ Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collated ⋮ On the total length of the random minimal directed spanning tree

This page was built for publication: Asymptotics of divide-and-conquer recurrences: Batcher's sorting algorithm and a minimum Euclidean matching heuristic