Dennis Komm

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Finding optimal solutions with neighborly help	2024-05-30	Paper
Finding Optimal Solutions With Neighborly Help.	2022-07-21	Paper
Call admission problems on trees	2022-06-13	Paper
Call admission problems on grids with advice	2022-05-10	Paper
Randomized online computation with high probability guarantees	2022-05-03	Paper
The k-Server Problem with Advice in d Dimensions and on the Sphere	2020-10-21	Paper
Call admission problems on trees with advice (extended abstract)	2020-02-25	Paper
The \(k\)-server problem with advice in \(d\) dimensions and on the sphere	2019-05-07	Paper
Call admission problems on grids with advice (extended abstract)	2019-01-15	Paper
Online Minimum Spanning Tree with Advice	2018-07-24	Paper
Advice Complexity of the Online Induced Subgraph Problem	2018-03-21	Paper
Improved analysis of the online set cover problem with advice	2017-09-07	Paper
On the advice complexity of the \(k\)-server problem	2017-05-26	Paper
Online algorithms with advice: the tape model	2017-05-18	Paper
Randomized Online Algorithms with High Probability Guarantees	2017-03-03	Paper
Advice Complexity of the Online Search Problem	2016-09-29	Paper
Online Minimum Spanning Tree with Advice	2016-03-10	Paper
The Complexity of Paging Against a Probabilistic Adversary	2016-03-10	Paper
Treasure Hunt with Advice	2016-01-08	Paper
Disjoint Path Allocation with Sublinear Advice	2015-10-29	Paper
A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey	2015-09-08	Paper
The string guessing problem as a method to prove lower bounds on the advice complexity	2014-10-06	Paper
The online knapsack problem: advice and randomization	2014-03-13	Paper
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity	2013-06-11	Paper
On the Power of Randomness versus Advice in Online Computation	2012-11-01	Paper
On the Advice Complexity of the Set Cover Problem	2012-09-10	Paper
On the Advice Complexity of the Knapsack Problem	2012-06-29	Paper
Reoptimization of the shortest common superstring problem	2011-09-20	Paper
Advice Complexity and Barely Random Algorithms	2011-08-10	Paper
On the Advice Complexity of the k-Server Problem	2011-07-06	Paper
Advice Complexity and Barely Random Algorithms	2011-02-15	Paper
Reoptimization of the metric deadline TSP	2010-02-26	Paper
On the Advice Complexity of Online Problems	2009-12-17	Paper
Reoptimization of the Shortest Common Superstring Problem	2009-07-07	Paper
Reoptimization of the Metric Deadline TSP	2009-02-03	Paper

Research outcomes over time

This page was built for person: Dennis Komm