Abstract
In this paper, we study the problem of finding the largest of a set of n distinct integers using comparison queries which receive “yes” or “no” answers, but some of which may be erroneous. If at most e queries can receive erroneous answers, we prove that (e+1)n−1 comparisons are necessary and sufficient to find the largest. If there is further restriction that errors are confined to “no” answers and that all “yes” answers are guaranteed to be correct, then 2n+2e−4 comparisons are sufficient. This contrasts with earlier results relating to errors in binary search procedures where both versions of the problem have the same complexity.
Presently visiting the Department of Electrical Engineering. McGill University, Montreal, P.Q. H3A 2A7. Canada. where this research was supported in part by an NSERC Operating Grant A0890.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R.A. DeMillo, D.P. Dopkin, and R.J. Lipton, Combinatorial Inference, in Foundations of Secure Computation, R.A. DeMillo, D.P. Dopkin, A.K. Jones and R.J. Lipton, Eds., Academic Press, New York, 1978, pp.27–37.
G.O.H. Katona, Combinatorial Search Problems, in A Survey of Combinatorial Theory, J.N. Srivastava et al., Eds., North-Holland, Amsterdam, 1973, pp. 285–308.
B. Ravikumar, Coping With Errors in Searching, Selecting and Sorting, M.S. Thesis, Indian Institute of Technology, Madras, India, August 1983.
B. Ravikumar and K.B. Lakshmanan, Coping with Known Patterns of Lies in a Search Game, Theoretical Computer Science, Vol. 33, No.1, Sept. 1984, pp.85–94.
R.L. Rivest, A.R. Meyer, D.J. Kleitman, K. Winklman and J. Spencer, Coping with Errors in Binary Search Procedures, Journal of Computer and System Sciences, Vol. 20, No. 3, June 1980, pp. 396–404.
J.F. Traub, G.W. Wasilkowski and H. Wozniakowski, Information, Uncertainty, Complexity, Addison-Wesley, Reading, MA, 1983.
S.M. Ulam, Adventures of a Mathematician, Scribner, New York, 1976.
B. Weide, A Survey of Analysis Techniques for Discrete Algorithms, Computing Surveys, Vol.9, No.4, Dec. 1977, pp. 291–313.
A.C. Yao and F.F. Yao, On Fault-Tolerant Networks for Sorting, SIAM Journal of Computing, Vol.14, No.1, Feb. 1985, pp. 120–128.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ravikumar, B., Ganesan, K., Lakshmanan, K.B. (1987). On selecting the largest element in spite of erroneous information. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039597
Download citation
DOI: https://doi.org/10.1007/BFb0039597
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17219-2
Online ISBN: 978-3-540-47419-7
eBook Packages: Springer Book Archive