| Publication | Date of Publication | Type |
|---|
Characterising choiceless polynomial time with first-order interpretations
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| A unified approach to boundedness properties in MSO | 2017-08-31 | Paper |
| Graph searching games and width measures for directed graphs | 2017-01-24 | Paper |
Model-theoretic properties of \(\omega\)-automatic structures
Theory of Computing Systems | 2015-02-05 | Paper |
\(\mathsf{MPIDepQBF}\): towards parallel QBF solving without knowledge sharing
Lecture Notes in Computer Science | 2014-09-26 | Paper |
| Directed Width Measures and Monotonicity of Directed Graph Searching | 2014-08-20 | Paper |
Experiments with reduction finding
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
| Cardinality and counting quantifiers on omega-automatic structures | 2013-03-19 | Paper |
| Model checking games for the quantitative \(\mu\)-calculus | 2013-03-19 | Paper |
Entanglement and the complexity of directed graphs
Theoretical Computer Science | 2013-01-07 | Paper |
| A counting logic for structure transition systems | 2012-11-22 | Paper |
Degrees of lookahead in regular infinite games
Logical Methods in Computer Science | 2012-10-22 | Paper |
Solving counter parity games
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Model checking the quantitative \(\mu \)-calculus on linear hybrid systems
Logical Methods in Computer Science | 2012-09-25 | Paper |
| A perfect-information construction for coordination in games | 2012-08-31 | Paper |
| The field of reals is not \(\omega\)-automatic | 2012-08-23 | Paper |
Logic and games on automatic structures. Playing with quantifiers and decompositions
Lecture Notes in Computer Science | 2011-07-25 | Paper |
Model checking the quantitative \(\mu \)-calculus on linear hybrid systems
Automata, Languages and Programming | 2011-07-07 | Paper |
Model checking the quantitative \(\mu \)-calculus on linear hybrid systems
Automata, Languages and Programming | 2011-07-07 | Paper |
Expressing cardinality quantifiers in monadic second-order logic over chains
Journal of Symbolic Logic | 2011-06-28 | Paper |
Information tracking in games on graphs
Journal of Logic, Language and Information | 2011-01-07 | Paper |
Expressing cardinality quantifiers in monadic second-order logic over trees
Fundamenta Informaticae | 2011-01-03 | Paper |
Model checking games for the quantitative \(\mu \)-calculus
Theory of Computing Systems | 2010-10-06 | Paper |
New algorithm for weak monadic second-order logic on inductive structures
Computer Science Logic | 2010-09-03 | Paper |
| What kind of memory is needed to win infinitary Muller games? | 2010-07-09 | Paper |
Degrees of lookahead in regular infinite games
Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
Cardinality Quantifiers in MLO over Trees
Computer Science Logic | 2009-11-12 | Paper |
Directed Graphs of Entanglement Two
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Synthesis for Structure Rewriting Systems
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Game Quantification on Automatic Structures and Hierarchical Model Checking Games
Computer Science Logic | 2009-03-12 | Paper |
Foundations of Software Science and Computational Structures
Lecture Notes in Computer Science | 2005-11-10 | Paper |
