Author:
Barhum Kfir,Böckenhauer Hans-Joachim,Forišek Michal,Gebauer Heidi,Hromkovič Juraj,Krug Sacha,Smula Jasmin,Steffen Björn
Publisher
Springer International Publishing
Reference22 articles.
1. Awerbuch, B., Bartal, Y., Fiat, A., Rosén, A.: Competitive non-preemptive call control. In: Proc. of SODA 1994, pp. 312–320. ACM/SIAM (1994)
2. Lecture Notes in Computer Science;M.P. Bianchi,2012
3. Lecture Notes in Computer Science;M.P. Bianchi,2013
4. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)
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. Electronic Colloquium on Computational Complexity (ECCC), TR12-162 (2012)
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献