{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:12Z","timestamp":1759639092347,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_7","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"70-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of\u00a0Approximate Sorting in\u00a0I\/O Model"],"prefix":"10.1007","author":[{"given":"Tianpeng","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"9","key":"7_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988). https:\/\/doi.org\/10.1145\/48529.48535","journal-title":"Commun. ACM"},{"key":"7_CR2","unstructured":"Disser, Y., Kratsch, S.: Robust and adaptive search (2017). http:\/\/arxiv.org\/abs\/1702.05932"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(93)90175-N","volume":"42","author":"V Estivill-Castro","year":"1993","unstructured":"Estivill-Castro, V., Mannila, H., Wood, D.: Right invariant metrics and measures of presortedness. Discret. Appl. Math. 42, 1\u201316 (1993). https:\/\/doi.org\/10.1016\/0166-218X(93)90175-N","journal-title":"Discret. Appl. Math."},{"key":"7_CR4","unstructured":"Farnoud, F., Schwartz, M., Bruck, J.: Rate-distortion for ranking with incomplete information (2014). http:\/\/arxiv.org\/abs\/1401.3093"},{"issue":"4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1007\/s10878-015-9930-6","volume":"32","author":"F Farnoud","year":"2015","unstructured":"Farnoud, F., Yaakobi, E., Bruck, J.: Approximate sorting of data streams with limited storage. J. Comb. Optim. 32(4), 1133\u20131164 (2015). https:\/\/doi.org\/10.1007\/s10878-015-9930-6","journal-title":"J. Comb. Optim."},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Gao, T., Li, J.: Analysis of approximate sorting in I\/O model (2022). https:\/\/doi.org\/10.48550\/ARXIV.2208.10298","DOI":"10.48550\/ARXIV.2208.10298"},{"issue":"1\u20132","key":"7_CR7","first-page":"67","volume":"90","author":"J Giesen","year":"2009","unstructured":"Giesen, J., Schuberth, E., Stojakovi\u0107, M.: Approximate sorting. Fundam. Inf. 90(1\u20132), 67\u201372 (2009)","journal-title":"Fundam. Inf."},{"issue":"6","key":"7_CR8","doi-asserted-by":"publisher","first-page":"2611","DOI":"10.1109\/TIT.2010.2046212","volume":"56","author":"T Klove","year":"2010","unstructured":"Klove, T., Lin, T.T., Tsai, S.C., Tzeng, W.G.: Permutation arrays under the Chebyshev distance. IEEE Trans. Inf. Theory 56(6), 2611\u20132617 (2010). https:\/\/doi.org\/10.1109\/TIT.2010.2046212","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR9","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 3, 2nd edn. Sorting and Searching. Addison Wesley Longman Publishing Co., Inc. (1998)"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Wang, D., Mazumdar, A., Wornell, G.W.: A rate-distortion theory for permutation spaces. In: 2013 IEEE International Symposium on Information Theory, pp. 2562\u20132566 (2013). https:\/\/doi.org\/10.1109\/ISIT.2013.6620689","DOI":"10.1109\/ISIT.2013.6620689"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.tcs.2020.07.026","volume":"838","author":"X Gao","year":"2020","unstructured":"Gao, X., Li, J., Miao, D., Liu, X.: Recognizing the tractability in big data computing. Theor. Comput. Sci. 838, 195\u2013207 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.07.026","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:03:35Z","timestamp":1680213815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"39","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":"12","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":"39% - 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","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":"5","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)"}}]}}