Author:
Bianchi Maria Paola,Böckenhauer Hans-Joachim,Brülisauer Tatjana,Komm Dennis,Palano Beatrice
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Lecture Notes in Computer Science;K Barhum,2014
2. Lecture Notes in Computer Science;K Barhum,2014
3. Lecture Notes in Computer Science;MP Bianchi,2012
4. Lecture Notes in Computer Science;MP Bianchi,2013
5. Böckenhauer, H.-J., Hromkovič, J., Komm, D., Krug, S., Smula, J., Sprock, A.: The string guessing problem as a method to prove lower bounds on the advice complexity. Theoret. Comput. Sci. 554, 95–108 (2014)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Online Minimum Spanning Tree with Advice;International Journal of Foundations of Computer Science;2018-06
2. Online Bin Packing with Advice of Small Size;Theory of Computing Systems;2018-04-12
3. Online Algorithms with Advice;ACM Computing Surveys;2018-03-31