Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Fault-tolerant routing in hypercubes using masked interval routing scheme
Proceedings of the 1999 ACM symposium on Applied computing
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Static and dynamic low-congested interval routing schemes
Theoretical Computer Science
The complexity of the characterization of networks supporting shortest-path interval routing
Theoretical Computer Science
Efficient Communication Schemes
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
On the hardness of minimizing space for all-shortest-path interval routing schemes
Theoretical Computer Science
Ordered interval routing schemes
Journal of Discrete Algorithms
| Hi-index | 0.00 |