primarily aim to avoid the need of random oracle or pseudo-random function, rather than improve worst-case cost. Their construction uses a binary search tree, and requires periodic reshuffling operations that ca
In this case, computing the worst case cost implies the solution of a quadratic maximization problem with a computational complexity that is exponential with the prediction horizon. In this paper an efficient upper bound of a quadratic maximization problem over a hypercube is presented. It is based...