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
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
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
The slide mechanism with applications in dynamic networks
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Bubbles: adaptive routing scheme for high-speed dynamic networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Journal of Algorithms
Log-Space Polynomial End-to-End Communication
SIAM Journal on Computing
Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
SIAM Journal on Computing
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Sparse communication networks and efficient routing in the plane (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Membership in Constant Time and Almost-Minimum Space
SIAM Journal on Computing
Theoretical Computer Science
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Complexity of Interval Routing on Random Graphs
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
The Compactness of Interval Routing for Almost All Graphs
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Succinct representation of balanced parentheses, static trees and planar graphs
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Distributed object location in a dynamic network
Proceedings of the fourteenth 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
A Space Lower Bound for Routing in Trees
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
An Additive Stretched Routing Scheme for Chordal Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
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
An optimal broadcasting schema for multidimensional mesh structures
Proceedings of the 2003 ACM symposium on Applied computing
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Compact routing on euclidian metrics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
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 hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Name independent routing for growth bounded networks
Proceedings of the seventeenth 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
FIR: an efficient routing strategy for tori and meshes
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
An IP packet forwarding technique based on a new structure of lookup table
International Journal of Computers and Applications
Interval routing in reliability networks
Theoretical Computer Science - Foundations of software science and computation structures
The workshop on internet topology (wit) report
ACM SIGCOMM Computer Communication Review
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Compact routing with slack in low doubling dimension
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Optimal scale-free compact routing schemes in networks of low doubling dimension
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Minimal broadcasting schemas for the mesh structures
International Journal of High Performance Computing and Networking
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
Hierarchical routing over dynamic wireless networks
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Information theoretic analysis of proactive routing overhead in mobile ad hoc networks
IEEE Transactions on Information Theory
Robust data location infrastructure in distributed collaborative environment
CSCWD'06 Proceedings of the 10th international conference on Computer supported cooperative work in design III
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Navigating in a Graph by Aid of Its Spanning Tree Metric
SIAM Journal on Discrete Mathematics
Dynamic routing schemes for general graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
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
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
IEEE/ACM Transactions on Networking (TON)
k-Dense communities in the Internet AS-level topology graph
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Navigation Algorithm Inspired by Human Navigation
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
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.06 |