On an Optimal Search Procedure

DOI10.2307/2312475MaRDI QIDQ3847322zbMATH OpenOpenAlexFDO

Authors Martin Sandelius

Publication date 1961

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2312475

zbMATH Keywords

probability theory

Cited in

(5)

• An explicit expression for the cost of a class of Huffman trees
• Optimal merging of 2 elements with n elements
• On the optimality of a simple prefix code
• Procédures optimales pour le classement des $t$ meilleurs articles parmi $n$ au moyen de comparaisons binaires
• Some remarks on the construction of optimal codes

This page was built for publication: On an Optimal Search Procedure

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