The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On probabilistic networks for selection, merging, and sorting
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Lower bounds for sorting networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The asymptotic complexity of merging networks
Journal of the ACM (JACM)
Shifting Graphs and Their Applications
Journal of the ACM (JACM)
Lower bounds for merging networks
Information and Computation
Notes on merging networks (Prelimiary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Theoretical Computer Science
On Probabilistic Networks for Selection, Merging, and Sorting
Theory of Computing Systems
| Hi-index | 0.01 |
Let M(m, n) be the minimum number or comparators needed in an (m, n)-merging network. It is shown that M(m, n) ≥ n(lg(m + 1))/2, which implies that Batcher's merging networks are optimal up to a factor of 2 + &egr; for almost all values of m and n. The limit rm = limn→∞ M(m, n)/n is determined to within 1. It is also proved that M(2, n) = [3n/2].