The asymptotic complexity of merging networks

DOI10.1145/227595.227693zbMath0882.68065OpenAlexW1982036472MaRDI QIDQ4371518

Peter Bro Miltersen, Jun Tarui, Mike S. Paterson

Publication date: 19 January 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/60905/7/WRAP_cs-rr-216.pdf

zbMATH Keywords

mergingcomparator network

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (7)

Bounds on the size of merging networks ⋮ The strongest model of computation obeying 0-1 Principles ⋮ Some minimum merging networks ⋮ Comparator networks for binary heap construction ⋮ Optimal conclusive sets for comparator networks ⋮ Comparator networks for binary heap construction ⋮ Lower bounds for merging networks

This page was built for publication: The asymptotic complexity of merging networks