An almost optimal algorithm for unbounded searching
- 1 August 1976
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 5 (3) , 82-87
- https://doi.org/10.1016/0020-0190(76)90071-5
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975
- Parallel minimax search for a maximumJournal of Combinatorial Theory, 1968