| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7650909 (Why is no real title available?) | 2023-02-07 | Paper |
Lower bounds for arithmetic circuits via the Hankel matrix
Computational Complexity | 2021-11-24 | Paper |
| Higher-order recursion schemes and their automata models | 2021-11-12 | Paper |
How Good Is a Strategy in a Game with Nature?
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
Pure Strategies in Imperfect Information Stochastic Games
Fundamenta Informaticae | 2018-10-26 | Paper |
How good is a strategy in a game with Nature?
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Automata on infinite trees with equality and disequality constraints between siblings
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Streaming Property Testing of Visibly Pushdown Languages *
(available as arXiv preprint) | 2018-03-02 | Paper |
Two-way two-tape automata
(available as arXiv preprint) | 2017-10-13 | Paper |
Erratum for “Randomization in Automata on Infinite Trees”
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Collapsible pushdown automata and labeled recursion schemes, equivalence, safety and effective selection
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
| Emptiness Of Alternating Tree Automata Using Games With Imperfect Information | 2017-02-21 | Paper |
Counting branches in trees using games
Information and Computation | 2016-12-22 | Paper |
Marking shortest paths on pushdown graphs does not preserve MSO decidability
Information Processing Letters | 2016-07-07 | Paper |
Randomization in automata on infinite trees
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
C-SHORe: a collapsible approach to higher-order verification
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming | 2015-03-30 | Paper |
Pushdown module checking with imperfect information
Information and Computation | 2013-06-06 | Paper |
A Saturation Method for Collapsible Pushdown Systems
Automata, Languages, and Programming | 2012-11-01 | Paper |
Parity games on undirected graphs
Information Processing Letters | 2012-10-23 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Qualitative Concurrent Stochastic Games with Imperfect Information
Automata, Languages and Programming | 2009-07-14 | Paper |
Note on winning positions on pushdown games with \(\omega\)-regular conditions
Information Processing Letters | 2009-03-23 | Paper |
Tree Pattern Rewriting Systems
Automated Technology for Verification and Analysis | 2008-11-20 | Paper |
Regularity Problems for Visibly Pushdown Languages
STACS 2006 | 2008-03-19 | Paper |
Propositional dynamic logic with recursive programs
The Journal of Logic and Algebraic Programming | 2007-08-23 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Games with winning conditions of high Borel complexity
Theoretical Computer Science | 2006-03-20 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Vectorial languages and linear temporal logic
Theoretical Computer Science | 2004-10-27 | Paper |
