| Publication | Date of Publication | Type |
|---|
On the Balancedness of Tree-to-Word Transducers
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Equivalence of Linear Tree Transducers with Output in the Free Group
Developments in Language Theory | 2022-10-13 | Paper |
On the balancedness of tree-to-word transducers
Developments in Language Theory | 2022-10-13 | Paper |
scientific article; zbMATH DE number 7228439 (Why is no real title available?)
(available as arXiv preprint) | 2020-08-05 | Paper |
Practical synthesis of reactive systems from LTL specifications via parity games
Acta Informatica | 2020-03-06 | Paper |
Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
Language and Automata Theory and Applications | 2016-04-08 | Paper |
\textsc{FPsolve}: a generic solver for fixpoint equations over semirings
International Journal of Foundations of Computer Science | 2016-02-17 | Paper |
Convergence of Newton's method over commutative semirings
Information and Computation | 2015-12-28 | Paper |
FPsolve: a generic solver for fixpoint equations over semirings
Implementation and Application of Automata | 2014-09-26 | Paper |
Solving Parity Games on the GPU
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
A Brief History of Strahler Numbers
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Putting Newton into practice: a solver for polynomial equations over semirings
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
Parikh's theorem: a simple and direct automaton construction
Information Processing Letters | 2013-03-28 | 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 |
Convergence of Newton’s Method over Commutative Semirings
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Space-efficient scheduling of stochastically generated tasks
Information and Computation | 2012-05-24 | Paper |
Solving fixed-point equations by derivation tree analysis
Algebra and Coalgebra in Computer Science | 2011-09-02 | Paper |
Derivation tree analysis for accelerated fixed-point computation
Theoretical Computer Science | 2011-07-07 | 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 |
| Newtonian program analysis -- an introduction | 2010-12-13 | Paper |
Space-efficient scheduling of stochastically generated tasks
Automata, Languages and Programming | 2010-09-07 | Paper |
| Scheduling stochastic branching processes | 2009-07-27 | 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 |
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 |
Reachability Analysis of Procedural Programs with Affine Integer Arithmetic
Implementation and Application of Automata | 2007-09-06 | Paper |
On Fixed Point Equations over Commutative Semirings
STACS 2007 | 2007-09-03 | Paper |
