More Efficient Parallel Integer Sorting

DOI10.1142/s0129054122500071zbMath1518.68081OpenAlexW4220877899MaRDI QIDQ6114876

Yijie Han, Xin He

Publication date: 15 August 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054122500071

zbMATH Keywords

design of algorithmsPRAM algorithmsinteger sortingbucket sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On parallel integer sorting
• Deterministic parallel list ranking
• Sorting in \(c \log n\) parallel steps
• Improved parallel integer sorting without concurrent writing
• Improved fast integer sorting in linear space
• Tight Bounds on the Complexity of Parallel Sorting
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• Parallel Symmetry-Breaking in Sparse Graphs
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
• Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs
• Deterministic sorting in O(nloglogn) time and linear space

This page was built for publication: More Efficient Parallel Integer Sorting