Dennis Komm
Dennis Komm
Senior Scientist and Lecturer, ETH Zurich
Verified email at inf.ethz.ch - Homepage
Title
Cited by
Cited by
Year
On the advice complexity of online problems
HJ Böckenhauer, D Komm, R Královič, R Královič, T Mömke
International Symposium on Algorithms and Computation, 331-340, 2009
1292009
On the advice complexity of the k-server problem
HJ Böckenhauer, D Komm, R Královič, R Královič
International Colloquium on Automata, Languages, and Programming, 207-218, 2011
832011
Advice complexity and barely random algorithms
D Komm, R Královič
RAIRO-Theoretical Informatics and Applications 45 (2), 249-267, 2011
572011
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
552014
Introduction to Online Computation
D Komm
Springer International Publishing Switzerland, 2016
522016
On the advice complexity of the knapsack problem
HJ Böckenhauer, D Komm, R Královič, P Rossmanith
Latin American Symposium on Theoretical Informatics, 61-72, 2012
452012
Reoptimization of the metric deadline TSP
HJ Böckenhauer, D Komm
Journal of Discrete Algorithms 8 (1), 87-100, 2010
392010
The online knapsack problem: Advice and randomization
HJ Böckenhauer, D Komm, R Královič, P Rossmanith
Theoretical Computer Science 527, 61-72, 2014
382014
On the advice complexity of the set cover problem
D Komm, R Královič, T Mömke
International Computer Science Symposium in Russia, 241-252, 2012
362012
Reoptimization of the shortest common superstring problem
D Bilò, HJ Böckenhauer, D Komm, R Královič, T Mömke, S Seibert, A Zych
Algorithmica 61 (2), 227-251, 2011
302011
Combining the power of python with the simplicity of logo for a sustainable computer science education
J Hromkovič, T Kohn, D Komm, G Serafini
International Conference on Informatics in Schools: Situation, Evolution …, 2016
292016
Examples of algorithmic thinking in programming education
J Hromkovič, T Kohn, D Komm, G Serafini
Olympiads in Informatics 10 (1-2), 111-124, 2016
202016
Treasure hunt with advice
D Komm, R Královič, R Královič, J Smula
International Colloquium on Structural Information and Communication …, 2015
202015
Reoptimization of the shortest common superstring problem
D Bilò, HJ Böckenhauer, D Komm, R Královič, T Mömke, S Seibert, A Zych
Annual Symposium on Combinatorial Pattern Matching, 78-91, 2009
202009
Disjoint path allocation with sublinear advice
H Gebauer, D Komm, R Královič, R Královič, J Smula
International Computing and Combinatorics Conference, 417-429, 2015
172015
Online algorithms with advice: the tape model
HJ Böckenhauer, D Komm, R Královič, R Královič, T Mömke
Information and Computation 254, 59-83, 2017
162017
On the power of randomness versus advice in online computation
HJ Böckenhauer, J Hromkovič, D Komm, R Královič, P Rossmanith
Languages Alive, 30-43, 2012
152012
Advice and randomization in online computation
D Komm
ETH Zurich, 2012
152012
On the advice complexity of the k-server problem
HJ Böckenhauer, D Komm, R Královič, R Královič
Journal of Computer and System Sciences 86, 159-170, 2017
132017
Advice complexity of the online induced subgraph problem
D Komm, R Královič, R Královič, C Kudahl
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
122016
The system can't perform the operation now. Try again later.
Articles 1–20