Sorting in c log n parallel steps
Combinatorica
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
A correction network for N-sorters
SIAM Journal on Computing
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
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Lower bounds for sorting networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
An O(nlogn)-size fault-tolerant sorting network (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Depth optimal sorting networks resistant to k passive faults
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Reliable Minimum Finding Comparator Networks
Fundamenta Informaticae
| Hi-index | 0.00 |