Disjoint paths through a 3-dimensional grid

Authors:
M. Brady;D. Brown;P. McGuinness
Affiliations:
Lockheed R&D Div., O-9740 / B-202, 3251 Hanover St., Palo Alto, CA;Coordinated Science Laboratory, University of Illinois, 1101 W. Springfield Ave., Urbana, IL;Beckman Institute, University of Illinois, 405 N. Matthews Ave., Urbana, IL
Venue:
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Year:
1990

Citing 3
Cited 1

Routing and sorting on mesh-connected arrays (extended abstract)

VLSI Algorithms and Architectures
A 2n-2 step algorithm for routing in an nxn array with constant size queues

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Nearly optimal algorithms and bounds for multilayer channel routing

Journal of the ACM (JACM)

Decomposing a permutation into a conjugated tensor product

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract