Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference38 articles.
1. Bansal, N., Buchbinder, N., Mądry, A., Naor, J.: A polylogarithmic-competitive algorithm for the
$$k$$
k
-server problem. In: Proceedings of FOCS 2011, pp. 267–276 (2011)
2. Böckenhauer, H.J.., Hromkovič,J., Komm, D., Královič, R., Rossmanith, P.: On the power of randomness versus advice in online computation. In Bordihn, H., Kutrib, M., Truthe, B. (eds.) Languages Alive: Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday, LNCS 7300. Springer (2012)
3. Böckenhauer, H.J., Komm, D., Královič, R., Královič, R., Mömke, T.: On the advice complexity of online problems. In: Proceedings of ISAAC 2009, LNCS 5478, pp. 331–340 (2009)
4. Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R., Mömke, T.: Online algorithms with advice: the tape model. Inf. Comput. 254, 59–83 (2017)
5. Böckenhauer, H.J., Komm, D., Královič, R., Královič, R.: On the advice complexity of the
$$k$$
k
-server problem. In: Proceedings of ICALP 2011, LNCS 6755, pp. 207–218 (2011)