Concurrent online tracking of mobile users
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Competitive distributed job scheduling (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Fast randomized algorithms for distributed edge coloring
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The virtual path layout problem in fast networks (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Online tracking of mobile users
Journal of the ACM (JACM)
Bubbles: adaptive routing scheme for high-speed dynamic networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Local memory requirement of universal routing schemes
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
The layout of virtual paths in ATM networks
IEEE/ACM Transactions on Networking (TON)
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Compact roundtrip routing for digraphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Sparse communication networks and efficient routing in the plane (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
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
A data tracking scheme for general networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
Constructing the Spanners of Graphs in Parallel
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
The Average Hop Count Measure for Virtual Path Layouts
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
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
Proximity-Preserving Labeling Schemes and Their Applications
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Centralized broadcast in multihop radio networks
Journal of Algorithms
Compact routing with name independence
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Compact routing schemes with low stretch factor
Journal of Algorithms
Proceedings of the 1st international conference on Embedded networked sensor systems
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
A faster distributed protocol for constructing a minimum spanning tree
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Compact routing on euclidian metrics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Sparse source-wise and pair-wise distance preservers
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the locality of bounded growth
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
Spanners and emulators with sublinear distance errors
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Optimal-stretch name-independent compact routing in doubling metrics
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On space-stretch trade-offs: upper bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Deterministic M2M multicast in radio networks
Theoretical Computer Science
A faster distributed protocol for constructing a minimum spanning tree
Journal of Computer and System Sciences
Average stretch analysis of compact routing schemes
Discrete Applied Mathematics
Strong-diameter decompositions of minor free graphs
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
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
Compact roundtrip routing with topology-independent node names
Journal of Computer and System Sciences
Dynamic routing schemes for graphs with low local density
ACM Transactions on Algorithms (TALG)
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
ACM Transactions on Algorithms (TALG)
Scalable decentralized control for sensor networks via distributed lattices
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Fast distributed graph partition and application
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ACM Transactions on Algorithms (TALG)
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
Dynamic routing schemes for general graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Robust locality-aware lookup networks
Self-star Properties in Complex Information Systems
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
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
Small stretch pairwise spanners
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |