| Publication | Date of Publication | Type |
|---|
| The expressiveness of quasiperiodic and minimal shifts of finite type | 2021-03-03 | Paper |
| On the Expressive Power of Quasiperiodic SFT. | 2020-05-26 | Paper |
| An algorithmic approach to characterizations of admissibles | 2020-05-12 | Paper |
| On the structure of Ammann A2 tilings | 2020-04-07 | Paper |
| Tilings and quasiperiodicity | 2018-07-04 | Paper |
| A random NP-complete problem for inversion of 2D cellular automata | 2017-12-04 | Paper |
| Infinite time busy beavers | 2017-08-04 | Paper |
| Admissibles in gaps | 2017-08-04 | Paper |
| Aperiodic tilings and entropy | 2017-02-14 | Paper |
| Quasiperiodicity and Non-computability in Tilings | 2015-09-16 | Paper |
| Complex tilings | 2015-02-27 | Paper |
| Aperiodic Tilings and Entropy | 2014-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910708 | 2013-03-19 | Paper |
| Fixed-point tile sets and their applications | 2012-08-17 | Paper |
| Effective Closed Subshifts in 1D Can Be Implemented in 2D | 2010-09-03 | Paper |
| Tilings Robust to Errors | 2010-04-27 | Paper |
| Kolmogorov-Loveland stochasticity for finite strings | 2009-07-21 | Paper |
| High Complexity Tilings with Sparse Errors | 2009-07-14 | Paper |
| Asymptotic Cellular Complexity | 2009-07-07 | Paper |
| Fixed Point and Aperiodic Tilings | 2008-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3508020 | 2008-06-27 | Paper |
| Complex tilings | 2008-06-09 | Paper |
| A new dimension sensitive property for cellular automata | 2005-12-06 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Local rules and global order, or aperiodic tilings | 2005-05-23 | Paper |
| Tilings: recursivity and regularity | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460870 | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4451022 | 2004-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4451023 | 2004-02-22 | Paper |
| Do stronger definitions of randomness exist? | 2003-08-17 | Paper |
| Number-conserving cellular automata I: Decidability. | 2003-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779148 | 2002-11-25 | Paper |
| From logic to tiling | 2002-07-15 | Paper |
| Descriptive complexity of computable sequences | 2002-03-03 | Paper |
| Comparison between the complexity of a function and the complexity of its graph | 2002-03-03 | Paper |
| Kolmogorov complexity and cellular automata classification | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501557 | 2001-01-29 | Paper |
| Inversion of 2D cellular automata: Some complexity results | 2000-06-27 | Paper |
| The surjectivity problem for 2D cellular automata | 2000-06-21 | Paper |
| Tilings and quasiperiodicity. | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4260392 | 1999-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218151 | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251047 | 1999-06-17 | Paper |
| On the complexity of deadlock detection in families of planar nets | 1999-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375810 | 1998-05-04 | Paper |
| A Random NP-complete problem for inversion of 2D cellular automata | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4848813 | 1996-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284241 | 1994-09-11 | Paper |
