168 search results - page 22 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
102
click to vote
COCO
2009
Springer
15 years 5 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
112
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We study logit dynamics [3] for strategic games. At every stage of the game a player is selected uniformly at random and she is assumed to play according to a noisy best-response ...
125
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
ROBOCOMM
2007
IEEE
15 years 8 months ago
2007
IEEE
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
114
click to vote
GLOBECOM
2009
IEEE
14 years 11 months ago
2009
IEEE
How to rapidly disseminate a large-sized file to many recipients is a fundamental problem in many applications, such as updating software patches and distributing large scientific ...