scientific article; zbMATH DE number 5182609

zbMATH Open1123.68148MaRDI QIDQ5757092

Emanuel M. Popovici, Rachit Agarwal, K. L. Man, M. Schellekens

Publication date: 24 August 2007

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

zbMATH Keywords

sortingcomparison-based algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

New results in minimum-comparison sorting ⋮ Comparing algorithms for sorting with \(t\) stacks in series ⋮ Linear-time in-place selection in less than 3n comparisons ⋮ Improved average complexity for comparison-based sorting ⋮ Deterministic sorting in nearly logarithmic time on the hypercube and related computers

Recommendations

• Title not available (Why is that?) 👍 👎
• A simple proof of a time-space trade-off for sorting with linear comparisons 👍 👎
• Area-time lower-bound techniques with applications to sorting 👍 👎
• On the upper bound of the complexity of sorting 👍 👎
• Tight Comparison Bounds on the Complexity of Parallel Sorting 👍 👎
• The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms 👍 👎
• A general lower bound on the I/O-complexity of comparison-based algorithms 👍 👎
• Improved average complexity for comparison-based sorting 👍 👎
• Small Complexity Gaps for Comparison-Based Sorting 👍 👎

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 Q5757092)