Notes on sorting and counting networks (extended abstract)
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 234-248
- https://doi.org/10.1007/3-540-57271-6_39
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The new class of g-chain periodic sortersPublished by Association for Computing Machinery (ACM) ,1993
- Contention in shared memory algorithmsPublished by Association for Computing Machinery (ACM) ,1993
- Low contention load balancing on large-scale multiprocessorsPublished by Association for Computing Machinery (ACM) ,1992
- Small-depth counting networksPublished by Association for Computing Machinery (ACM) ,1992
- Halvers and expanders (switching)Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Counting networks and multi-processor coordinationPublished by Association for Computing Machinery (ACM) ,1991
- The periodic balanced sorting networkJournal of the ACM, 1989
- A new parallel sorting algorithm based upon min-mid-max operationsBIT Numerical Mathematics, 1984