Robust algorithms for packet routing in a mesh
Author:
- 1 January 1995
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 28 (1) , 1-11
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fast Computation Using Faulty Hypercubes1989
- An O(logN) deterministic packet routing scheme1989
- Expanders might be practical: fast algorithms for routing around faults on multibutterflies1989
- Reconfiguring a hypercube in the presence of faults1987
- Universal schemes for parallel communication1981
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952