| Publication | Date of Publication | Type |
|---|
| A continuous characterization of PSPACE using polynomial ordinary differential equations | 2023-06-07 | Paper |
| Computability, Complexity and Programming with Ordinary Differential Equations | 2023-02-07 | Paper |
| A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations | 2022-12-09 | Paper |
| Programming with ordinary differential equations: some first steps towards a programming language | 2022-12-07 | Paper |
| Surreal fields stable under exponential, logarithmic, derivative and anti-derivative functions | 2022-10-25 | Paper |
| A Survey on Analog Models of Computation | 2022-01-26 | Paper |
| Surreal fields stable under exponential and logarithmic functions | 2022-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5145145 | 2021-01-20 | Paper |
| A Universal Ordinary Differential Equation | 2020-05-27 | Paper |
| A Universal Ordinary Differential Equation | 2020-05-12 | Paper |
| Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs | 2019-07-25 | Paper |
| Reachability Problems for One-Dimensional Piecewise Affine Maps | 2018-07-24 | Paper |
| Homonym population protocols | 2018-07-23 | Paper |
| Some bounds on the computational power of piecewise constant derivative systems (extended abstract) | 2018-07-04 | Paper |
| On the complexity of bounded time and precision reachability for piecewise affine systems | 2018-06-05 | Paper |
| Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length | 2018-05-17 | Paper |
| Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version) | 2017-12-19 | Paper |
| On the functions generated by the general purpose analog computer | 2017-11-16 | Paper |
| Computing with polynomial ordinary differential equations | 2016-09-01 | Paper |
| Axiomatizing Analog Algorithms | 2016-08-17 | Paper |
| Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains | 2016-05-25 | Paper |
| On The Complexity of Bounded Time Reachability for Piecewise Affine Systems | 2015-10-28 | Paper |
| On the complexity of solving initial value problems | 2015-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2863876 | 2013-12-04 | Paper |
| Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems | 2013-08-05 | Paper |
| Computation with perturbed dynamical systems | 2013-07-24 | Paper |
| Population Protocols on Graphs: A Hierarchy | 2013-06-28 | Paper |
| Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer | 2013-05-28 | Paper |
| Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH | 2013-04-19 | Paper |
| Computing with Large Populations Using Interactions | 2012-09-25 | Paper |
| Towards an Axiomatization of Simple Analog Algorithms | 2012-07-16 | Paper |
| Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains | 2011-08-17 | Paper |
| On the number of binary-minded individuals required to compute \(\sqrt {\frac 12}\) | 2011-05-10 | Paper |
| Distributed learning of equilibria in a routing game | 2010-09-29 | Paper |
| Robust Computations with Dynamical Systems | 2010-09-03 | Paper |
| On the convergence of population protocols when population goes to infinity | 2009-11-13 | Paper |
| On the Computational Capabilities of Several Models | 2009-03-05 | Paper |
| Distributed Learning of Wardrop Equilibria | 2008-12-02 | Paper |
| Proving Positive Almost Sure Termination Under Strategies | 2008-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5384983 | 2008-04-29 | Paper |
| Polynomial differential equations compute all real computable functions on computable compact intervals | 2007-07-04 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416089 | 2007-01-19 | Paper |
| How much can analog and hybrid systems be proved (super-)Turing | 2006-08-04 | Paper |
| Implicit complexity over an arbitrary structure: Quantifier alternations | 2006-04-28 | Paper |
| Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions | 2006-01-09 | Paper |
| Machines, Computations, and Universality | 2005-12-08 | Paper |
| Term Rewriting and Applications | 2005-11-11 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673422 | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813206 | 2004-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808751 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4447221 | 2004-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4447223 | 2004-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417859 | 2003-07-30 | Paper |
| The mortality problem for matrices of low dimensions | 2002-12-01 | Paper |
| The stability of saturated linear dynamical systems is undecidable | 2002-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754197 | 2001-11-11 | Paper |
| Deciding stability and mortality of piecewise affine dynamical systems | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501556 | 2001-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953376 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249563 | 1999-12-02 | Paper |
| Some bounds on the computational power of piecewise constant derivative systems | 1999-02-02 | Paper |
| Achilles and the tortoise climbing up the hyper-arithmetical hierarchy | 1999-01-12 | Paper |
| On the computational power of dynamical systems and hybrid systems | 1997-02-27 | Paper |
