| The string guessing problem as a method to prove lower bounds on the advice complexity HJ Böckenhauer, J Hromkovič, D Komm, S Krug, J Smula, A Sprock Theoretical Computer Science 554, 95-108, 2014 | 71 | 2014 |
| Advice complexity of the online coloring problem S Seibert, A Sprock, W Unger Algorithms and Complexity: 8th International Conference, CIAC 2013 …, 2013 | 34 | 2013 |
| Knowing all optimal solutions does not help for TSP reoptimization HJ Böckenhauer, J Hromkovič, A Sprock Computation, cooperation, and life: essays dedicated to Gheorghe Păun on the …, 2011 | 20 | 2011 |
| Steiner tree reoptimization in graphs with sharpened triangle inequality HJ Böckenhauer, K Freiermuth, J Hromkovič, T Mömke, A Sprock, ... Journal of Discrete Algorithms 11, 73-86, 2012 | 15 | 2012 |
| On the hardness of reoptimization with multiple given solutions HJ Böckenhauer, J Hromkovič, A Sprock Fundamenta Informaticae 110 (1-4), 59-76, 2011 | 13 | 2011 |
| The steiner tree reoptimization problem with sharpened triangle inequality HJ Böckenhauer, K Freiermuth, J Hromkovič, T Mömke, A Sprock, ... International Conference on Algorithms and Complexity, 180-191, 2010 | 11 | 2010 |
| Analysis of hard problems in reoptimization and online computation A Sprock ETH Zurich, 2013 | 8 | 2013 |
| Teaching public-key cryptography in school L Keller, D Komm, G Serafini, A Sprock, B Steffen Teaching Fundamentals Concepts of Informatics: 4th International Conference …, 2010 | 7 | 2010 |
| Advice complexity of the online vertex coloring problem S Seibert, A Sprock, W Unger Technical report 765, 2012 | 4 | 2012 |
