{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T04:09:21Z","timestamp":1768709361702,"version":"3.49.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031389054","type":"print"},{"value":"9783031389061","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-38906-1_32","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"493-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["External-Memory Sorting with\u00a0Comparison Errors"],"prefix":"10.1007","author":[{"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[]},{"given":"Evrim","family":"Ozel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Bender, M., Demaine, E., Farach-Colton, M.: Cache-oblivious B-trees. In: 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 399\u2013409 (2000)","DOI":"10.1109\/SFCS.2000.892128"},{"key":"32_CR2","unstructured":"Braverman, M., Mossel, E.: Noisy sorting without resampling. In: 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 268\u2013276 (2008)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-45465-9_37","volume-title":"Automata, Languages and Programming","author":"GS Brodal","year":"2002","unstructured":"Brodal, G.S., Fagerberg, R.: Cache oblivious distribution sweeping. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 426\u2013438. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_37"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1227161.1227164","volume":"12","author":"GS Brodal","year":"2008","unstructured":"Brodal, G.S., Fagerberg, R., Vinther, K.: Engineering a cache-oblivious sorting algorithm. ACM J. Exp. Algorithmics 12, 1\u201323 (2008). https:\/\/doi.org\/10.1145\/1227161.1227164","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"5","key":"32_CR5","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1137\/S0097539791195877","volume":"23","author":"U Feige","year":"1994","unstructured":"Feige, U., Raghavan, P., Peleg, D., Upfal, E.: Computing with noisy information. SIAM J. Comput. 23(5), 1001\u20131018 (1994)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"32_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2071379.2071383","volume":"8","author":"M Frigo","year":"2012","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. ACM Trans. Algorithms 8(1), 1\u201322 (2012). https:\/\/doi.org\/10.1145\/2071379.2071383","journal-title":"ACM Trans. Algorithms"},{"key":"32_CR7","unstructured":"Geissmann, B., Leucci, S., Liu, C.H., Penna, P.: Sorting with recurrent comparison errors. In: Okamoto, Y., Tokuyama, T. (eds.) 28th International Symposium on Algorithms and Computation (ISAAC). LIPIcs, vol. 92, pp. 38:1\u201338:12 (2017)"},{"key":"32_CR8","unstructured":"Geissmann, B., Leucci, S., Liu, C.H., Penna, P.: Optimal sorting with persistent comparison errors. In: Bender, M.A., Svensson, O., Herman, G. (eds.) 27th European Symposium on Algorithms (ESA). LIPIcs, vol. 144, pp. 49:1\u201349:14 (2019)"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Geissmann, B., Leucci, S., Liu, C.H., Penna, P.: Optimal dislocation with persistent errors in subquadratic time. Theory Comput. Syst. 64(3), 508\u2013521 (2020). This work appeared in preliminary form in STACS 2018","DOI":"10.1007\/s00224-019-09957-5"},{"key":"32_CR10","doi-asserted-by":"publisher","unstructured":"Gilotte, A., Calauz\u00e8nes, C., Nedelec, T., Abraham, A., Doll\u00e9, S.: Offline A\/B testing for recommender systems. In: Eleventh ACM International Conference on Web Search and Data Mining (WSDM), pp. 198\u2013206. New York (2018). https:\/\/doi.org\/10.1145\/3159652.3159687","DOI":"10.1145\/3159652.3159687"},{"key":"32_CR11","unstructured":"Karp, R.M., Kleinberg, R.: Noisy binary search and its applications. In: 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 881\u2013890 (2007)"},{"issue":"3","key":"32_CR12","doi-asserted-by":"publisher","first-page":"377","DOI":"10.3390\/math10030377","volume":"10","author":"K Khadiev","year":"2022","unstructured":"Khadiev, K., Ilikaev, A., Vihrovs, J.: Quantum algorithms for some strings problems based on quantum string comparator. Mathematics 10(3), 377 (2022)","journal-title":"Mathematics"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/978-3-642-23719-5_62","volume-title":"Algorithms \u2013 ESA 2011","author":"R Klein","year":"2011","unstructured":"Klein, R., Penninger, R., Sohler, C., Woodruff, D.P.: Tolerant algorithms. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 736\u2013747. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23719-5_62"},{"issue":"2","key":"32_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1006\/jcss.1997.1470","volume":"54","author":"T Leighton","year":"1997","unstructured":"Leighton, T., Ma, Y., Plaxton, C.G.: Breaking the $$\\Theta (n\\log ^2 n)$$ barrier for sorting with faults. J. Comput. Syst. Sci. 54(2), 265\u2013304 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"32_CR15","unstructured":"Mao, C., Weed, J., Rigollet, P.: Minimax rates and efficient algorithms for noisy sorting. In: Janoos, F., Mohri, M., Sridharan, K. (eds.) Proceedings of Algorithmic Learning Theory. Proceedings of Machine Learning Research, vol. 83, pp. 821\u2013847 (2018)"},{"issue":"2","key":"32_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0304-3975(89)90077-7","volume":"63","author":"A Pelc","year":"1989","unstructured":"Pelc, A.: Searching with known error probability. Theor. Comput. Sci. 63(2), 185\u2013202 (1989)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"32_CR17","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\u2013fifty years of coping with liars. Theor. Comput. Sci. 270(1), 71\u2013109 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR18","unstructured":"R\u00e9nyi, A.: On a problem in information theory. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 6, 505\u2013516 (1961). https:\/\/mathscinet.ams.org\/mathscinet-getitem?mr=0143666"},{"issue":"2","key":"32_CR19","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"JS Vitter","year":"2001","unstructured":"Vitter, J.S.: External memory algorithms and data structures: dealing with massive data. ACM Comput. Surv. 33(2), 209\u2013271 (2001)","journal-title":"ACM Comput. Surv."},{"key":"32_CR20","doi-asserted-by":"publisher","unstructured":"Wang, J., Huang, P., Zhao, H., Zhang, Z., Zhao, B., Lee, D.L.: Billion-scale commodity embedding for e-commerce recommendation in Alibaba. In: 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 839\u2013848. Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3219819.3219869","DOI":"10.1145\/3219819.3219869"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Wang, Z., Ghaddar, N., Wang, L.: Noisy sorting capacity. arXiv abs\/2202.01446 (2022)","DOI":"10.1109\/ISIT50566.2022.9834370"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Xu, Y., Chen, N., Fernandez, A., Sinno, O., Bhasin, A.: From infrastructure to culture: A\/B testing challenges in large scale social networks. In: 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 2227\u20132236 (2015)","DOI":"10.1145\/2783258.2788602"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38906-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T05:03:59Z","timestamp":1729832639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}