168 search results - page 13 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
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...
101
click to vote
WG
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
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...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...