Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
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
Name independent routing for growth bounded networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On space-stretch trade-offs: lower bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
On space-stretch trade-offs: upper bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Name-independent compact routing in trees
Information Processing Letters
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Compact roundtrip routing with topology-independent node names
Journal of Computer and System Sciences
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.00 |