scientific article; zbMATH DE number 4039307

MaRDI QIDQ3777463zbMATH OpenFDO

Authors Martin Dietzfelbinger

Publication date 1987

zbMATH Keywords

algorithmical complexitysorting

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 18528
• scientific article; zbMATH DE number 1240770
• Sorting the sums \((x_ i+y_ j)\) in \(O(n^ 2)\) comparisons
• An (n n) lower bound for computing the sum of even-ranked elements
• New results in minimum-comparison sorting

Cited in

(6)

• Sorting the sums \((x_ i+y_ j)\) in \(O(n^ 2)\) comparisons
• scientific article; zbMATH DE number 18528 (Why is no real title available?)
• scientific article; zbMATH DE number 841603 (Why is no real title available?)
• On the Complexity of Approximate Sum of Sorted List
• Lower bounds for sorting 16, 17, and 18 elements
• An (n n) lower bound for computing the sum of even-ranked elements

This page was built for publication:

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