Author:
Böckenhauer Hans-Joachim,Komm Dennis,Královič Rastislav,Královič Richard
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R.: On the advice complexity of the k-server problem. Technical Report 703, ETH Zürich (2010)
2. Lecture Notes in Computer Science;H.-J. Böckenhauer,2009
3. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
4. Chaitin, G.J.: On the length of programs for computing finite binary sequences. Journal of the ACM 13(4), 547–569 (1966)
5. Lecture Notes in Computer Science;S. Dobrev,2008
Cited by
66 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Online demand peak shaving with machine‐learned advice in digital twins;Digital Twins and Applications;2024-09
2. Online Demand Peak Shaving with Machine-Learned Advice in Cyber-Physical Energy Systems;2023 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech);2023-11-14
3. The k-Server with Preferences Problem;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11
4. Online Node- and Edge-Deletion Problems with Advice;Algorithmica;2021-06-30
5. On the advice complexity of the online dominating set problem;Theoretical Computer Science;2021-03