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 …

Online algorithms with advice is an area of research where one attempts to measure how
much knowledge of the future is necessary to achieve a given competitive ratio. The lower …

We introduce and study online conversion with switching costs, a family of online problems
that capture emerging problems at the intersection of energy and sustainability. In this …

We consider the setting of online computation with advice and study the bin packing
problem and a number of scheduling problems. We show that it is possible, for any of these …

We provide simple but surprisingly useful direct product theorems for proving lower bounds
on online algorithms with a limited amount of advice about the future. As a consequence, we …

The node searching problem (aka treasure hunt) is a fundamental task performed by mobile
agents in a network and can be viewed as an online version of the shortest path problem: an …

We investigate to what extent the solution quality of online algorithms can be improved when
supplying them with information about the input. To this end, we refine the recently …

In this paper, we study the advice complexity of the online bipartite matching problem and
the online stable marriage problem. We show that for both problems,⌈ log 2⁡(n!)⌉ bits of …

We study the online list update problem under the advice model of computation. Under this
model, an online algorithm receives partial information about the unknown parts of the input …

The advice complexity of an online problem is a measure of how much knowledge of the
future an online algorithm needs in order to achieve a certain competitive ratio. We …