| Publication | Date of Publication | Type |
|---|
| Automatic presentations of structures | 2023-12-12 | Paper |
| Automatic Equivalence Structures of Polynomial Growth. | 2023-02-07 | Paper |
| String compression in FA-presentable structures | 2023-02-01 | Paper |
| Random Subgroups of Rationals | 2022-07-21 | Paper |
| Deciding Parity Games in Quasi-polynomial Time | 2022-05-03 | Paper |
| The isomorphism problem for tree-automatic ordinals with addition | 2019-09-20 | Paper |
| Degree spectra of unary relations on $\langle \omega, \leq \rangle$ | 2019-04-23 | Paper |
| A brief excursion to parity games | 2018-11-22 | Paper |
| Finitely generated semiautomatic groups | 2018-09-20 | Paper |
| A quest for algorithmically random infinite structures | 2018-04-23 | Paper |
| Semiautomatic structures | 2018-02-01 | Paper |
| Deciding parity games in quasipolynomial time | 2017-08-17 | Paper |
| A quest for algorithmically random infinite structures. II | 2017-07-21 | Paper |
| Automatic linear orders and trees | 2017-07-12 | Paper |
| Algorithmically random universal algebras | 2017-03-31 | Paper |
| Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals | 2016-12-21 | Paper |
| Decision Problems for Finite Automata over Infinite Algebraic Structures | 2016-11-09 | Paper |
| Linear orders realized by c.e. equivalence relations | 2016-08-19 | Paper |
| Finitely generated semiautomatic groups | 2016-08-17 | Paper |
| Cayley automatic representations of wreath products | 2016-06-23 | Paper |
| Tree-automatic scattered linear orders | 2016-03-31 | Paper |
| Reducibilities among equivalence relations induced by recursively enumerable structures | 2015-12-15 | Paper |
| Dynamic interval scheduling for multiple machines | 2015-09-11 | Paper |
| Graphs realised by r.e. equivalence relations | 2015-06-17 | Paper |
| Dynamic algorithms for monotonic interval scheduling problem | 2014-12-02 | Paper |
| On automatic transitive graphs | 2014-10-14 | Paper |
| Semiautomatic structures | 2014-06-24 | Paper |
| From automatic structures to automatic groups. | 2014-06-19 | Paper |
| Finitely presented expansions of groups, semigroups, and algebras | 2014-03-12 | Paper |
| Dynamising Interval Scheduling: The Monotonic Case | 2014-01-17 | Paper |
| Limitwise monotonic sequences and degree spectra of structures | 2013-08-30 | Paper |
| On decidable and computable models of theories | 2013-08-05 | Paper |
| Finitely presented expansions of computably enumerable semigroups | 2013-02-21 | Paper |
| Computable isomorphisms of Boolean algebras with operators | 2012-12-12 | Paper |
| On state complexity of finite word and tree languages | 2012-11-02 | Paper |
| Finite automata over structures (extended abstract) | 2012-07-16 | Paper |
| Efficient algorithms for games played on trees with back-edges | 2012-03-22 | Paper |
| Extracting winning strategies in update games | 2011-09-09 | Paper |
| Model-theoretic complexity of automatic structures | 2011-08-26 | Paper |
| On complexity of Ehrenfeucht-Fraïssé games | 2011-08-26 | Paper |
| Lectures on discrete mathematics for computer science | 2011-06-10 | Paper |
| Automatic structures and groups | 2011-06-03 | Paper |
| Three lectures on automatic structures | 2011-03-02 | Paper |
| On Index Sets of Some Properties of Computable Algebras | 2010-07-29 | Paper |
| A computable ℵ0-categorical structure whose theory computes true arithmetic | 2010-06-24 | Paper |
| A Dynamic Algorithm for Reachability Games Played on Trees | 2009-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396632 | 2009-09-19 | Paper |
| Unary automatic graphs: an algorithmic perspective | 2009-03-24 | Paper |
| Linear orders with distinguished function symbol | 2009-03-17 | Paper |
| Computable categoricity and the Ershov hierarchy | 2008-12-05 | Paper |
| When Is Reachability Intrinsically Decidable? | 2008-10-30 | Paper |
| Computable Categoricity of Graphs with Finite Components | 2008-06-19 | Paper |
| Model Theoretic Complexity of Automatic Structures (Extended Abstract) | 2008-05-27 | Paper |
| Unary Automatic Graphs: An Algorithmic Perspective | 2008-05-27 | Paper |
| On Complexity of Ehrenfeucht-Fraïssé Games | 2008-01-04 | Paper |
| Applications of Kolmogorov complexity to computable model theory | 2007-10-17 | Paper |
| Automatic Structures: Richness and Limitations | 2007-10-11 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| On the computability-theoretic complexity of trivial, strongly minimal models | 2007-09-27 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| Update games and update networks | 2007-04-26 | Paper |
| Computer Science Logic | 2006-11-01 | Paper |
| An uncountably categorical theory whose only computably presentable model is saturated | 2006-10-04 | Paper |
| \(\Pi^0_1\)-presentations of algebras | 2006-09-26 | Paper |
| Complexity of Categorical Theories with Computable Models | 2006-07-18 | Paper |
| COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS | 2005-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677706 | 2005-05-12 | Paper |
| A computably categorical structure whose expansion by a constant has infinite computable dimension | 2005-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474121 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460839 | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449538 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452102 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414504 | 2003-07-25 | Paper |
| On algebraic and logical specifications of classes of regular languages. | 2003-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329175 | 2003-01-30 | Paper |
| Degree spectra and computable dimensions in algebraic structures | 2002-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766676 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4531374 | 2002-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4443209 | 2002-01-01 | Paper |
| Recursively enumerable reals and Chaitin \(\Omega\) numbers | 2001-08-20 | Paper |
| On Computability Theoretic Properties of Structures and Their Cartesian Products | 2001-07-16 | Paper |
| Automata theory and its applications | 2001-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4513969 | 2001-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762457 | 2001-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499284 | 2001-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520522 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526383 | 2001-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938551 | 2000-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501152 | 2000-09-03 | Paper |
| Finite nondeterministic automata: simulation and minimality | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938557 | 2000-07-24 | Paper |
| Computably categorical structures and expansions by constants | 2000-01-09 | Paper |
| Decidable Kripke models of intuitionistic theories | 1999-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217601 | 1999-10-28 | Paper |
| Computable isomorphisms, degree spectra of relations, and Scott families | 1999-08-16 | Paper |
| On initial segments of computable linear orders | 1999-06-27 | Paper |
| Randnomness, computability, and algebraic specifications | 1999-06-27 | Paper |
| Computable Kripke models and intermediate logics | 1999-01-18 | Paper |
| Deterministic automata. Simulation, universality and minimality | 1998-06-11 | Paper |
| Games with Unknown Past | 1998-06-08 | Paper |
| Computable models of theories with few models | 1998-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381402 | 1998-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4355686 | 1997-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4850551 | 1995-10-17 | Paper |
