Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Improved Compact Routing Scheme for Chordal Graphs
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Compact routing schemes with low stretch factor
Journal of Algorithms
Compact roundtrip routing with topology-independent node names
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
LAND: stretch (1 + ε) locality-aware networks for DHTs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Distance estimation and object location via rings of neighbors
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
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 compact and efficient routing in certain graph classes
Discrete Applied Mathematics
On compact routing for the internet
ACM SIGCOMM Computer Communication Review
Persistent personal names for globally connected mobile devices
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
Compact roundtrip routing with topology-independent node names
Journal of Computer and System Sciences
A compact routing architecture for mobility
Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture
A compact routing scheme with lower stretch
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
f-sensitivity distance Oracles and routing schemes
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Scalable routing on flat names
Proceedings of the 6th International COnference
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Fault-tolerant compact routing schemes for general graphs
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Improved compact routing schemes for power-law networks
NPC'11 Proceedings of the 8th IFIP international conference on Network and parallel computing
Navigating in a Graph by Aid of Its Spanning Tree Metric
SIAM Journal on Discrete Mathematics
On compact and efficient routing in certain graph classes
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Geometric routing without geometry
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Robust locality-aware lookup networks
Self-star Properties in Complex Information Systems
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
Fault-tolerant compact routing schemes for general graphs
Information and Computation
Compact routing schemes with improved stretch
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |