2252 search results - page 291 / 451 » Lower Bounds for Dynamic Algorithms |
149
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
109
Voted
WDAG
2000
Springer
15 years 7 months ago
2000
Springer
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
131
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
143
Voted
DC
2007
15 years 3 months ago
2007
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery m...
91
Voted
ECCC
2007
15 years 3 months ago
2007
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...