On playing "twenty questions" with a liar

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 16-22

  Dhagat, Aditi ^a   Gács, Peter ^b   Winkler, Peter ^c  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b BOSTON UNIVERSITY   (United States)

^c TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMAL BOUNDS; TIGHT BOUND; WINNING STRATEGY;

ALGORITHMS;

EID: 85031728204     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Javed A. Aslam and Aditi Dhagat. Searching in the presence of linearly bounded errors. In Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pages 486-493, 1991.
2. Andrzej Pelc. Searching wih known error probability. Theoretical Computer Science, 63:185-202, 1989.
3. R. L. Rivest, A. R. Meyer, D. J. Kleit-man, K. Winklmann, and J. Spencer. Coping with errors in binary search procedures. Journal of Computer and System Sciences, 20:396-404, 1980.
4. Joel Spencer and Peter Winkler. Three thresholds for a liar. Preprint, 1990.