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
Tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
STOC '83 Proceedings of the fifteenth 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
Periodic, random-fault-tolerant correction networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Searching games with errors---fifty years of coping with liars
Theoretical Computer Science
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Fast periodic correction networks
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Reliable Minimum Finding Comparator Networks
Fundamenta Informaticae
| Hi-index | 0.00 |