On the lower bound for minimum comparison selection

DOI10.21136/AM.1978.103726MaRDI QIDQ3851641zbMATH OpenOpenAlexFDO

Authors Peter Ružička, Jiří Wiedermann

Publication date 1978

Full work available at URL https://eudml.org/doc/15033

zbMATH Keywords

adversary strategylower boundminimum comparisonselection algorithmselection problemworst-case complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cites work

• Finding the median
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Time bounds for selection

This page was built for publication: On the lower bound for minimum comparison selection

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