A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Efficient message routing in planar networks
SIAM Journal on Computing
Space-efficient message routing in c-decomposable networks
SIAM Journal on Computing
Improved routing strategies with succinct tables
Journal of Algorithms
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
Worst case bounds for shortest path interval routing
Journal of Algorithms
On the Dilation of Interval Routing
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Multi-Dimensional Interval Routing Schemes
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
A Lower Bound for Linear Interval Routing
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
The Complexity of Shortest Path and Dilation Bounded Interval Routing
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Compact roundtrip routing in directed networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Routing in distributed networks: overview and open problems
ACM SIGACT News
The complexity of the characterization of networks supporting shortest-path interval routing
Theoretical Computer Science
Compact Routing in Directed Networks with Stretch Factor of Two
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
Compact Routing Tables for Graphs of Bounded Genus
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Space Lower Bound for Routing in Trees
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of 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
Compact routing with name independence
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Compact roundtrip routing with topology-independent node names
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Proceedings of the 1st international conference on Embedded networked sensor systems
The compactness of adaptive routing tables
Journal of Discrete Algorithms
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Compact roundtrip routing in directed networks
Journal of Algorithms
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Spanners and emulators with sublinear distance errors
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Compact roundtrip routing with topology-independent node names
Journal of Computer and System Sciences
Note: A note on models for graph representations
Theoretical Computer Science
Improved compact routing schemes for power-law networks
NPC'11 Proceedings of the 8th IFIP international conference on Network and parallel computing
Distributed addressing and routing architecture for internet overlays
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
HDLBR: A name-independent compact routing scheme for power-law networks
Computer Communications
Trap array: a unified model for scalability evaluation of geometric routing
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
| Hi-index | 0.00 |