Summary Background The Global Burden of Diseases, Injuries, and Risk Factors Study
(GBD) 2017 comparative risk assessment (CRA) is a comprehensive approach to risk factor …

We consider a basic content distribution scenario consisting of a single origin server
connected through a shared bottleneck link to a number of users each equipped with a …

We consider a natural semi-online model for weighted paging, where at any time the
algorithm is given predictions, possibly with errors, about the next arrival of each page. The …

Modern distributed storage systems often use erasure codes to protect against disk and
node failures to increase reliability, while trying to meet the latency requirements of the …

We suggest a simple modification to the Kd-tree search algorithm for nearest neighbor
search resulting in an improved performance. The Kd-tree data structure seems to work well …

Resource augmentation is a well-established model for analyzing algorithms, particularly in
the online setting. It has been successfully used for providing theoretical evidence for …

This paper provides a systematic study of several proposed measures for online algorithms
in the context of a specific problem, namely, the two server problem on three colinear points …

Online optimization with lookahead deals with sequential decision making under incomplete
information where each decision must be made on the basis of a limited, but certain preview …

We revisit three famous bin packing algorithms, namely Next Fit (NF), Worst Fit (WF) and
First Fit (FF). We compare the approximation ratio of these algorithms as a function of the …

This is a contribution to the ongoing study of properties of performance measures for online
algorithms. It has long been known that competitive analysis suffers from draw-backs in …