Sorting networks of logarithmic depth, further simplified

DOI10.1007/s00453-007-9025-6zbMath1172.68016OpenAlexW2043266636MaRDI QIDQ1024784

Joel I. Seiferas

Publication date: 17 June 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1802/2610

zbMATH Keywords

analysis of algorithmsparallel sortingsorting networkoblivious sortingcomparator networkcomparison network

Mathematics Subject Classification ID

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

Related Items (9)

Expander Construction in VNC1 ⋮ Sorting Short Keys in Circuits of Size ${o(n \log n)}$ ⋮ Expander construction in \(\mathrm{VNC}^1\) ⋮ On the complexity of min-max sorting networks ⋮ Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons ⋮ Fragile complexity of adaptive algorithms ⋮ Fragile complexity of comparison-based algorithms ⋮ Fragile complexity of adaptive algorithms ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved sorting networks with O(log N) depth
• Sorting in \(c \log n\) parallel steps
• Linear probing and graphs
• Construction of halvers

This page was built for publication: Sorting networks of logarithmic depth, further simplified