This paper studies the online vector bin packing (OVBP) problem and the
...
A model of computation for which reasonable yet still incomplete lower b...
We introduce a new type of adversary for online graph problems. The new
...
Extending the idea in [Impagliazzo, R., Moore, C. and Russell, A., An
en...
Inspired by ideas in cognitive science, we propose a novel and general
a...
We show conflict complexity of any total boolean function, recently defi...
Consider the standard two-party communication model. This paper, follows...
We make two observations regarding a recent tight example for a composit...