Improving the average delay of sorting

DOI10.1016/J.TCS.2008.10.028zbMath1162.68009OpenAlexW2174588733MaRDI QIDQ1007244

Christian Schindelhauer, Andreas Jakoby, Maciej Liśkiewicz, K. Ruediger Reischuk

Publication date: 20 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.028

zbMATH Keywords

bit comparator sorting circuitstime complexity of Boolean circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cites Work

• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Circuit complexity
• The VLSI Complexity of Sorting
• Malign distributions for average case circuit complexity
• The average case complexity of the parallel prefix problem

This page was built for publication: Improving the average delay of sorting