| Publication | Date of Publication | Type |
|---|
Two-Way Non-Uniform Finite Automata
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Determinism and Nondeterminism in Finite Automata with Advice
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Improved Lower Bounds for Shoreline Search
Structural Information and Communication Complexity | 2022-09-01 | Paper |
Exploration of Time-Varying Connected Graphs with Silent Agents
Structural Information and Communication Complexity | 2022-09-01 | Paper |
| scientific article; zbMATH DE number 7559401 (Why is no real title available?) | 2022-07-18 | Paper |
Randomized online computation with high probability guarantees
Algorithmica | 2022-05-03 | Paper |
| Two-way non-uniform finite automata | 2022-03-25 | Paper |
Tight hierarchy of data-independent multi-head automata
Journal of Computer and System Sciences | 2020-09-07 | Paper |
| Treasure hunt with barely communicating agents | 2020-07-30 | Paper |
| Computing with advice: when knowledge helps | 2018-09-04 | Paper |
Online graph coloring against a randomized adversary
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 |
Edge-editing to a dense and a sparse graph class
LATIN 2016: Theoretical Informatics | 2016-05-03 | 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 |
Advice complexity of maximum independent set in sparse and bipartite graphs
Theory of Computing Systems | 2015-05-12 | Paper |
Advice complexity: quantitative approach to a-priori information. Extended abstract
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Determinism vs. nondeterminism for two-way automata: representing the meaning of states by logical formulæ
International Journal of Foundations of Computer Science | 2014-08-04 | Paper |
Antibandwidth and cyclic antibandwidth of Hamming graphs
Discrete Applied Mathematics | 2014-04-16 | Paper |
Efficient routing in carrier-based mobile networks
Theoretical Computer Science | 2014-01-13 | Paper |
Antibandwidth and cyclic antibandwidth of Hamming graphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Independent set with advice: the impact of graph knowledge (extended abstract)
Approximation and Online Algorithms | 2013-09-13 | Paper |
Exploring an unknown dangerous graph using tokens
Theoretical Computer Science | 2013-03-04 | Paper |
Determinism vs. nondeterminism for two-way automata. Representing the meaning of states by logical formulæ
Developments in Language Theory | 2012-11-02 | Paper |
Online graph exploration with advice
Structural Information and Communication Complexity | 2012-09-26 | Paper |
On the advice complexity of the \(k\)-server problem
Automata, Languages and Programming | 2011-07-06 | Paper |
Information complexity of online problems
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Periodic data retrieval problem in rings containing a malicious host (extended abstract)
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Black hole search in directed graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
On the Advice Complexity of Online Problems
Algorithms and Computation | 2009-12-17 | Paper |
Measuring the problem-relevant information in input
RAIRO - Theoretical Informatics and Applications | 2009-07-15 | Paper |
Measuring the problem-relevant information in input
RAIRO - Theoretical Informatics and Applications | 2009-07-15 | Paper |
Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing
Theoretical Computer Science | 2009-06-22 | Paper |
Rapid almost-complete broadcasting in faulty networks
Theoretical Computer Science | 2009-03-30 | Paper |
Minimum feedback vertex sets in shuffle-based interconnection networks
Information Processing Letters | 2009-03-23 | Paper |
On Fractional Dynamic Faults with Threshold
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Deterministic Models of Communication Faults
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Online Bandwidth Allocation
Algorithms – ESA 2007 | 2008-09-25 | Paper |
On fractional dynamic faults with thresholds
Theoretical Computer Science | 2008-06-24 | Paper |
How Much Information about the Future Is Needed?
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Rapid Almost-Complete Broadcasting in Faulty Networks
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Eliminating graphs by means of parallel knock-out schemes
Discrete Applied Mathematics | 2007-02-19 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
| scientific article; zbMATH DE number 2206367 (Why is no real title available?) | 2005-09-19 | Paper |
Sparse topologies with small spectrum size
Theoretical Computer Science | 2004-10-27 | Paper |
On time versus size for monotone dynamic monopolies in regular topologies
Journal of Discrete Algorithms | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080927 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1760012 (Why is no real title available?) | 2002-11-06 | Paper |
| scientific article; zbMATH DE number 1688366 (Why is no real title available?) | 2002-01-09 | Paper |
The complexity of shortest path and dilation bounded interval routing
Theoretical Computer Science | 2000-08-21 | Paper |
