| Publication | Date of Publication | Type |
|---|
| Two-Way Non-Uniform Finite Automata | 2023-08-15 | Paper |
| Determinism and Nondeterminism in Finite Automata with Advice | 2023-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089196 | 2022-07-18 | Paper |
| Randomized online computation with high probability guarantees | 2022-05-03 | Paper |
| Two-way non-uniform finite automata | 2022-03-25 | Paper |
| Computing with advice: when knowledge helps | 2018-09-04 | Paper |
| Online graph coloring against a randomized adversary | 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 |
| 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 |
| Advice complexity of maximum independent set in sparse and bipartite graphs | 2015-05-12 | Paper |
| Determinism vs. nondeterminism for two-way automata: representing the meaning of states by logical formulæ | 2014-08-04 | Paper |
| The online knapsack problem: advice and randomization | 2014-03-13 | Paper |
| Infinite vs. finite size-bounded randomized computations | 2014-02-13 | Paper |
| Independent set with advice: the impact of graph knowledge (extended abstract) | 2013-09-13 | Paper |
| Determinism vs. nondeterminism for two-way automata. Representing the meaning of states by logical formulæ | 2012-11-02 | 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 |
| Size complexity of rotating and sweeping automata | 2012-05-11 | 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 |
| Information complexity of online problems | 2010-09-03 | Paper |
| On the Advice Complexity of Online Problems | 2009-12-17 | Paper |
| Reoptimization of Steiner trees: changing the terminal set | 2009-08-21 | Paper |
| Reoptimization of the Shortest Common Superstring Problem | 2009-07-07 | Paper |
| Rapid almost-complete broadcasting in faulty networks | 2009-03-30 | Paper |
| On Fractional Dynamic Faults with Threshold | 2009-03-12 | Paper |
| An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata | 2009-03-05 | Paper |
| Deterministic Models of Communication Faults | 2009-02-03 | Paper |
| On the Size Complexity of Rotating and Sweeping Automata | 2008-10-30 | Paper |
| Online Bandwidth Allocation | 2008-09-25 | Paper |
| Reoptimization of Steiner Trees | 2008-07-15 | Paper |
| On fractional dynamic faults with thresholds | 2008-06-24 | Paper |
| Rapid Almost-Complete Broadcasting in Faulty Networks | 2007-11-15 | Paper |
| Efficient Algorithms for the Spoonerism Problem | 2007-11-15 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Time and space complexity of reversible pebbling | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473997 | 2004-08-04 | Paper |
