{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T19:47:58Z","timestamp":1767642478774,"version":"3.48.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032156204","type":"print"},{"value":"9783032156211","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-15621-1_9","type":"book-chapter","created":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T16:38:05Z","timestamp":1767631085000},"page":"100-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic Integer Sorting on\u00a0the\u00a0Parallel External Memory Model"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-8813-1911","authenticated-orcid":false,"given":"Ranajit","family":"Senko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5412-5525","authenticated-orcid":false,"given":"G.","family":"Sajith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,6]]},"reference":[{"issue":"6","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1137\/S0097539799352449","volume":"31","author":"Y Han","year":"2002","unstructured":"Han, Y., He, X.: Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs. SIAM J. Comput. 31(6), 1852\u20131878 (2002)","journal-title":"SIAM J. Comput."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-29700-7_26","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"Y Han","year":"2012","unstructured":"Han, Y., He, X.: More efficient parallel integer sorting. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM\/FAW -2012. LNCS, vol. 7285, pp. 279\u2013290. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29700-7_26"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"ML Fredman","year":"1993","unstructured":"Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci. 47(3), 424\u2013436 (1993)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M Ajtai","year":"1983","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: Sorting in $$c\\log n$$ parallel steps. Combinatorica 3(1), 1\u201319 (1983)","journal-title":"Combinatorica"},{"issue":"7","key":"9_CR5","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s002360050061","volume":"33","author":"S Saxena","year":"1996","unstructured":"Saxena, S.: Parallel integer sorting and simulation amongst CRCW models. Acta Inf. 33(7), 607\u2013619 (1996)","journal-title":"Acta Inf."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time? In: Proceedings of 27th ACM Symposium on Theory of Computing (STOC), pp. 67\u201374. ACM, New York (1995)","DOI":"10.1145\/225058.225173"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1006\/inco.1997.2632","volume":"136","author":"S Albers","year":"1997","unstructured":"Albers, S., Hagerup, T.: Improved parallel integer sorting without concurrent writing. Inf. Comput. 136(1), 25\u201351 (1997)","journal-title":"Inf. Comput."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Arge, L., Goodrich, M.T., Nelson, M., Sitchinava, N.: Fundamental parallel algorithms for private-cache chip multiprocessors. In: Proceedings of 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1378533.1378573"},{"issue":"9","key":"9_CR9","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)","journal-title":"Commun. ACM"},{"key":"9_CR10","unstructured":"Sajith, G.: Parallel algorithms for multiway merging, sorting and graph colouring. Ph.D. thesis, IIT Kanpur (1997)"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/65950.65958","volume":"36","author":"PW Beame","year":"1989","unstructured":"Beame, P.W., H\u00e5stad, J.: Optimal bounds for decision problems on the CRCW PRAM. J. ACM 36(3), 643\u2013670 (1989)","journal-title":"J. ACM"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1137\/0215006","volume":"15","author":"SA Cook","year":"1986","unstructured":"Cook, S.A., Dwork, C., Reischuk, R.: Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput. 15(1), 87\u201397 (1986)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1006\/inco.2001.3053","volume":"170","author":"Y Han","year":"2001","unstructured":"Han, Y.: Improved fast integer sorting in linear space. Inf. Comput. 170(1), 81\u201394 (2001)","journal-title":"Inf. Comput."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-46541-3_20","volume-title":"STACS 2000","author":"Y Han","year":"2000","unstructured":"Han, Y.: Fast integer sorting in linear space. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 242\u2013253. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46541-3_20"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.jalgor.2003.09.001","volume":"50","author":"Y Han","year":"2004","unstructured":"Han, Y.: Deterministic sorting in $$O(n\\log \\log n)$$ time and linear space. J. Algorithms 50(1), 96\u2013105 (2004)","journal-title":"J. Algorithms"},{"key":"9_CR16","unstructured":"Thorup, M.: Faster deterministic sorting and priority queues in linear space. In: Proceedings of 9th ACM\u2013SIAM Symposium on Discrete Algorithms (SODA), pp. 550\u2013555. ACM\/SIAM (1998)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-46541-3_20","volume-title":"STACS 2000","author":"Y Han","year":"2000","unstructured":"Han, Y.: Fast integer sorting in linear space. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 242\u2013253. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46541-3_20"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Farhadi, A., Hajiaghayi, M.T., Larsen, K.G., Shi, E.: Lower bounds for external memory integer sorting via network coding. In: Proceedings of 51st ACM Symposium on Theory of Computing (STOC), pp. 997\u20131008 (2019)","DOI":"10.1145\/3313276.3316337"}],"container-title":["Lecture Notes in Computer Science","Applied Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15621-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T16:38:09Z","timestamp":1767631089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15621-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032156204","9783032156211"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15621-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"6 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 January 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 January 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icaa2026.framer.website\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}