On probabilistic networks for selection, merging, and sorting

DOI10.1007/s002240000068zbMath0893.68008OpenAlexW2047997354MaRDI QIDQ1384688

Yuan Ma, Torsten Suel, Leighton, Tom

Publication date: 3 August 1998

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

comparator networks

Mathematics Subject Classification ID

Searching and sorting (68P10) Computer system organization (68M99)

Related Items (2)

Sorting Short Keys in Circuits of Size ${o(n \log n)}$ ⋮ OptORAMa: optimal oblivious RAM

This page was built for publication: On probabilistic networks for selection, merging, and sorting