978 search results - page 4 / 196 » Knowledge, Probability, and Adversaries |
83
Voted
PODC
2012
ACM
13 years 1 days ago
2012
ACM
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
84
Voted
CPC
2007
14 years 9 months ago
2007
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
81
Voted
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
We perform a theoretical study of the following queryview security problem: given a view V to be published, does V logically disclose information about a confidential query S? The...
114
click to vote
SIAMCOMP
2010
14 years 4 months ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
COLT
2008
Springer
14 years 11 months ago
2008
Springer
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...