A heuristic explanation of Batcher's baffler
Science of Computer Programming
Sorting in c log n parallel steps
Combinatorica
A correction network for N-sorters
SIAM Journal on Computing
The periodic balanced sorting network
Journal of the ACM (JACM)
Better understanding of Batcher's merging networks
Discrete Applied Mathematics
Information Processing Letters
A Multiway Merge Sorting Network
IEEE Transactions on Parallel and Distributed Systems
Parallel computation: models and methods
Parallel computation: models and methods
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The new class of g-chain periodic sorters
Journal of Parallel and Distributed Computing
Theoretical Computer Science
Periodification scheme: constructing sorting networks with constant period
Journal of the ACM (JACM)
Introduction to algorithms
The Generalized Class of g-Chaln Periodic Sorting Networks
Proceedings of the 8th International Symposium on Parallel Processing
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Depth Optimal Sorting Networks Resistant to k Passive Faults
SIAM Journal on Computing
Measures of Presortedness and Optimal Sorting Algorithms
IEEE Transactions on Computers
Bitonic sorters of minimal depth
Theoretical Computer Science
| Hi-index | 0.00 |
Lee and Batcher have designed networks that efficiently merge k separately provided sorted sequences of known lengths totalling n. We show that the design is still possible, and in fact easier to describe, if we do not make use of the lengths, or even the directions of monotonicity, of the individual sequences-the sequences can be provided in a single undelimited concatenation of length n. The depth of the simplest resulting network to sort sequences that are ''k-tonic'' and of length n is (1+@?log"2k@?)@?log"2n@?=O((logk)(logn)), generalizing Batcher's 1968 results for the extreme values of k (k=2 corresponding to merging, and k=@?n/2@? corresponding to general sorting). The exposition is self-contained and can serve even as an introduction to sorting networks and Batcher's results.