On discrete search problems
- 1 January 1968
- journal article
- research article
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 2 (4) , 52-57
- https://doi.org/10.1007/bf01071410
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- A Linear Search ProblemSIAM Review, 1964
- An optimum encoding with minimum longest code and total number of digitsInformation and Control, 1964
- Balance Scale SortingThe American Mathematical Monthly, 1963
- Letter to the Editor—Information Theory and Search Theory as Special Cases of Decision TheoryOperations Research, 1961
- On an Optimal Search ProcedureThe American Mathematical Monthly, 1961
- An Optimal Search ProcedureThe American Mathematical Monthly, 1959
- Group Testing To Eliminate Efficiently All Defectives in a Binomial SampleBell System Technical Journal, 1959
- Variable-Length Binary EncodingsBell System Technical Journal, 1959
- Two inequalities implied by unique decipherabilityIEEE Transactions on Information Theory, 1956
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952