The Computer Journal
A tradeoff between space and efficiency for routing tables
STOC '88 Proceedings of the twentieth 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
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
CONPAR 94 - VAPP VI Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing
On Multi-Label Linear Interval Routing Schemes (Extended Abstract)
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Local memory requirement of universal routing schemes
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Interval routing schemes allow broadcasting with linear message-complexity (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
Routing in distributed networks: overview and open problems
ACM SIGACT News
Compact Routing in Directed Networks with Stretch Factor of Two
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
Improved Compact Routing Scheme for Chordal Graphs
DISC '02 Proceedings of the 16th International Conference on Distributed 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,
Compact routing schemes with low stretch factor
Journal of Algorithms
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
A Memory-Effective Routing Strategy for Regular Interconnection Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
On space-stretch trade-offs: lower bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Average stretch analysis of compact routing schemes
Discrete Applied Mathematics
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
On compact routing for the internet
ACM SIGCOMM Computer Communication Review
A compact routing architecture for mobility
Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Compact routing in power-law graphs
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Simulating Routing Schemes on Large-Scale Topologies
PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
Navigating in a Graph by Aid of Its Spanning Tree Metric
SIAM Journal on Discrete Mathematics
Distributed routing in tree networks with few landmarks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
On compact and efficient routing in certain graph classes
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Distributed computing of efficient routing schemes in generalized chordal graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Distributed computing of efficient routing schemes in generalized chordal graphs
Theoretical Computer Science
ACM SIGMETRICS Performance Evaluation Review
A compact routing scheme and approximate distance oracle for power-law graphs
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |