Tight Bounds on the Complexity of Parallel Sorting
Main Author: | Leighton, Tom |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149082 |
Similar Items
-
Tight Bounds for Minimax Grid Matching, with Applications to the Average Case Analysis of Algorithms
by: Leighton, Tom, et al.
Published: (2023) -
Tight bounds for parallel randomized load balancing
by: Lenzen, Christoph, et al.
Published: (2016) -
Optimal Bounds for Noisy Sorting
by: Gu, Yuzhou, et al.
Published: (2023) -
Tight bounds for the subspace sketch problem with applications
by: Li, Yi, et al.
Published: (2022) -
Tight Lower Bound for Linear Sketches of Moments
by: Andoni, Alexandr, et al.
Published: (2014)