학술논문
Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting
Document Type
Conference Paper
Author
Source
In: Annual ACM Symposium on Parallelism in Algorithms and Architectures , SPAA 2023 - Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. (Annual ACM Symposium on Parallelism in Algorithms and Architectures, 17 June 2023, :467-478)
Subject
Language
English