Sorting in c log n parallel steps
Combinatorica
Handbook of theoretical computer science (vol. A)
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Highly fault-tolerant sorting circuits
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
SIAM Journal on Computing
A hypercubic sorting network with nearly logarithmic depth
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Lower bounds for merging on the hypercube
CIAC '94 Proceedings of the second Italian conference on Algorithms and complexity
Fault-tolerant sorting networks
Fault-tolerant sorting networks
Lower bounds for sorting networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Shifting Graphs and Their Applications
Journal of the ACM (JACM)
Lower Bounds on Merging Networks
Journal of the ACM (JACM)
Selection Networks with 8n log2n Size and O(log n) Depth
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
A Probabilistic Selection Network with Butterfly Networks
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Lower bounds for merging networks
Information and Computation
Bureaucratic protocols for secure two-party sorting, selection, and permuting
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
| Hi-index | 0.00 |