Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fault tolerant planar communication networks
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fault-tolerant circuit-switching networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast parallel matching in expander graphs
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Optimal parallel string algorithms: sorting, merging and computing the minimum
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On probabilistic networks for selection, merging, and sorting
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Lower bounds for sorting networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
More on the complexity of negation-limited circuits
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
Construction of asymmetric connectors of depth two
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Reductions for monotone Boolean circuits
Theoretical Computer Science
Rearrangeable and nonblocking [w, f] -distributors
IEEE/ACM Transactions on Networking (TON)
Interactive Communication, Diagnosis and Error Control in Networks
Algorithmics of Large and Complex Networks
On Probabilistic Networks for Selection, Merging, and Sorting
Theory of Computing Systems
Hi-index | 0.00 |