Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Compact routing with name independence
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Brief announcement: name-independent compact routing in trees
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On space-stretch trade-offs: upper bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Improved compact routing schemes for power-law networks
NPC'11 Proceedings of the 8th IFIP international conference on Network and parallel computing
HDLBR: A name-independent compact routing scheme for power-law networks
Computer Communications
| Hi-index | 0.89 |