2084 search results - page 132 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
120
Voted
COLCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
—Peer-to-Peer file sharing applications in the Internet, such as BitTorrent, Gnutella, etc., have been immensely popular. Prior research mainly focuses on peer and content discov...
146
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
150
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
139
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
146
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information proc...