Improving the average delay of sorting

DOI10.1016/J.TCS.2008.10.028zbMATH Open1162.68009OpenAlexW2174588733MaRDI QIDQ1007244FDOQ1007244

Christian Schindelhauer, Rüdiger Reischuk, Andreas Jakoby, Maciej Liśkiewicz

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

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
• Malign distributions for average case circuit complexity.

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

• Title not available (Why is that?)
• Sorting in \(c \log n\) parallel steps
• The VLSI Complexity of Sorting
• Circuit complexity: from the worst case to the average case
• Title not available (Why is that?)
• Malign distributions for average case circuit complexity
• The average case complexity of the parallel prefix problem

Cited In (3)

• Improving the Average Delay of Sorting
• Title not available (Why is that?)
• Improved average complexity for comparison-based sorting

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)