An optimal parallel algorithm for sorting multisets
From MaRDI portal
Recommendations
Cites work
Cited in
(12)- Parallel algorithms for partitioning sorted sets and related problems
- Parallel algorithms for evaluating sequences of set-manipulation operations
- Towards optimal parallel bucket sorting
- Constant time parallel sorting: An empirical view.
- scientific article; zbMATH DE number 177571 (Why is no real title available?)
- scientific article; zbMATH DE number 4031004 (Why is no real title available?)
- Optimal parallel randomized renaming
- A note on adaptive parallel sorting
- scientific article; zbMATH DE number 4060711 (Why is no real title available?)
- Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention
- Sorting multisets stably in minimum space
- An efficient parallel algorithm for multiselection
This page was built for publication: An optimal parallel algorithm for sorting multisets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293338)