2084 search results - page 357 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
113
click to vote
INFOCOM
2012
IEEE
13 years 5 days ago
2012
IEEE
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...
IJRR
2008
14 years 9 months ago
2008
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
102
click to vote
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
CC
2008
Springer
14 years 9 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...