{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T22:24:28Z","timestamp":1768688668400,"version":"3.49.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"value":"354017219X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0039597","type":"book-chapter","created":{"date-parts":[[2006,1,31]],"date-time":"2006-01-31T16:55:52Z","timestamp":1138726552000},"page":"88-99","source":"Crossref","is-referenced-by-count":11,"title":["On selecting the largest element in spite of erroneous information"],"prefix":"10.1007","author":[{"given":"B.","family":"Ravikumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Ganesan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. B.","family":"Lakshmanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","first-page":"27","volume-title":"Foundations of Secure Computation","author":"R.A. DeMillo","year":"1978","unstructured":"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\u201337."},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/B978-0-7204-2262-7.50028-4","volume-title":"A Survey of Combinatorial Theory","author":"G.O.H. Katona","year":"1973","unstructured":"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\u2013308."},{"key":"7_CR3","volume-title":"Coping With Errors in Searching, Selecting and Sorting","author":"B. Ravikumar","year":"1983","unstructured":"B. Ravikumar, Coping With Errors in Searching, Selecting and Sorting, M.S. Thesis, Indian Institute of Technology, Madras, India, August 1983."},{"issue":"1","key":"7_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(84)90104-X","volume":"33","author":"B. Ravikumar","year":"1984","unstructured":"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\u201394.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"7_CR5","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/0022-0000(80)90014-8","volume":"20","author":"R.L. Rivest","year":"1980","unstructured":"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\u2013404.","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR6","volume-title":"Information, Uncertainty, Complexity","author":"J.F. Traub","year":"1983","unstructured":"J.F. Traub, G.W. Wasilkowski and H. Wozniakowski, Information, Uncertainty, Complexity, Addison-Wesley, Reading, MA, 1983."},{"key":"7_CR7","volume-title":"Adventures of a Mathematician","author":"S.M. Ulam","year":"1976","unstructured":"S.M. Ulam, Adventures of a Mathematician, Scribner, New York, 1976."},{"issue":"4","key":"7_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/356707.356711","volume":"9","author":"B. Weide","year":"1977","unstructured":"B. Weide, A Survey of Analysis Techniques for Discrete Algorithms, Computing Surveys, Vol.9, No.4, Dec. 1977, pp. 291\u2013313.","journal-title":"Computing Surveys"},{"issue":"1","key":"7_CR9","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1137\/0214009","volume":"14","author":"A.C. Yao","year":"1985","unstructured":"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\u2013128.","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","STACS 87"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039597.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:25:42Z","timestamp":1607552742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039597"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354017219X"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0039597","relation":{},"subject":[]}}