Author of the publication

The Complexity of Paging Against a Probabilistic Adversary.

, , , , , and . SOFSEM, volume 9587 of Lecture Notes in Computer Science, page 265-276. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Reoptimization of Hard Optimization Problems., , and . Handbook of Approximation Algorithms and Metaheuristics (1), Chapman and Hall/CRC, (2018)An Introduction to Online Computation - Determinism, Randomization, Advice. Texts in Theoretical Computer Science. An EATCS Series Springer, (2016)Online Minimum Spanning Tree with Advice - (Extended Abstract)., , , , and . SOFSEM, volume 9587 of Lecture Notes in Computer Science, page 195-207. Springer, (2016)Reoptimization of the Metric Deadline TSP., and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 156-167. Springer, (2008)Informatics in Swiss Primary Schools: A Case for Interdisciplinarity., and . Bull. EATCS, (2020)Algorithmic Thinking from the Start., , , and . Bull. EATCS, (2017)Randomized Online Algorithms with High Probability Guarantees., , , and . STACS, volume 25 of LIPIcs, page 470-481. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Denn sie wissen nicht, was sie programmieren., and . Inform. Spektrum, 42 (2): 112-117 (2019)Coping With Scoping: Understanding Scope and Parameters., and . ITiCSE (1), page 201-207. ACM, (2023)Teaching with LOGO Philosophy., , , and . Encyclopedia of Education and Information Technologies, Springer International Publishing, (2020)