Tight Bounds on the Complexity of Parallel Sorting
Data up to Jan 2025
Total Citations Per Year
Abstract
References (23)
Sorting networks and their applications
1968 • 2,385 citations
Parallel Processing with the Perfect Shuffle
1971 • 1,265 citations
Computational aspects of VLSI
1985 • 957 citations
The Art of Computer Programming, Volume 3, Sorting and Searching
1974 • 676 citations
An 0(n log n) sorting network
1983 • 656 citations
Universal schemes for parallel communication
1981 • 644 citations
Area-time complexity for VLSI
1979 • 485 citations
Tight Bounds on the Complexity of Parallel Sorting
1985 • 377 citations
Notes on Shuffle/Exchange-Type Switching Networks
1980 • 220 citations
The VLSI Complexity of Sorting
1983 • 213 citations
New lower bound techniques for VLSI
1984 • 180 citations
Optimal Sorting Algorithms for Parallel Computers
1978 • 158 citations
Lower bounds for VLSI
1981 • 147 citations
Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks
2003 • 135 citations
Routing, merging and sorting on parallel models of computation
1982 • 133 citations
Parallel Communication With Limited Buffers
2005 • 79 citations
A logarithmic time sort for linear size networks
1983 • 57 citations
A Minimum Area VLSI Network for O(log n) Time Sorting
1985 • 49 citations
Sorting and Merging in Rounds
1982 • 34 citations
Parallel Computation Using Meshes of Trees.
1983 • 32 citations
An Architecture for Bitonic Sorting with Optimal VLSI Performnance
1984 • 24 citations
Minimum Storage Sorting Networks
1985 • 21 citations
The VLSI optimality of the aks sorting network
1985 • 16 citations