Optimal Binary Identification Procedures
- 1 September 1972
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 23 (2) , 173-186
- https://doi.org/10.1137/0123019
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Optimal Computer Search Trees and Variable-Length Alphabetical CodesSIAM Journal on Applied Mathematics, 1971
- Optimum binary search treesActa Informatica, 1971
- On discrete search problemsCybernetics and Systems Analysis, 1968
- Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing TimeJournal of the ACM, 1966
- Balance Scale SortingThe American Mathematical Monthly, 1963
- On various versions of the defective coin problemInformation and Control, 1961
- On an Optimal Search ProcedureThe American Mathematical Monthly, 1961
- Optimum Search Routines for Automatic Fault LocationOperations Research, 1960
- An Optimum Policy for Detecting a Fault in a Complex SystemOperations Research, 1959
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952