A VLSI algorithm for sorting variable-length character strings
From MaRDI portal
Publication:1079374
DOI10.1007/BF03037124zbMath0597.68050MaRDI QIDQ1079374
Publication date: 1985
Published in: New Generation Computing (Search for Journal in Brave)
parallel processingcharacter string processingpipelined heap sort algorithmsorting hardware moduleVLSI archictecture
Cites Work
- Bounds to Complexities of Networks for Sorting and for Switching
- Sorting on a mesh-connected parallel computer
- Optimal Sorting Algorithms for Parallel Computers
- New Parallel-Sorting Schemes
- Algorithm and Hardware for a Merge Sort Using Multiple Processors
- Fast parallel sorting algorithms
- Bitonic Sort on a Mesh-Connected Parallel Computer
- Parallel Processing with the Perfect Shuffle
This page was built for publication: A VLSI algorithm for sorting variable-length character strings
