On the Worst-Possible Analysis of Weighted Comparison-Based Algorithms

DOI10.1093/COMJNL/31.3.276MaRDI QIDQ3792249zbMATH OpenOpenAlexFDO

Authors Dana Richards

Publication date 1988

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/31.3.276

zbMATH Keywords

comparison-based algorithmsfindingmaximum keyoptimal algorithmsworst-case performance

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Sorting with expensive comparands
• scientific article; zbMATH DE number 4110087
• scientific article; zbMATH DE number 2079316
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Optimal worst case trees

Cited in

(3)

• Sorting with expensive comparands
• Beyond the Worst-Case Analysis of Algorithms
• Old and new results on alphabetic codes

This page was built for publication: On the Worst-Possible Analysis of Weighted Comparison-Based Algorithms

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