| Publication | Date of Publication | Type |
|---|
| Comparing labelled Markov decision processes | 2026-03-23 | Paper |
| On the sequential probability ratio test in hidden Markov models | 2024-08-13 | Paper |
| Strategies for MDP bisimilarity equivalence and inequivalence | 2024-08-13 | Paper |
| Lower bounds for unambiguous automata via communication complexity | 2024-06-24 | Paper |
scientific article; zbMATH DE number 7799626 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
Linear-Time Model Checking Branching Processes
(available as arXiv preprint) | 2023-08-21 | Paper |
| scientific article; zbMATH DE number 7730607 (Why is no real title available?) | 2023-08-21 | Paper |
scientific article; zbMATH DE number 7730613 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-21 | Paper |
Markov chains and unambiguous automata
Journal of Computer and System Sciences | 2023-06-12 | Paper |
Image-binary automata
(available as arXiv preprint) | 2022-11-09 | Paper |
The big-O problem
(available as arXiv preprint) | 2022-08-02 | Paper |
| The big-O problem | 2022-08-02 | Paper |
| On the Sequential Probability Ratio Test in Hidden Markov Models | 2022-07-28 | Paper |
scientific article; zbMATH DE number 7561726 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
On the Complexity of Value Iteration
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561612 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
On Affine Reachability Problems
(available as arXiv preprint) | 2022-07-18 | Paper |
| The big-O problem for labelled Markov chains and weighted automata | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559495 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| On finite monoids over nonnegative integer matrices and short killing words | 2022-07-18 | Paper |
On complementing unambiguous automata and graphs with many cliques and cocliques
Information Processing Letters | 2022-06-03 | Paper |
| Strategy Complexity of Reachability in Countable Stochastic 2-Player Games | 2022-03-22 | Paper |
Selective monitoring
(available as arXiv preprint) | 2021-08-04 | Paper |
On computing the total variation distance of hidden Markov models
(available as arXiv preprint) | 2021-07-28 | Paper |
On Nonnegative Integer Matrices and Short Killing Words
SIAM Journal on Discrete Mathematics | 2021-06-10 | Paper |
Selective monitoring
Journal of Computer and System Sciences | 2021-02-02 | Paper |
| On strong determinacy of countable stochastic games | 2021-01-19 | Paper |
On strong determinacy of countable stochastic games
(available as arXiv preprint) | 2021-01-19 | Paper |
| Parity objectives in countable MDPs | 2021-01-19 | Paper |
Parity objectives in countable MDPs
(available as arXiv preprint) | 2021-01-19 | Paper |
| scientific article; zbMATH DE number 7297838 (Why is no real title available?) | 2021-01-19 | Paper |
Trace refinement in labelled Markov decision processes
Logical Methods in Computer Science | 2020-06-26 | Paper |
| Counting problems for Parikh images | 2020-05-26 | Paper |
| On the Size of Finite Rational Matrix Semigroups | 2019-09-09 | Paper |
Markov chains and unambiguous Büchi automata
Computer Aided Verification | 2019-05-03 | Paper |
B\"uchi Objectives in Countable MDPs
(available as arXiv preprint) | 2019-04-25 | Paper |
Game characterization of probabilistic bisimilarity, and applications to pushdown automata
(available as arXiv preprint) | 2018-11-30 | Paper |
On rationality of nonnegative matrix factorization
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the total variation distance of labelled Markov chains
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Zero-reachability in probabilistic multi-counter automata
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Long-run average behaviour of probabilistic vector addition systems
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Long-run average behaviour of probabilistic vector addition systems
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
On restricted nonnegative matrix factorization
(available as arXiv preprint) | 2017-12-19 | Paper |
Proving the Herman-protocol conjecture
(available as arXiv preprint) | 2017-12-19 | Paper |
Nonnegative matrix factorization requires irrationality
SIAM Journal on Applied Algebra and Geometry | 2017-07-21 | Paper |
Bisimilarity of pushdown automata is nonelementary
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Minimisation of multiplicity tree automata
Logical Methods in Computer Science | 2017-05-08 | Paper |
Bisimilarity of probabilistic pushdown automata
(available as arXiv preprint) | 2017-01-26 | Paper |
Trace refinement in labelled Markov decision processes
Lecture Notes in Computer Science | 2016-06-10 | Paper |
The complexity of the \(K\)th largest subset problem and related problems
Information Processing Letters | 2015-12-01 | Paper |
The odds of staying on budget
Automata, Languages, and Programming | 2015-11-04 | Paper |
Minimisation of multiplicity tree automata
Lecture Notes in Computer Science | 2015-10-01 | Paper |
Efficient analysis of probabilistic programs with an unbounded counter
Journal of the ACM | 2015-08-14 | Paper |
Runtime analysis of probabilistic programs with unbounded recursion
Journal of Computer and System Sciences | 2014-09-22 | Paper |
A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars
Information Processing Letters | 2014-08-13 | Paper |
Language equivalence of probabilistic pushdown automata
Information and Computation | 2014-07-18 | Paper |
Stability and Complexity of Minimising Probabilistic Automata
Automata, Languages, and Programming | 2014-07-01 | Paper |
Analyzing probabilistic pushdown automata
Formal Methods in System Design | 2014-06-30 | Paper |
Algorithmic probabilistic game semantics. Playing games with automata
Formal Methods in System Design | 2014-06-30 | Paper |
Analysis of probabilistic basic parallel processes
Lecture Notes in Computer Science | 2014-04-16 | Paper |
On the Complexity of Equivalence and Minimisation for Q-weighted Automata
Logical Methods in Computer Science | 2013-04-09 | Paper |
Parikh's theorem: a simple and direct automaton construction
Information Processing Letters | 2013-03-28 | Paper |
Three tokens in Herman's algorithm
Formal Aspects of Computing | 2013-03-22 | Paper |
BPA bisimilarity is EXPTIME-hard
Information Processing Letters | 2013-03-20 | Paper |
| Convergence thresholds of Newton's method for monotone polynomial equations | 2013-03-19 | Paper |
Convergence thresholds of Newton's method for monotone polynomial equations
(available as arXiv preprint) | 2013-03-19 | Paper |
| On the memory consumption of probabilistic pushdown automata | 2012-10-24 | Paper |
Model Checking Stochastic Branching Processes
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Stabilization of branching queueing networks
(available as arXiv preprint) | 2012-08-23 | Paper |
On the Complexity of the Equivalence Problem for Probabilistic Automata
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
Space-efficient scheduling of stochastically generated tasks
Information and Computation | 2012-05-24 | Paper |
| COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS | 2012-01-23 | Paper |
On stabilization in Herman's algorithm
Automata, Languages and Programming | 2011-07-07 | Paper |
Derivation tree analysis for accelerated fixed-point computation
Theoretical Computer Science | 2011-07-07 | Paper |
Runtime analysis of probabilistic programs with unbounded recursion
Automata, Languages and Programming | 2011-07-07 | Paper |
On probabilistic parallel programs with process creation and synchronisation
Tools and Algorithms for the Construction and Analysis of Systems | 2011-05-19 | Paper |
Newtonian program analysis
Journal of the ACM | 2011-05-16 | Paper |
Computing the least fixed point of positive polynomial systems
SIAM Journal on Computing | 2011-01-17 | Paper |
Space-efficient scheduling of stochastically generated tasks
Automata, Languages and Programming | 2010-09-07 | Paper |
| Scheduling stochastic branching processes | 2009-07-27 | Paper |
| Abstraction refinement with Craig interpolation and symbolic pushdown systems | 2009-04-14 | Paper |
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
| scientific article; zbMATH DE number 5485454 (Why is no real title available?) | 2009-01-05 | Paper |
Derivation Tree Analysis for Accelerated Fixed-Point Computation
Developments in Language Theory | 2008-10-30 | Paper |
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations
Automata, Languages and Programming | 2008-08-28 | Paper |
Newton’s Method for ω-Continuous Semirings
Automata, Languages and Programming | 2008-08-19 | Paper |
An Extension of Newton’s Method to ω-Continuous Semirings
Developments in Language Theory | 2007-11-28 | Paper |
On Fixed Point Equations over Commutative Semirings
STACS 2007 | 2007-09-03 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Memoryless Strategies in Stochastic Reachability Games
(available as arXiv preprint) | N/A | Paper |
"Strategy Complexity of B\""uchi Objectives in Concurrent Stochastic Games"
(available as arXiv preprint) | N/A | Paper |
