| Publication | Date of Publication | Type |
|---|
| Implicit representation of relations | 2024-01-08 | Paper |
| A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff | 2023-11-17 | Paper |
| Read/write factorizable programs | 2023-08-09 | Paper |
| Subclasses of \textsc{Ptime} interpreted by programming languages | 2023-07-26 | Paper |
| The Expressive Power of One Variable Used Once: The Chomsky Hierarchy and First-Order Monadic Constructor Rewriting. | 2023-06-23 | Paper |
| On representations of real numbers and the computational complexity of converting between such representations | 2023-04-14 | Paper |
| Liouville numbers and the computational complexity of changing bases | 2022-12-16 | Paper |
| On the complexity of conversion between classic real number representations | 2022-12-16 | Paper |
| Subrecursive equivalence relations and (non-)closure under lattice operations | 2022-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5020650 | 2022-01-06 | Paper |
| Agafonov's Proof of Agafonov's Theorem: A Modern Account and New Insights | 2020-07-07 | Paper |
| Term Rewriting Systems as Topological Dynamical Systems | 2020-05-27 | Paper |
| More intensional versions of Rice's theorem | 2020-05-12 | Paper |
| The fixed point property and a technique to harness double fixed point combinators | 2020-02-03 | Paper |
| Computing with Infinite Terms and Infinite Reductions | 2020-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4621149 | 2019-02-08 | Paper |
| Chains, antichains, and complements in infinite partition lattices | 2018-07-16 | Paper |
| Near Optimal Adjacency Labeling Schemes for Power-Law Graphs | 2017-12-19 | Paper |
| Complexity Hierarchies and Higher-Order Cons-Free Rewriting. | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5367046 | 2017-10-12 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| Computing Continuous-Time Markov Chains as Transformers of Unbounded Observables | 2017-05-19 | Paper |
| The Power of Non-determinism in Higher-Order Implicit Complexity | 2017-05-19 | Paper |
| Some remarks on real numbers induced by first-order spectra | 2016-09-01 | Paper |
| Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus | 2015-09-17 | Paper |
| A Confluent Rewriting System Having No Computable, One-Step, Normalizing Strategy | 2015-09-17 | Paper |
| Programs=data=first-class citizens in a computational world | 2015-08-21 | Paper |
| Chains, Antichains, and Complements in Infinite Partition Lattices | 2015-01-21 | Paper |
| An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting | 2014-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414602 | 2014-05-06 | Paper |
| Programming in Biomolecular Computation | 2014-03-21 | Paper |
| An experimental investigation of the normality of irrational algebraic numbers | 2013-07-23 | Paper |
| Characterizing Languages by Normalization and Termination in String Rewriting | 2012-11-02 | Paper |
| The exact hardness of deciding derivational and runtime complexity | 2012-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389133 | 2012-04-25 | Paper |
| Weak Convergence and Uniform Normalization in Infinitary Rewriting | 2012-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389073 | 2012-04-24 | Paper |
| Infinitary combinatory reduction systems | 2011-07-08 | Paper |
| Beta-shifts, their languages, and computability | 2011-03-30 | Paper |
| Levels of undecidability in rewriting | 2011-02-21 | Paper |
| Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies | 2010-07-27 | Paper |
| Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus | 2010-05-04 | Paper |
| Infinitary Combinatory Reduction Systems: Confluence | 2010-01-28 | Paper |
| On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts | 2009-11-06 | Paper |
| On confluence and residuals in Cauchy convergent transfinite rewriting | 2009-07-21 | Paper |
| POETS: process-oriented event-driven transaction systems | 2009-07-20 | Paper |
| The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) | 2009-06-30 | Paper |
| Rewriting Techniques and Applications | 2009-04-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387668 | 2008-05-27 | Paper |
| On Confluence of Infinitary Combinatory Reduction Systems | 2008-05-27 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| On local non‐compactness in recursive mathematics | 2006-08-30 | Paper |
| On modularity in infinitary term rewriting | 2006-07-12 | Paper |
| Term Rewriting and Applications | 2005-11-11 | Paper |
| Specker sequences revisited | 2005-09-26 | Paper |
