{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:13:11Z","timestamp":1750219991705,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,17]]},"DOI":"10.1145\/3558481.3591076","type":"proceedings-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T22:22:03Z","timestamp":1685571723000},"page":"467-478","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-2252-0651","authenticated-orcid":false,"given":"Wentao","family":"Yang","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-4767-945X","authenticated-orcid":false,"given":"Vipul","family":"Harsh","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6480-9066","authenticated-orcid":false,"given":"Edgar","family":"Solomonik","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"Proceedings of the 15th annual ACM Symposium on Theory of computing","author":"Ajtai Mikl\u00f3s","year":"1983","unstructured":"Mikl\u00f3s Ajtai, J\u00e1nos Koml\u00f3s, and Endre Szemer\u00e9di. An O(n log n) sorting network. In Proceedings of the 15th annual ACM Symposium on Theory of computing, pages 1--9. ACM, 1983."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755595"},{"key":"e_1_3_2_1_3_1","volume-title":"Runs and scans with applications","author":"Balakrishnan Narayanaswamy","year":"2011","unstructured":"Narayanaswamy Balakrishnan and Markos V Koutras. Runs and scans with applications. John Wiley & Sons, 2011."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755604"},{"key":"e_1_3_2_1_6_1","first-page":"189","volume-title":"Harsha Vardhan Simhadri. In Proceedings of the Twenty-Second Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '10","author":"Blelloch Guy E.","year":"2010","unstructured":"Guy E. Blelloch, Phillip B. Gibbons, and Harsha Vardhan Simhadri. In Proceedings of the Twenty-Second Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '10, page 189--199, New York, NY, USA, 2010. Association for Computing Machinery."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810519"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000083"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1285358.1285359"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2974919"},{"key":"e_1_3_2_1_11_1","volume-title":"A novel parallel sorting algorithm for contemporary architectures","author":"Cheng David R.","year":"2007","unstructured":"David R. Cheng, Viral B. Shah, John R. Gilbert, and Alan Edelman. A novel parallel sorting algorithm for contemporary architectures, 2007."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"e_1_3_2_1_13_1","volume-title":"Samplesort: A sampling approach to minimal storage tree sorting. Journal of the ACM (JACM), 17(3):496--507","author":"Donald Frazer W","year":"1970","unstructured":"W Donald Frazer and AC McKellar. Samplesort: A sampling approach to minimal storage tree sorting. Journal of the ACM (JACM), 17(3):496--507, 1970."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/333115.333120"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755597"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323184"},{"key":"e_1_3_2_1_17_1","first-page":"1057","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Heckel Reinhard","year":"2018","unstructured":"Reinhard Heckel, Max Simchowitz, Kannan Ramchandran, and Martin Wainwright. Approximate ranking from pairwise comparisons. In International Conference on Artificial Intelligence and Statistics, pages 1057--1066. PMLR, 2018."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Laxmikant V Kale and Sanjeev Krishnan. A comparison based parallel sorting algorithm. In Proceedings of the International Conference on Parallel Processing Figure 3: Overview of the construction of the input distribution used in our proof as well as the connection between rounds of sampling\/histogramming and success runs. (ICPP) volume 3 pages 196--200. IEEE 1993.","DOI":"10.1109\/ICPP.1993.17"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.5009385"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(93)90019-H"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731825"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470406"},{"key":"e_1_3_2_1_24_1","first-page":"293","volume-title":"Proceedings of the 27th International ACM Conference on International Conference on Supercomputing, ICS '13","author":"Sundar Hari","year":"2013","unstructured":"Hari Sundar, Dhairya Malhotra, and George Biros. Hyksort: A new variant of hypercube quicksort on distributed memory architectures. In Proceedings of the 27th International ACM Conference on International Conference on Supercomputing, ICS '13, pages 293--302, New York, NY, USA, 2013. ACM."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"}],"event":{"name":"SPAA '23: 35th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Orlando FL USA","acronym":"SPAA '23"},"container-title":["Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591076","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:33Z","timestamp":1750182573000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":25,"alternative-id":["10.1145\/3558481.3591076","10.1145\/3558481"],"URL":"https:\/\/doi.org\/10.1145\/3558481.3591076","relation":{},"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"2023-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}