Randomized algorithms, once viewed as a tool in computational number theory, have by
now found widespread application. Growth has been fueled by the two major benefits of …

We have seen a variety of on-line scheduling problems. Many of them are understood
satisfactorily, but there are also many interesting open problems. Studied scheduling …

We present DAG-Rider, the first asynchronous Byzantine Atomic Broadcast protocol that
achieves optimal resilience, optimal amortized communication complexity, and optimal time …

The rapid growth in demand for computational power driven by modern service applications
combined with the shift to the Cloud computing model have led to the establishment of large …

We show that the propositional Mu-Calculus is equivalent in expressive power to nite
automata on innite trees. Since complementation is trivial in the Mu-Calculus, our …

We introduce the abstract problem of rounding an unknown fractional bipartite b-matching x
revealed online (eg, output by an online fractional algorithm), exposed node-by-node on …

This paper provides a novel technique for the analysis of randomized algorithms for
optimization problems on metric spaces, by relating the randomized performance ratio for …

In practice, almost all dynamic systems require decisions to be made on-line, without full
knowledge of their future impact on the system. A general model for the processing of …

Competitive analysis is concerned with comparing the performance of on-line algorithms
with that of optimal off-line algorithms. In some cases randomization can lead to algorithms …

We improve the result of [BartSG] on probabilistic approximation of metric spaces by
“hierarchically wellseparated tree” metric spaces. We obtain an approximation factor of O …