2924 search results - page 527 / 585 » Lower Bounds in Distributed Computing |
135
Voted
MOBIHOC
2001
ACM
16 years 2 months ago
2001
ACM
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
139
click to vote
PPOPP
2010
ACM
16 years 17 days ago
2010
ACM
Exploiting the emerging reality of affordable multi-core architeces through providing programmers with simple abstractions that would enable them to easily turn their sequential p...
102
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
130
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
91
Voted
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
—This paper presents a theoretical estimation for idle channel time in a multi-hop environment. Idle channel time is the time proportion of a node during which the channel state ...