Author:
Clemente Jhoirene,Hromkovič Juraj,Komm Dennis,Kudahl Christian
Publisher
Springer International Publishing
Reference19 articles.
1. Lecture Notes in Computer Science;K Barhum,2014
2. 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.Theor. Comput. Sci. 554, 95–108 (2014). Elsevier Science Publishers
3. Lecture Notes in Computer Science;H-J Böckenhauer,2013
4. Lecture Notes in Computer Science;H-J Böckenhauer,2013
5. Böckenhauer, H.-J., Komm, D., Královič, R., Rossmanith, P.: The online knapsack problem: advice and randomization. Theor. Comput. Sci. 527, 61–72 (2014)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献