The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Notes on merging networks (Prelimiary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
The new class of g-chain periodic sorters
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Topologies of Combined (2logN - 1)-Stage Interconnection Networks
IEEE Transactions on Computers
Fault Tolerance in a Class of Sorting Networks
IEEE Transactions on Computers
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
Permuting streaming data using RAMs
Journal of the ACM (JACM)
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
| Hi-index | 14.99 |
A class of comparator networks obtained from the omega permutation network by replacing each switch with a comparator exchanger of arbitrary direction is considered. These networks are all isomorphic to each other, have merging capabilities, and can be used as building blocks of sorting networks in ways different from the standard merge-sort scheme. It is shown that the bitonic and balanced mergers are members of the class. These two networks were not previously known to be isomorphic.