Time-complexity of shear sort

MaRDI QIDQ3581940zbMATH OpenFDO

Authors Greg Starling, Gordon S. Beavers

Publication date 2 September 2010

zbMATH Keywords

sorting networktime-complexitymixed radix merger networkshear sort

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Searching and sorting (68P10)

Recommendations

• Parallel sorting in two-dimensional VLSI models of computation
• On the complexity of min-max sorting networks
• The periodic balanced sorting network
• Tight Bounds on the Complexity of Parallel Sorting
• Periodic merging networks

Cited in

(1)

• Constant-time sorting

This page was built for publication: Time-complexity of shear sort

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