Communications of the ACM - Special section on computer architecture
The connection machine
Parallel hashing—an efficient implementation of shared memory
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Communication effect basic linear algebra computations on hypercube architectures
Journal of Parallel and Distributed Computing
Optimal simulations by Butterfly Networks
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Universal graphs for bounded-degree trees and planar graphs
SIAM Journal on Discrete Mathematics
Embedding of d-dimensional grids into optimal hypercubes
SPAA '89 Proceedings of the first 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
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Coding theory, hypercube embeddings, and fault tolerance
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Embedding leveled hypercube algorithms into hypercubes (extended abstract)
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
| Hi-index | 0.00 |