2924 search results - page 57 / 585 » Lower Bounds in Distributed Computing |
113
click to vote
ICDCS
2008
IEEE
15 years 6 months ago
2008
IEEE
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
ISPAN
2005
IEEE
15 years 5 months ago
2005
IEEE
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
100
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
MSWIM
2003
ACM
15 years 5 months ago
2003
ACM
This article analyzes the connectivity of multihop radio networks in a log-normal shadow fading environment. Assuming the nodes have equal transmission capabilities and are randoml...
JC
2007
14 years 11 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...