{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:32Z","timestamp":1725558392337},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_14","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"139-149","source":"Crossref","is-referenced-by-count":0,"title":["Minimum and Maximum against k Lies"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hoffmann","sequence":"first","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Matou\u0161ek","sequence":"additional","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Philipp","family":"Zumstein","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(96)00012-1","volume":"74","author":"M. Aigner","year":"1997","unstructured":"Aigner, M.: Finding the maximum and the minimum. Discrete Applied Mathematics\u00a074, 1\u201312 (1997)","journal-title":"Discrete Applied Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Deppe, C.: Coding with feedback and searching with lies. In: Entropy, Search, Complexity. Bolyai Society Mathematical Studies, vol.\u00a016, pp. 27\u201370 (2007)","key":"14_CR2","DOI":"10.1007\/978-3-540-32777-6_2"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1137\/S0097539795288611","volume":"28","author":"D. Dor","year":"1999","unstructured":"Dor, D., Zwick, U.: Selecting the median. SIAM Journal on Computing\u00a028, 1722\u20131758 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford Jr.","year":"1956","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics\u00a08, 399\u2013404 (1956)","journal-title":"Canadian Journal of Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Gerbner, D., P\u00e1lv\u00f6lgyi, D., Patk\u00f3s, B., Wiener, G.: Finding the maximum and minimum elements with one lie. Discrete Applied Mathematics (to appear)","key":"14_CR5","DOI":"10.1016\/j.dam.2010.01.010"},{"key":"14_CR6","series-title":"Sorting and Searching","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol.\u00a03. Addison-Wesley Publishing Co., Reading (1973)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0304-3975(01)00303-6","volume":"270","author":"A. Pelc","year":"2002","unstructured":"Pelc, A.: Searching games with errors\u2014fifty years of coping with liars. Theoretical Computer Science\u00a0270, 71\u2013109 (2002)","journal-title":"Theoretical Computer Science"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1145\/361405.361423","volume":"15","author":"I. Pohl","year":"1972","unstructured":"Pohl, I.: A sorting problem and its complexity. Communications of the ACM\u00a015, 462\u2013464 (1972)","journal-title":"Communications of the ACM"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BFb0039597","volume-title":"STACS 87","author":"B. Ravikumar","year":"1987","unstructured":"Ravikumar, B., Ganesan, K., Lakshmanan, K.B.: On selecting the largest element in spite of erroneous information. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol.\u00a0247, pp. 88\u201399. Springer, Heidelberg (1987)"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computations: Towards a unified measure of complexity. In: Proceedings of 18th FOCS, pp. 222\u2013227 (1977)","key":"14_CR10","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:11:12Z","timestamp":1619784672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}