| Publication | Date of Publication | Type |
|---|
| Closure properties of synchronized relations | 2022-07-18 | Paper |
| Algorithmic identification of probabilities is hard | 2018-05-08 | Paper |
| Bisimulations on Data Graphs | 2018-03-07 | Paper |
| Axiomatizations for downward XPath on data trees | 2017-09-07 | Paper |
| Model theory of XPath on data trees. II: Binary bisimulation and definability | 2017-09-04 | Paper |
| Logics of Repeating Values on Data Trees and Branching Counter Systems | 2017-05-19 | Paper |
| Counting the changes of random Δ20 sets | 2016-01-28 | Paper |
| Linearizing well quasi-orders and bounding the length of bad sequences | 2015-10-12 | Paper |
| Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization | 2015-08-25 | Paper |
| Feasible analysis, randomness, and base invariance | 2015-07-20 | Paper |
| Normality in non-integer bases and polynomial time randomness | 2015-07-13 | Paper |
| Definability for Downward and Vertical XPath on Data Trees | 2015-01-13 | Paper |
| Characterization, definability and separation via saturated models | 2014-06-10 | Paper |
| Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies | 2014-06-10 | Paper |
| Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders | 2012-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904050 | 2012-08-05 | Paper |
| Completeness results for memory logics | 2012-04-10 | Paper |
| THE EXPRESSIVE POWER OF MEMORY LOGICS | 2011-10-21 | Paper |
| Using Logic in the Generation of Referring Expressions | 2011-07-01 | Paper |
| Basic Model Theory for Memory Logics | 2011-05-27 | Paper |
| On the Expressive Power of IF-Logic with Classical Negation | 2011-05-27 | Paper |
| Counting the Changes of Random ${\Delta^0_2}$ Sets | 2010-07-29 | Paper |
| On the formal semantics of IF-like logics | 2010-07-08 | Paper |
| On the computing power of fuzzy Turing machines | 2009-08-28 | Paper |
| Indifferent Sets | 2009-04-16 | Paper |
| Completeness Results for Memory Logics | 2009-02-24 | Paper |
| Classical Computability and Fuzzy Turing Machines | 2008-09-18 | Paper |
| Expressive Power and Decidability for Memory Logics | 2008-07-10 | Paper |
| On the Formal Semantics of IF-Like Logics | 2008-07-10 | Paper |
| Lowness properties and approximations of the jump | 2008-03-28 | Paper |
| Turing's unpublished algorithm for normal numbers | 2007-06-06 | Paper |
| Randomness and universal machines | 2007-02-08 | Paper |
| Randomness and halting probabilities | 2007-01-19 | Paper |
| Program size complexity for possibly infinite computations | 2005-07-06 | Paper |
| Kolmogorov complexity for possibly infinite computations | 2005-05-13 | Paper |
| An example of a computable absolutely normal number | 2002-03-03 | Paper |
