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 …

In online scenarios requests arrive over time, and each request must be serviced in an
irrevocable manner before the next request arrives. Online algorithms with advice is an area …

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 …

For many applications a randomized algorithm is either the simplest algorithm available, or
the fastest, or both. This tutorial presents the basic concepts in the design and analysis of …

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

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 …