| 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France | 0 | 0.34 | 2022 |
| Transducers of polynomial growth | 0 | 0.34 | 2022 |
| 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference. | 0 | 0.34 | 2021 |
| ICALP 2022 - 49th EATCS International Colloquium on Automata, Languages and Programming. | 0 | 0.34 | 2021 |
| The Presburger Award for Young Scientists 2021 - Call for Nominations. | 0 | 0.34 | 2020 |
| MSO+∇ is undecidable | 0 | 0.34 | 2019 |
| MSO+nabla is undecidable. | 0 | 0.34 | 2019 |
| EATCS Fellows 2020 - Call for Nominations. | 0 | 0.34 | 2019 |
| Foundations of Software Science and Computation Structures - 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings. | 0 | 0.34 | 2019 |
| Polyregular Functions. | 0 | 0.34 | 2018 |
| Definable decompositions for graphs of bounded linear cliquewidth. | 1 | 0.35 | 2018 |
| On computability and tractability for infinite sets. | 0 | 0.34 | 2018 |
| Regular and First Order List Functions. | 0 | 0.34 | 2018 |
| A non-regular language of infinite trees that is recognizable by a finite algebra. | 0 | 0.34 | 2018 |
| Regular and First-Order List Functions. | 0 | 0.34 | 2018 |
| Undecidability of MSO+"ultimately periodic". | 0 | 0.34 | 2018 |
| Two monads for graphs. | 0 | 0.34 | 2018 |
| Which Classes of Origin Graphs Are Generated by Transducers. | 2 | 0.38 | 2017 |
| It is undecidable if two regular tree languages can be separated by a deterministic tree-walking automaton. | 0 | 0.34 | 2017 |
| Emptiness of zero automata is decidable. | 2 | 0.40 | 2017 |
| Optimizing tree decompositions in MSO. | 2 | 0.38 | 2017 |
| Some connections between universal algebra and logics for trees. | 0 | 0.34 | 2017 |
| Orbit-Finite Sets and Their Algorithms (Invited Talk). | 0 | 0.34 | 2017 |
| Regular Languages of Thin Trees | 0 | 0.34 | 2016 |
| Thin MSO with a Probabilistic Path Quantifier. | 2 | 0.51 | 2016 |
| Decidable Extensions of MSO. | 0 | 0.34 | 2016 |
| On The Regular Emptiness Problem Of Subzero Automata | 1 | 0.51 | 2016 |
| Definability equals recognizability for graphs of bounded treewidth. | 5 | 0.44 | 2016 |
| Circuits, Logic and Games (Dagstuhl Seminar 15401). | 0 | 0.34 | 2015 |
| Recognisable Languages Over Monads | 13 | 0.91 | 2015 |
| The MSO+U Theory of (N, <) Is Undecidable. | 4 | 0.43 | 2015 |
| Star Height via Games | 2 | 0.37 | 2015 |
| Containment of Monadic Datalog Programs via Bounded Clique-Width. | 3 | 0.39 | 2015 |
| Automata theory in nominal sets. | 28 | 1.79 | 2014 |
| Decomposition Theorems and Model-Checking for the Modal $μ$-Calculus. | 3 | 0.44 | 2014 |
| Weak MSO plus U with Path Quantifiers over Infinite Trees | 1 | 0.36 | 2014 |
| On the Decidability of MSO plus U on Infinite Trees | 5 | 0.54 | 2014 |
| Transducers with Origin Information. | 6 | 0.50 | 2013 |
| Modelling Infinite Structures with Atoms. | 3 | 0.42 | 2013 |
| Nominal Computation Theory (Dagstuhl Seminar 13422). | 0 | 0.34 | 2013 |
| Nominal Monoids. | 0 | 0.34 | 2013 |
| Regular languages of thin trees. | 0 | 0.34 | 2013 |
| Automata and Algebras for Infinite Words and Trees. | 0 | 0.34 | 2013 |
| Imperative Programming in Sets with Atoms. | 6 | 0.62 | 2012 |
| Minimization of semilinear automata | 1 | 0.37 | 2012 |
| Piecewise Testable Tree Languages | 17 | 0.87 | 2012 |
| Rigidity is undecidable. | 0 | 0.34 | 2012 |
| Weak MSO+U over infinite trees. | 13 | 0.77 | 2012 |
| Towards nominal computation | 13 | 0.74 | 2012 |
| Wreath Products of Forest Algebras, with Applications to Tree Logics | 0 | 0.34 | 2012 |
