Wentao Yang, Vipul Harsh, Edgar Solomonik. Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting. In Kunal Agrawal, Julian Shun, editors, Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023, Orlando, FL, USA, June 17-19, 2023. pages 467-478, ACM, 2023. [doi]
Abstract is missing.