Sorting with expensive comparands

DOI10.1080/00207168408803422MaRDI QIDQ3332257zbMATH OpenOpenAlexFDO

Authors Dana Richards

Publication date 1984

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168408803422

zbMATH Keywords

sorting algorithmcomparison costsposet-production

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 4110087
• On the Worst-Possible Analysis of Weighted Comparison-Based Algorithms
• Sorting and Selection with Random Costs
• Minimum cost sorting problem
• New results in minimum-comparison sorting

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Producing posets

Cited in

(9)

• Sorting and Selection with Random Costs
• Minimum cost sorting problem
• scientific article; zbMATH DE number 3856423 (Why is no real title available?)
• Sorting with Recurrent Comparison Errors
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• scientific article; zbMATH DE number 4110087 (Why is no real title available?)
• On the distribution of comparisons in sorting algorithms
• On the Worst-Possible Analysis of Weighted Comparison-Based Algorithms
• Optimal selection and sorting via dynamic programming

This page was built for publication: Sorting with expensive comparands

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