Improving the average delay of sorting

DOI10.1016/J.TCS.2008.10.028MaRDI QIDQ1007244zbMATH OpenOpenAlexFDO

Authors Andreas Jakoby, Maciej Liśkiewicz, Christian Schindelhauer, Rüdiger 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)

Recommendations

• Improving the Average Delay of Sorting
• Circuit complexity: from the worst case to the average case
• scientific article; zbMATH DE number 808799
• scientific article; zbMATH DE number 4085015
• Malign distributions for average case circuit complexity.

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 2081107 (Why is no real title available?)
• Circuit complexity: from the worst case to the average case
• Malign distributions for average case circuit complexity
• Sorting in \(c \log n\) parallel steps
• The VLSI Complexity of Sorting
• The average case complexity of the parallel prefix problem

Cited in

(2)

• Improving the Average Delay of Sorting
• scientific article; zbMATH DE number 808799 (Why is no real title available?)

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

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