An optimal synchronizer for the hypercube
SIAM Journal on Computing
Dynamic tree embeddings in butterflies and hypercubes
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Fast computation using faulty hypercubes
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Running algorithms efficiently on faulty hypercubes
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Routing multiple paths in hypercubes
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Fast algorithms for bit-serial routing on a hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Tight bounds for on-line tree embeddings
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Robust bounded-degree networks with small diameters
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Competitive fault-tolerance in area-universal networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Tolerating Faults in Hypercubes Using Subcube Partitioning
IEEE Transactions on Computers - Special issue on fault-tolerant computing
New graph decompositions and fast emulations in hypercubes and butterflies
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Approximate load balancing on dynamic and asynchronous networks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Construction of the mesh and the torus tolerating a large number of faults
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
On the fault tolerance of the butterfly
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient Determination of Maximum Incomplete Subcubes in Hypercubes with Faults
IEEE Transactions on Computers
Performance evaluation of probabilistic tree embedding in cube-connected cycles
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Maintenance of tree structured computations on parallel and distributed computer systems
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
On dynamic tree growing in hypercubes
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Deterministic parallel backtrack search
Theoretical Computer Science
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
IEEE Transactions on Computers
Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes
IEEE Transactions on Computers
Free Dimensions-An Effective Approach to Achieving Fault Tolerance in Hypercubes
IEEE Transactions on Computers
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Load Balancing on Networks with Dynamically Changing Topology
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Sparse hypercube: a minimal k-line broadcast graph
Discrete Applied Mathematics
Asymptotically Optimal Randomized Tree Embedding in Static Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
On the performance of randomized embedding of reproduction trees in static networks
International Journal of Parallel Programming
Analysis of randomized load distribution for reproduction trees in linear arrays and rings
Theoretical Computer Science
Rapidly Mixing Random Walks on Hypercubes with Application to Dynamic Tree Evolution
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
Synchronous distributed load balancing on dynamic networks
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.01 |