| 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 |
| Improved Lower Bounds for Shoreline Search | 2022-09-01 | Paper |
| Exploration of Time-Varying Connected Graphs with Silent Agents | 2022-09-01 | 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 |
| Tight hierarchy of data-independent multi-head automata | 2020-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3300812 | 2020-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584901 | 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 |
| Edge-Editing to a Dense and a Sparse Graph Class | 2016-05-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 |
| Advice Complexity: Quantitative Approach to A-Priori Information | 2015-01-13 | Paper |
| DETERMINISM VS. NONDETERMINISM FOR TWO-WAY AUTOMATA: Representing the Meaning of States by Logical Formulæ | 2014-08-04 | Paper |
| Antibandwidth and cyclic antibandwidth of Hamming graphs | 2014-04-16 | Paper |
| Efficient routing in carrier-based mobile networks | 2014-01-13 | Paper |
| Antibandwidth and cyclic antibandwidth of Hamming graphs | 2013-10-10 | Paper |
| Independent Set with Advice: The Impact of Graph Knowledge | 2013-09-13 | Paper |
| Exploring an unknown dangerous graph using tokens | 2013-03-04 | Paper |
| Determinism vs. Nondeterminism for Two-Way Automata | 2012-11-02 | Paper |
| Online Graph Exploration with Advice | 2012-09-26 | Paper |
| On the Advice Complexity of the k-Server Problem | 2011-07-06 | Paper |
| Information Complexity of Online Problems | 2010-09-03 | Paper |
| Periodic Data Retrieval Problem in Rings Containing a Malicious Host | 2010-06-17 | Paper |
| Black Hole Search in Directed Graphs | 2010-02-24 | Paper |
| On the Advice Complexity of Online Problems | 2009-12-17 | Paper |
| Measuring the problem-relevant information in input | 2009-07-15 | Paper |
| Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing | 2009-06-22 | Paper |
| Rapid almost-complete broadcasting in faulty networks | 2009-03-30 | Paper |
| Minimum feedback vertex sets in shuffle-based interconnection networks | 2009-03-23 | Paper |
| On Fractional Dynamic Faults with Threshold | 2009-03-12 | Paper |
| Deterministic Models of Communication Faults | 2009-02-03 | Paper |
| Online Bandwidth Allocation | 2008-09-25 | Paper |
| On fractional dynamic faults with thresholds | 2008-06-24 | Paper |
| How Much Information about the Future Is Needed? | 2008-03-07 | Paper |
| Rapid Almost-Complete Broadcasting in Faulty Networks | 2007-11-15 | Paper |
| Eliminating graphs by means of parallel knock-out schemes | 2007-02-19 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5317672 | 2005-09-19 | Paper |
| Sparse topologies with small spectrum size | 2004-10-27 | Paper |
| On time versus size for monotone dynamic monopolies in regular topologies | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473996 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536937 | 2002-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762507 | 2002-01-09 | Paper |
| The complexity of shortest path and dilation bounded interval routing | 2000-08-21 | Paper |
