Finding the maximum and minimum

Discrete Applied Mathematics

Volumn 74, Issue 1, 1997, Pages 1-12

  Aigner, Martin ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Erroneous information; Searching; Sorting; Threshold

Indexed keywords

EID: 0006965779     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00012-1     Document Type: Article

References (11)

1. M. Aigner, Combinatorial Search (Wiley-Teubner, 1988).
2. N. Alon, M. Blum, A. Fiat, S.K. Kannan, M. Naor and R. Ostrovsky, Matching nuts and bolts, in: Proc. Fifth Annual ACM-SIAM SODA (ACM Press, New York, 1994) 690-696.
3. J.A. Aslam and A. Dagat, Searching in the presence of linearly bounded errors, in: Proc. 23rd ACM Symp. on Theory of Computing (1991) 486-493.
4. R.S. Borgstrom and S.R. Kosaraju, Comparison-based search in the presence of errors, STOC 1993.
5. A. De Bonis, L. Gargano and U. Vaccaro. Group testing with unreliable tests. Inform. Process. Lett., submitted.
6. A. Pelc, Solution of Ulam's game on searching with a lie. J. Combin. Theory (A) 44 (1987) 129-140.
7. A. Pelc, Searching with known error probability. Theoret. Comput. Sci. 63 (1989) 185-202.
8. B. Ravikumar, K. Ganesan and K.B. Lakshmanan, On selecting the largest element inspite of erroneous information, in: Proc. ICALP 87, 88-99.
9. R.L. Rivest, A.R. Meyer, D.J. Kleitman, K. Winklmann and J. Spencer. Coping with errors in binary search procedures, J. Comput. System. Sci. 20 (1980) 396-404.
10. J. Spencer, Ulam's searching game with a fixed number of lies, Theoret. Comput. Sci. 95 (1992) 307-321.
11. J. Spencer and P. Winkler, Three thresholds for a liar, Combin. Probab. Comput. 1 (1992) 81-93.