Binary search with errors and variable cost queries

Information Processing Letters

Volumn 68, Issue 5, 1998, Pages 261-270

  Sereno, Matteo ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

Binary search; BS strategy; Errors; Variable cost queries

Indexed keywords

BINARY SEQUENCES; ERROR CORRECTION; PROBLEM SOLVING; SET THEORY;

BINARY SEARCH; VARIABLE COST QUERY;

COMPUTATIONAL METHODS;

EID: 0032302545     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00166-5     Document Type: Article

References (16)

1. J.A. Aslam, A. Dhagat, Searching in the presence of linearly bounded errors, in: Proc. 23th Symposium on Theory of Computing, 1991, pp. 486-493.
2. J.L. Bentley, D.J. Brown, A general class of resource tradeoffs, J. Comput. System Sci. 25 (1982) 214-238.
3. E.R. Berlekamp, Block coding for the binary symmetric channel with noiseless, delayless feedback, in: Error-Correcting Codes, John Wiley & Sons, 1968, pp. 61-85.
4. T.H. Brylawski, The mathematics of Watergate (an analysis of a two-party games), Technical Report, University of North Carolina, 1978.
5. U. Feige, D. Peleg, P. Raghavan, E. Upfal, Computing with unreliable information, in: Proc. 22th Symposium on Theory on Computing, 1990, pp. 128-137.
6. F.J. Mac Williams, N.J. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
7. A. Pelc, Solution of Ulam's problem on searching with a lie, J. Combin. Theory Ser. A 44 (1987) 129-140.
8. A. Pelc, Prefix search with a lie, J. Combin. Theory Ser. A 48 (1988) 165-173.
9. A. Pelc, Searching with known error probability, Theoret. Comput. Sci. 63 (1989) 185-202.
10. B. Ravikumar, K. Ganesan, K.B. Lakshmanan, On selection the largest element in spite of erroneous information, in: 14th International Colloquium on Automata, Languages, and Programming (ICALP '87), Karlsruhe, Germany, Lecture Notes in Comput. Sci., Vol. 267, Springer, Berlin, July 1987, pp. 88-99.
11. B. Ravikumar, K.B. Lakshmanan, Coping with known patterns of lies in a search game, Theoret. Comput. Sci. 33 (1984) 85-94.
12. A.R. Rivest, A.R. Meyer, D.J. Kleitman, J. Spencer, Coping with errors in binary search procedures, J. Comput. System Sci. 20 (1980) 396-406.
13. M. Sereno, Binary search with errors and variable cost queries, Technical Report, University of Torino, Torino, Italy, July 1998.
14. J. Spencer, Ulam's searching game with a fixed number of lies, Theoret. Comput. Sci. 95 (1992) 307-321.
15. J. van Leeuwen, N. Santoro, J. Urrutia, S. Zaks, Guessing games and distributed computations in synchronous networks, in: 14th International Colloquium on Automata, Languages, and Programming (ICALP '87), Karlsruhe, Germany, Lecture Notes in Comput. Sci., Vol. 267, Springer, Berlin, July 1987, pp. 347-356.
16. J.H. van Lint, Introduction to Coding Theory, Springer, Berlin, 1982.