Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Embedding trees in a hypercube is NP-complete
SIAM Journal on Computing
Optimal speedup for backtrack search on a butterfly network
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Coding theory, hypercube embeddings, and fault tolerance
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Tight bounds for on-line tree embeddings
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Efficient embeddings of trees in hypercubes
SIAM Journal on Computing
Dynamic tree embeddings in butterflies and hypercubes
SIAM Journal on Computing
Taking random walks to grow trees in hypercubes
Journal of the ACM (JACM)
Randomized parallel algorithms for backtrack search and branch-and-bound computation
Journal of the ACM (JACM)
Maintenance of tree structured computations on parallel and distributed computer systems
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Performance evaluation of probabilistic tree embedding in cube-connected cycles
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Asymptotically Optimal Randomized Tree Embedding in Static Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Hi-index | 0.00 |