1. Lecture Notes in Computer Science;K Barhum,2014
2. Lecture Notes in Computer Science;MP Bianchi,2012
3. Lecture Notes in Computer Science;MP Bianchi,2013
4. 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. Electron. Colloq. Comput. Complex. (ECCC) 19, 162 (2012)
5. Lecture Notes in Computer Science;H-J Böckenhauer,2013