1. A polylogarithmic-competitive algorithm for the k-server problem (extended abstract);Bansal,2011
2. Constructing Randomized Online Algorithms from Algorithms with Advice;Böckenhauer,2016
3. On the power of randomness versus advice in online computation;Böckenhauer,2012
4. The string guessing problem as a method to prove lower bounds on the advice complexity;Böckenhauer;Theor. Comput. Sci.,2014
5. On the advice complexity of online problems;Böckenhauer,2009