| Publication | Date of Publication | Type |
|---|
Finding optimal solutions with neighborly help
Algorithmica | 2024-05-30 | Paper |
Finding Optimal Solutions With Neighborly Help.
(available as arXiv preprint) | 2022-07-21 | Paper |
Call admission problems on trees
Theoretical Computer Science | 2022-06-13 | Paper |
Call admission problems on grids with advice
Theoretical Computer Science | 2022-05-10 | Paper |
Randomized online computation with high probability guarantees
Algorithmica | 2022-05-03 | Paper |
The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
SOFSEM 2018: Theory and Practice of Computer Science | 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
Algorithmica | 2019-05-07 | Paper |
| Call admission problems on grids with advice (extended abstract) | 2019-01-15 | Paper |
Online Minimum Spanning Tree with Advice
International Journal of Foundations of Computer Science | 2018-07-24 | Paper |
Advice complexity of the online induced subgraph problem
(available as arXiv preprint) | 2018-03-21 | Paper |
Improved analysis of the online set cover problem with advice
Theoretical Computer Science | 2017-09-07 | Paper |
On the advice complexity of the \(k\)-server problem
Journal of Computer and System Sciences | 2017-05-26 | Paper |
Online algorithms with advice: the tape model
Information and Computation | 2017-05-18 | Paper |
Randomized Online Algorithms with High Probability Guarantees
(available as arXiv preprint) | 2017-03-03 | Paper |
Advice complexity of the online search problem
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Online minimum spanning tree with advice (extended abstract)
Lecture Notes in Computer Science | 2016-03-10 | Paper |
The complexity of paging against a probabilistic adversary
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Treasure hunt with advice
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Disjoint path allocation with sublinear advice
Lecture Notes in Computer Science | 2015-10-29 | Paper |
A technique to obtain hardness results for randomized online algorithms -- a survey
Computing with New Resources | 2015-09-08 | Paper |
The string guessing problem as a method to prove lower bounds on the advice complexity
Theoretical Computer Science | 2014-10-06 | Paper |
The online knapsack problem: advice and randomization
Theoretical Computer Science | 2014-03-13 | Paper |
The string guessing problem as a method to prove lower bounds on the advice complexity (extended abstract)
Lecture Notes in Computer Science | 2013-06-11 | Paper |
On the power of randomness versus advice in online computation
Lecture Notes in Computer Science | 2012-11-01 | Paper |
On the advice complexity of the set cover problem
Computer Science – Theory and Applications | 2012-09-10 | Paper |
On the advice complexity of the knapsack problem
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Reoptimization of the shortest common superstring problem
Algorithmica | 2011-09-20 | Paper |
Advice complexity and barely random algorithms
RAIRO - Theoretical Informatics and Applications | 2011-08-10 | Paper |
Advice complexity and barely random algorithms
RAIRO - Theoretical Informatics and Applications | 2011-08-10 | Paper |
On the advice complexity of the \(k\)-server problem
Automata, Languages and Programming | 2011-07-06 | Paper |
Advice complexity and barely random algorithms
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Reoptimization of the metric deadline TSP
Journal of Discrete Algorithms | 2010-02-26 | Paper |
On the Advice Complexity of Online Problems
Algorithms and Computation | 2009-12-17 | Paper |
Reoptimization of the Shortest Common Superstring Problem
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Reoptimization of the Metric Deadline TSP
Lecture Notes in Computer Science | 2009-02-03 | Paper |
