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
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
Periodic, random-fault-tolerant correction networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Fast periodic correction networks
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Research note: Networks for sorting multitonic sequences
Journal of Parallel and Distributed Computing
Bitonic sorters of minimal depth
Theoretical Computer Science
| Hi-index | 0.00 |