default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDennis Komm
Person information
- affiliation: ETH Zurich, Switzerland
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner:
Finding Optimal Solutions with Neighborly Help. Algorithmica 86(6): 1921-1947 (2024)- [j22]Dennis Komm:
Informatik vor, im und nach dem Schweizer Gymnasium. Informatische Bildung in Schulen (IBiS) 2(1): 9 (2024) - [c29]Ryan E. Dougherty, Tim Randolph, Tzu-Yi Chen, Jeff Erickson, Matthew Ferland, Dennis Komm, Jonathan Liu, Timothy Ng, Seth Poulsen, Smaranda Sandu, Michael Shindler, Edward Talmage, Thomas Zeume:
A Survey of Undergraduate Theory of Computing Curricula. SIGCSE Virtual (2) 2024 - [p4]Dennis Komm:
Wirksamer Informatikunterricht - Eine Einführung. Wirksamer Informatikunterricht 2024: 19-22 - [p3]Dennis Komm:
Wirksamer Informatikunterricht - Ein Fazit. Wirksamer Informatikunterricht 2024: 213-221 - [e2]Dennis Komm:
Wirksamer Informatikunterricht. Unterrichtsqualität: Perspektiven von Expertinnen und Experten, Schneider Verlag Hohengehren GmbH, Baltmannsweiler, Germany 2024, ISBN 978-3-8340-2243-1 [contents] - [i8]Fabian Frei, Matthias Gehnen, Dennis Komm, Rastislav Královic, Richard Královic, Peter Rossmanith, Moritz Stocker:
Tree Coloring: Random Order and Predictions. CoRR abs/2405.18151 (2024) - [i7]Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker:
Online Unbounded Knapsack. CoRR abs/2407.02045 (2024) - [i6]Clemens Bachmann, Alexandra Maximova, Tobias Kohn, Dennis Komm:
WebTigerPython - A Low-Floor High-Ceiling Python IDE for the Browser. CoRR abs/2410.07001 (2024) - 2023
- [c28]Tobias Kohn
, Dennis Komm:
Coping With Scoping: Understanding Scope and Parameters. ITiCSE (1) 2023: 201-207 - 2022
- [j21]Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Randomized Online Computation with High Probability Guarantees. Algorithmica 84(5): 1357-1384 (2022) - [j20]Hans-Joachim Böckenhauer, Dennis Komm, Raphael Wegner:
Call admission problems on grids with advice. Theor. Comput. Sci. 918: 77-93 (2022) - [j19]Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm:
Call admission problems on trees. Theor. Comput. Sci. 922: 410-423 (2022) - 2021
- [c27]Dennis Komm:
Teaching Recursion in High School - A Constructive Approach. ISSEP 2021: 69-80 - 2020
- [j18]Dennis Komm, Bernhard Matter:
Informatics in Swiss Primary Schools: A Case for Interdisciplinarity. Bull. EATCS 130 (2020) - [c26]Dennis Komm, Ulrich Hauser, Bernhard Matter, Jacqueline Staub, Nicole Trachsler:
Computational Thinking in Small Packages. ISSEP 2020: 170-181 - [c25]Dennis Komm, Adrian Regez, Urs Hauser, Marco Gassner, Pascal Lütscher, Rico Puchegger, Tobias Kohn:
Problem Solving and Creativity: Complementing Programming Education with Robotics. ITiCSE 2020: 259-265 - [p2]Juraj Hromkovic, Dennis Komm, Regula Lacher, Jacqueline Staub:
Teaching with LOGO Philosophy. Encyclopedia of Education and Information Technologies 2020: 1-9
2010 – 2019
- 2019
- [j17]Elisabet Burjons, Dennis Komm, Marcel Schöngens:
The k-Server Problem with Advice in d Dimensions and on the Sphere. Algorithmica 81(5): 1859-1880 (2019) - [j16]Hans-Joachim Böckenhauer, Tobias Kohn, Dennis Komm, Giovanni Serafini:
An Elementary Approach Towards Teaching Dynamic Programming. Bull. EATCS 128 (2019) - [j15]Tobias Kohn, Dennis Komm:
Denn sie wissen nicht, was sie programmieren. Inform. Spektrum 42(2): 112-117 (2019) - [j14]Urs Hauser, Dennis Komm, Giovanni Serafini:
Wie Mathematik und Informatik im Unterricht voneinander profitieren können - Teil 1: Abstraktionsfähigkeit. Inform. Spektrum 42(2): 118-123 (2019) - [j13]Urs Hauser, Dennis Komm, Giovanni Serafini:
Wie Mathematik und Informatik im Unterricht voneinander profitieren können - Teil 2: Variation der Problemstellung und Modularisierung. Inform. Spektrum 42(2): 124-129 (2019) - [c24]Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm:
Call Admission Problems on Trees with Advice - (Extended Abstract). IWOCA 2019: 108-121 - [c23]Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner:
Finding Optimal Solutions With Neighborly Help. MFCS 2019: 78:1-78:14 - [i5]Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner:
Finding Optimal Solutions With Neighborly Help. CoRR abs/1906.10078 (2019) - 2018
- [j12]Urs Hauser, Dennis Komm:
Interdisciplinary Education in Mathematics and Informatics at Swiss High Schools. Bull. EATCS 126 (2018) - [j11]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano:
Online Minimum Spanning Tree with Advice. Int. J. Found. Comput. Sci. 29(4): 505-527 (2018) - [c22]Tobias Kohn, Dennis Komm:
Teaching Programming and Algorithmic Complexity with Tangible Machines. ISSEP 2018: 68-83 - [c21]Elisabet Burjons, Dennis Komm, Marcel Schöngens:
The k-Server Problem with Advice in d Dimensions and on the Sphere. SOFSEM 2018: 396-409 - [c20]Hans-Joachim Böckenhauer, Dennis Komm, Raphael Wegner:
Call Admission Problems on Grids with Advice (Extended Abstract). WAOA 2018: 118-133 - [p1]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm:
Reoptimization of Hard Optimization Problems. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 427-454 - [e1]Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger:
Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 11011, Springer 2018, ISBN 978-3-319-98354-7 [contents] - 2017
- [j10]Juraj Hromkovic, Tobias Kohn, Dennis Komm, Giovanni Serafini:
Algorithmic Thinking from the Start. Bull. EATCS 121 (2017) - [j9]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Online algorithms with advice: The tape model. Inf. Comput. 254: 59-83 (2017) - [j8]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic:
On the advice complexity of the k-server problem. J. Comput. Syst. Sci. 86: 159-170 (2017) - [j7]Stefan Dobrev, Jeff Edmonds, Dennis Komm, Rastislav Královic, Richard Královic, Sacha Krug, Tobias Mömke:
Improved analysis of the online set cover problem with advice. Theor. Comput. Sci. 689: 96-107 (2017) - 2016
- [b2]Dennis Komm:
An Introduction to Online Computation - Determinism, Randomization, Advice. Texts in Theoretical Computer Science. An EATCS Series, Springer 2016, ISBN 978-3-319-42747-8, pp. 1-267 - [c19]Juraj Hromkovic, Tobias Kohn, Dennis Komm, Giovanni Serafini:
Combining the Power of Python with the Simplicity of Logo for a Sustainable Computer Science Education. ISSEP 2016: 155-166 - [c18]Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl:
Advice Complexity of the Online Search Problem. IWOCA 2016: 203-212 - [c17]Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl:
Advice Complexity of the Online Induced Subgraph Problem. MFCS 2016: 59:1-59:13 - [c16]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano:
Online Minimum Spanning Tree with Advice - (Extended Abstract). SOFSEM 2016: 195-207 - [c15]Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Královic, Rastislav Královic, Tobias Mömke:
The Complexity of Paging Against a Probabilistic Adversary. SOFSEM 2016: 265-276 - [i4]Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl:
Advice Complexity of the Online Search Problem. CoRR abs/1612.09299 (2016) - 2015
- [c14]Heidi Gebauer, Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula:
Disjoint Path Allocation with Sublinear Advice. COCOON 2015: 417-429 - [c13]Dennis Komm, Rastislav Královic, Richard Královic, Jasmin Smula:
Treasure Hunt with Advice. SIROCCO 2015: 328-341 - [i3]Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl:
Advice Complexity of the Online Induced Subgraph Problem. CoRR abs/1512.05996 (2015) - 2014
- [j6]Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith:
The online knapsack problem: Advice and randomization. Theor. Comput. Sci. 527: 61-72 (2014) - [j5]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock:
The string guessing problem as a method to prove lower bounds on the advice complexity. Theor. Comput. Sci. 554: 95-108 (2014) - [c12]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm:
A Technique to Obtain Hardness Results for Randomized Online Algorithms - A Survey. Computing with New Resources 2014: 264-276 - [c11]Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Randomized Online Algorithms with High Probability Guarantees. STACS 2014: 470-481 - 2013
- [c10]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock:
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. COCOON 2013: 493-505 - [i2]Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Randomized online computation with high probability guarantees. CoRR abs/1302.2805 (2013) - 2012
- [b1]Dennis Komm:
Advice and Randomization in Online Computation. ETH Zurich, Zürich, Switzerland, 2012 - [c9]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Richard Královic, Peter Rossmanith:
On the Power of Randomness versus Advice in Online Computation. Languages Alive 2012: 30-43 - [c8]Dennis Komm, Richard Královic, Tobias Mömke:
On the Advice Complexity of the Set Cover Problem. CSR 2012: 241-252 - [c7]Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith:
On the Advice Complexity of the Knapsack Problem. LATIN 2012: 61-72 - [i1]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock:
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j4]Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych:
Reoptimization of the Shortest Common Superstring Problem. Algorithmica 61(2): 227-251 (2011) - [j3]Dennis Komm, Richard Královic:
Advice Complexity and Barely Random Algorithms. RAIRO Theor. Informatics Appl. 45(2): 249-267 (2011) - [j2]Juraj Hromkovic, Lucia Keller, Dennis Komm, Giovanni Serafini, Björn Steffen:
Fehlerkorrigierende Codes - Ein Unterrichtsbeispiel zum gelenkten entdeckenden Lernen. LOG IN 31(168): 50-55 (2011) - [c6]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic:
On the Advice Complexity of the k-Server Problem. ICALP (1) 2011: 207-218 - [c5]Dennis Komm, Richard Královic:
Advice Complexity and Barely Random Algorithms. SOFSEM 2011: 332-343 - 2010
- [j1]Hans-Joachim Böckenhauer, Dennis Komm:
Reoptimization of the metric deadline TSP. J. Discrete Algorithms 8(1): 87-100 (2010) - [c4]Lucia Keller, Dennis Komm, Giovanni Serafini, Andreas Sprock, Björn Steffen:
Teaching Public-Key Cryptography in School. ISSEP 2010: 112-123
2000 – 2009
- 2009
- [c3]Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych:
Reoptimization of the Shortest Common Superstring Problem. CPM 2009: 78-91 - [c2]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
On the Advice Complexity of Online Problems. ISAAC 2009: 331-340 - 2008
- [c1]Hans-Joachim Böckenhauer, Dennis Komm:
Reoptimization of the Metric Deadline TSP. MFCS 2008: 156-167
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-04 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
