Sorting networks of logarithmic depth, further simplified

DOI10.1007/S00453-007-9025-6zbMATH Open1172.68016OpenAlexW2043266636MaRDI QIDQ1024784FDOQ1024784

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 algorithmssorting networkparallel sortingoblivious sortingcomparator networkcomparison network

Mathematics Subject Classification ID

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

Cites Work

• Introduction to algorithms
• Linear probing and graphs
• Title not available (Why is that?)
• Sorting in \(c \log n\) parallel steps
• Improved sorting networks with O(log N) depth
• Title not available (Why is that?)
• Title not available (Why is that?)
• Construction of halvers
• Title not available (Why is that?)

Cited In (11)

• Fragile complexity of comparison-based algorithms
• Bitonic sorters of minimal depth
• On the complexity of min-max sorting networks
• Improved sorting networks with O(log N) depth
• Expander Construction in VNC1
• Fragile complexity of adaptive algorithms
• Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
• Expander construction in \(\mathrm{VNC}^1\)
• Title not available (Why is that?)
• Fragile complexity of adaptive algorithms
• Sorting Short Keys in Circuits of Size ${o(n \log n)}$

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024784)