Fault tolerant planar communication networks

Authors:
Geng Lin
Affiliations:
Department of Computer Science, The University of British Columbia, Vancouver, British Columbia V6T 1Z2, Canada
Venue:
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Year:
1992

Configuration of VLSI Arrays in the Presence of Defects

Journal of the ACM (JACM)
Graphs & digraphs (2nd ed.)

Graphs & digraphs (2nd ed.)
Robust algorithms for packet routing in a mesh

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A tight lower bound on the size of planar permutation networks

SIGAL '90 Proceedings of the international symposium on Algorithms
Communication networks

Handbook of theoretical computer science (vol. A)
VLSI theory

Handbook of theoretical computer science (vol. A)
Algorithmic skeletons: a structured approach to the management of parallel computation

Algorithmic skeletons: a structured approach to the management of parallel computation

Fault-tolerant circuit-switching networks

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees

SIAM Journal on Discrete Mathematics

Hi-index	0.00