scientific article; zbMATH DE number 4039307

zbMATH Open0637.68065MaRDI QIDQ3777463FDOQ3777463

Authors: Martin Dietzfelbinger 

Publication date: 1987

Title of this publication is not available (Why is that?)

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 \(\Omega (n\log n)\) lower bound for computing the sum of even-ranked elements
• New results in minimum-comparison sorting

zbMATH Keywords

sortingalgorithmical complexity

Mathematics Subject Classification ID

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

Cited In (6)

• On the Complexity of Approximate Sum of Sorted List
• An \(\Omega (n\log n)\) lower bound for computing the sum of even-ranked elements
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sorting the sums \((x_ i+y_ j)\) in \(O(n^ 2)\) comparisons
• Lower bounds for sorting 16, 17, and 18 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)