On an Optimal Search Procedure

DOI10.2307/2312475zbMath0111.33403OpenAlexW2314654944MaRDI QIDQ3847322

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

Related Items (5)

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

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