Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. On the advice complexity of the k-server problem;Böckenhauer;J. Comput. Syst. Sci.,2017
2. On the advice complexity of online problems;Böckenhauer,2009
3. The online knapsack problem: advice and randomization;Böckenhauer;Theor. Comput. Sci.,2014
4. Online Computation and Competitive Analysis;Borodin,1998
5. Online algorithms with advice: a survey;Boyar;ACM SIGACT News,2016
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献