Parallel integer sorting using small operations

DOI10.1007/BF01185406zbMath0819.68045OpenAlexW4254441892MaRDI QIDQ1346223

Carlos R. P. Hartmann, Pramod K. Varshney, Ramachandran Vaidyanathan

Publication date: 22 March 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01185406

zbMATH Keywords

sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Related Items (1)

RANDOMIZED SORTING ON THE POPS NETWORK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On parallel integer sorting
• Sorting in \(c \log n\) parallel steps
• Towards optimal parallel bucket sorting
• Improved deterministic parallel integer sorting
• Sorting on PRAMs with reconfigurable buses
• Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors
• The VLSI Complexity of Sorting
• Tight Bounds on the Complexity of Parallel Sorting
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• Parallel Merge Sort
• On parallel hashing and integer sorting
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms

This page was built for publication: Parallel integer sorting using small operations