Coping with known patterns of lies in a search game
- 31 December 1984
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 33 (1) , 85-94
- https://doi.org/10.1016/0304-3975(84)90104-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Coping with errors in binary search proceduresJournal of Computer and System Sciences, 1980
- A Counting Approach to Lower Bounds for Selection ProblemsJournal of the ACM, 1979
- Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979
- The game of “N questions” on a treeDiscrete Mathematics, 1977
- Performance bounds on the splitting algorithm for binary testingActa Informatica, 1974