Dennis Komm

Orcid: 0000-0002-9024-1558

Affiliations:
  • ETH Zurich, Switzerland


According to our database1, Dennis Komm authored at least 53 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Finding Optimal Solutions with Neighborly Help.
Algorithmica, June, 2024

Informatik vor, im und nach dem Schweizer Gymnasium.
Informatische Bildung in Schulen (IBiS), 2024

WebTigerPython - A Low-Floor High-Ceiling Python IDE for the Browser.
CoRR, 2024

Online Unbounded Knapsack.
CoRR, 2024

Tree Coloring: Random Order and Predictions.
CoRR, 2024

Wirksamer Informatikunterricht - Ein Fazit.
Proceedings of the Wirksamer Informatikunterricht., 2024

Wirksamer Informatikunterricht - Eine Einführung.
Proceedings of the Wirksamer Informatikunterricht., 2024

2023
Coping With Scoping: Understanding Scope and Parameters.
Proceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 1, 2023

2022
Call admission problems on grids with advice.
Theor. Comput. Sci., 2022

Call admission problems on trees.
Theor. Comput. Sci., 2022

Randomized Online Computation with High Probability Guarantees.
Algorithmica, 2022

2021
Teaching Recursion in High School - A Constructive Approach.
Proceedings of the Informatics in Schools. Rethinking Computing Education, 2021

2020
Teaching with LOGO Philosophy.
Proceedings of the Encyclopedia of Education and Information Technologies, 2020

Informatics in Swiss Primary Schools: A Case for Interdisciplinarity.
Bull. EATCS, 2020

Problem Solving and Creativity: Complementing Programming Education with Robotics.
Proceedings of the 2020 ACM Conference on Innovation and Technology in Computer Science Education, 2020

Computational Thinking in Small Packages.
Proceedings of the Informatics in Schools. Engaging Learners in Computational Thinking, 2020

2019
Denn sie wissen nicht, was sie programmieren.
Inform. Spektrum, 2019

Wie Mathematik und Informatik im Unterricht voneinander profitieren können - Teil 2: Variation der Problemstellung und Modularisierung.
Inform. Spektrum, 2019

Wie Mathematik und Informatik im Unterricht voneinander profitieren können - Teil 1: Abstraktionsfähigkeit.
Inform. Spektrum, 2019

An Elementary Approach Towards Teaching Dynamic Programming.
Bull. EATCS, 2019

The k-Server Problem with Advice in d Dimensions and on the Sphere.
Algorithmica, 2019

Call Admission Problems on Trees with Advice - (Extended Abstract).
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018
Online Minimum Spanning Tree with Advice.
Int. J. Found. Comput. Sci., 2018

Interdisciplinary Education in Mathematics and Informatics at Swiss High Schools.
Bull. EATCS, 2018

Call Admission Problems on Grids with Advice (Extended Abstract).
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Teaching Programming and Algorithmic Complexity with Tangible Machines.
Proceedings of the Informatics in Schools. Fundamentals of Computer Science and Software Engineering, 2018

Reoptimization of Hard Optimization Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Improved analysis of the online set cover problem with advice.
Theor. Comput. Sci., 2017

On the advice complexity of the k-server problem.
J. Comput. Syst. Sci., 2017

Online algorithms with advice: The tape model.
Inf. Comput., 2017

Algorithmic Thinking from the Start.
Bull. EATCS, 2017

2016
An Introduction to Online Computation - Determinism, Randomization, Advice
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-319-42749-2, 2016

The Complexity of Paging Against a Probabilistic Adversary.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Online Minimum Spanning Tree with Advice - (Extended Abstract).
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Advice Complexity of the Online Induced Subgraph Problem.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Advice Complexity of the Online Search Problem.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Combining the Power of Python with the Simplicity of Logo for a Sustainable Computer Science Education.
Proceedings of the Informatics in Schools: Improvement of Informatics Knowledge and Perception, 2016

2015
Treasure Hunt with Advice.
Proceedings of the Structural Information and Communication Complexity, 2015

Disjoint Path Allocation with Sublinear Advice.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
The online knapsack problem: Advice and randomization.
Theor. Comput. Sci., 2014

The string guessing problem as a method to prove lower bounds on the advice complexity.
Theor. Comput. Sci., 2014

Randomized Online Algorithms with High Probability Guarantees.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

A Technique to Obtain Hardness Results for Randomized Online Algorithms - A Survey.
Proceedings of the Computing with New Resources, 2014

2012
Advice and Randomization in Online Computation.
PhD thesis, 2012

On the Advice Complexity of the Knapsack Problem.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

On the Advice Complexity of the Set Cover Problem.
Proceedings of the Computer Science - Theory and Applications, 2012

On the Power of Randomness versus Advice in Online Computation.
Proceedings of the Languages Alive, 2012

2011
Fehlerkorrigierende Codes - Ein Unterrichtsbeispiel zum gelenkten entdeckenden Lernen.
LOG IN, 2011

Advice Complexity and Barely Random Algorithms.
RAIRO Theor. Informatics Appl., 2011

Reoptimization of the Shortest Common Superstring Problem.
Algorithmica, 2011

2010
Reoptimization of the metric deadline TSP.
J. Discrete Algorithms, 2010

Teaching Public-Key Cryptography in School.
Proceedings of the Teaching Fundamentals Concepts of Informatics, 4th International Conference on Informatics in Secondary Schools, 2010

2009
On the Advice Complexity of Online Problems.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009


  Loading...