Distributed MST for constant diameter graphs
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
An efficient distributed algorithm for constructing small dominating sets
Distributed Computing - Special issue: Selected papers from PODC '01
A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
New bounds for multi-label interval routing
Theoretical Computer Science
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Brief announcement: efficient clustering in unstructured radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A distributed algorithm to find k-dominating sets
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Randomized greedy algorithms for finding small k-dominating sets of regular graphs
Random Structures & Algorithms
Constant-time distributed dominating set approximation
Distributed Computing
Distributed verification of minimum spanning trees
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A faster distributed protocol for constructing a minimum spanning tree
Journal of Computer and System Sciences
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Packing vertices and edges in random regular graphs
Random Structures & Algorithms
An energy-efficient heterogeneous dual routing scheme for mobile ad hoc and sensor networks
International Journal of Mobile Network Design and Innovation
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
Efficient distributed approximation algorithms via probabilistic tree embeddings
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
On the locality of distributed sparse spanner construction
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
r3: Resilient Random Regular Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
An efficient distributed algorithm for canonical labeling on directed split-stars
Discrete Applied Mathematics
Hierarchical routing in ad hoc networks using k-dominating sets
ACM SIGMOBILE Mobile Computing and Communications Review
Constructing special k-dominating sets using variations on the greedy algorithm
Pervasive and Mobile Computing
Dynamic virtual backbone management for service discovery in wireless mesh networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Best-effort group service in dynamic networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Efficient distributed random walks with applications
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Theory of communication networks
Algorithms and theory of computation handbook
An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
Journal of Parallel and Distributed Computing
Time optimal algorithms for black hole search in rings
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Distributed decision problems: the locality angle
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fast computation of small cuts via cycle space sampling
ACM Transactions on Algorithms (TALG)
The south zone: distributed algorithms for alliances
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Navigating in a Graph by Aid of Its Spanning Tree Metric
SIAM Journal on Discrete Mathematics
The Journal of Supercomputing
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Efficient distributed weighted matchings on trees
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
A fast distributed approximation algorithm for minimum spanning trees
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Optimal distributed all pairs shortest paths and applications
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Fast routing table construction using small messages: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
Time-bounded essential localization for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |