The VLSI Complexity of Sorting
From MaRDI portal
Publication:3036700
DOI10.1109/TC.1983.1676178zbMath0524.68025MaRDI QIDQ3036700
Publication date: 1983
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
sorting; parallel algorithms; VLSI; area-time complexity; heapsort; bubble sort; mesh-connected computers; bitonic sort; shuffle exchange network
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68W99: Algorithms in computer science
Related Items
A parallel-design distributed-implementation (PDDI) general-purpose computer, Finding Euler tours in parallel, Constant time sorting on a processor array with a reconfigurable bus system, The foundation of self-developing blob machines for spatial computing, Improving the average delay of sorting, Area-time lower-bound techniques with applications to sorting, A minimum-area circuit for \(\ell\)-selection, Parallel ear decomposition search (EDS) and st-numbering in graphs, Fault-tolerance VLSI sorters, Time lower bounds for parallel sorting on a mesh-connected processor array, VLSI-sorting evaluated under the linear model, Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors, Functional inversion and communication complexity, Parallel integer sorting using small operations, New lower bound techniques for VLSI
