Performance evaluation of probabilistic tree embedding in cube-connected cycles

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving

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

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

On dynamic tree growing in hypercubes

SAC '97 Proceedings of the 1997 ACM symposium on Applied computing

The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM

Introduction to Algorithms: A Creative Approach

Introduction to Algorithms: A Creative Approach

Advanced Computer Architecture: Parallelism,Scalability,Programmability

Advanced Computer Architecture: Parallelism,Scalability,Programmability

Determining the Expected Load of Dynamic Tree Embeddings in Hypercubes

ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)