{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T02:38:50Z","timestamp":1794364730532,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642029264","type":"print"},{"value":"9783642029271","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02927-1_5","type":"book-chapter","created":{"date-parts":[[2009,7,4]],"date-time":"2009-07-04T04:37:10Z","timestamp":1246682230000},"page":"37-48","source":"Crossref","is-referenced-by-count":20,"title":["Sorting and Selection with Imprecise Comparisons"],"prefix":"10.1007","author":[{"given":"Mikl\u00f3s","family":"Ajtai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vitaly","family":"Feldman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avinatan","family":"Hassidim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jelani","family":"Nelson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1388240.1388242","volume":"39","author":"G. Aggarwal","year":"2008","unstructured":"Aggarwal, G., Ailon, N., Constantin, F., Even-Dar, E., Feldman, J., Frahling, G., Henzinger, M.R., Muthukrishnan, S., Nisan, N., P\u00e1l, M., Sandler, M., Sidiropoulos, A.: Theory research at Google. SIGACT News\u00a039(2), 10\u201328 (2008)","journal-title":"SIGACT News"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1137\/0404042","volume":"4","author":"S. Assaf","year":"1991","unstructured":"Assaf, S., Upfal, E.: Fault tolerant sorting networks. SIAM J. Discrete Math\u00a04(4), 472\u2013480 (1991)","journal-title":"SIAM J. Discrete Math"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Hassidim, A.: The bayesian learner is optimal for noisy binary search (and pretty good for quantum as well). In: FOCS, pp. 221\u2013230 (2008)","DOI":"10.1109\/FOCS.2008.58"},{"issue":"4","key":"5_CR4","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci.\u00a07(4), 448\u2013461 (1973)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(83)90095-1","volume":"6","author":"B. Bollob\u00e1s","year":"1983","unstructured":"Bollob\u00e1s, B., Thomason, A.: Parallel sorting. Discrete Appl. Math.\u00a06, 1\u201311 (1983)","journal-title":"Discrete Appl. Math."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Borgstrom, R.S., Kosaraju, S.R.: Comparison-based search in the presence of errors. In: STOC, pp. 130\u2013136 (1993)","DOI":"10.1145\/167088.167129"},{"key":"5_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"5_CR8","unstructured":"David, H.A.: The Method of Paired Comparisons, 2nd edn. Charles Griffin & Company Limited (1988)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Feige, U., Raghavan, P., Peleg, D., Upfal, E.: Computing with noisy information. SIAM J. Comput.\u00a023(5) (1994)","DOI":"10.1137\/S0097539791195877"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/11786986_26","volume-title":"Automata, Languages and Programming","author":"I. Finocchi","year":"2006","unstructured":"Finocchi, I., Grandoni, F., Italiano, G.F.: Optimal resilient sorting and searching in the presence of memory faults. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 286\u2013298. Springer, Heidelberg (2006)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Finocchi, I., Italiano, G.F.: Sorting and searching in the presence of memory faults (without redundancy). In: STOC, pp. 101\u2013110 (2004)","DOI":"10.1145\/1007352.1007375"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0022-0000(03)00040-0","volume":"67","author":"W.I. Gasarch","year":"2003","unstructured":"Gasarch, W.I., Golub, E., Kruskal, C.P.: Constant time parallel sorting: an empirical view. J. Comput. Syst. Sci.\u00a067(1), 63\u201391 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1137\/0210034","volume":"10","author":"R. H\u00e4ggkvist","year":"1981","unstructured":"H\u00e4ggkvist, R., Hell, P.: Parallel sorting with constant time for comparisons. SIAM J. Comput.\u00a010(3), 465\u2013472 (1981)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1137\/0603047","volume":"3","author":"R. H\u00e4ggkvist","year":"1982","unstructured":"H\u00e4ggkvist, R., Hell, P.: Sorting and merging in rounds. SIAM Journal on Algebraic and Discrete Methods\u00a03(4), 465\u2013473 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"5_CR15","unstructured":"Karp, R.M., Kleinberg, R.: Noisy binary search and its applications. In: SODA, pp. 881\u2013890 (2007)"},{"issue":"1-2","key":"5_CR16","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. Theor. Comput. Sci.\u00a0270(1-2), 71\u2013109 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR17","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)"},{"key":"5_CR18","first-page":"505","volume":"6","author":"A. R\u00e9nyi","year":"1962","unstructured":"R\u00e9nyi, A.: On a problem in information theory. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl\u00a06, 505\u2013516 (1962)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl"},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/0022-0000(80)90014-8","volume":"20","author":"R.L. Rivest","year":"1980","unstructured":"Rivest, R.L., Meyer, A.R., Kleitman, D.J., Winklmann, K., Spencer, J.: Coping with errors in binary search procedures. J. Comput. Sys. Sci.\u00a020(3), 396\u2013405 (1980)","journal-title":"J. Comput. Sys. Sci."},{"key":"5_CR20","volume-title":"Fundamentals of Marketing Research","author":"S.M. Smith","year":"2005","unstructured":"Smith, S.M., Albaum, G.S.: Fundamentals of Marketing Research, 1st edn. Sage Publications, Thousand Oaks (2005)","edition":"1"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1037\/h0070288","volume":"34","author":"L.L. Thurstone","year":"1927","unstructured":"Thurstone, L.L.: A law of comparative judgment. Psychological Review\u00a034, 273\u2013286 (1927)","journal-title":"Psychological Review"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Ulam, S.M.: Adventures of a Mathematician. Scribner\u2019s, New York (1976)","DOI":"10.1063\/1.3024514"},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"L.G. Valiant","year":"1975","unstructured":"Valiant, L.G.: Parallelism in comparison problems. SIAM J. Comput.\u00a04(3), 348\u2013355 (1975)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR24","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1137\/0214009","volume":"14","author":"A.C. Yao","year":"1985","unstructured":"Yao, A.C., Yao, F.F.: On fault-tolerant networks for sorting. SIAM J. Comput.\u00a014(1), 120\u2013128 (1985)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02927-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T12:53:40Z","timestamp":1739192020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02927-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029264","9783642029271"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02927-1_5","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-02927-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}