| Publication | Date of Publication | Type |
|---|
| A characterisation of functions computable in polynomial time and space over the reals with discrete ordinary differential equations: simulation of Turing machines with analytic discrete ODEs | 2024-12-03 | Paper |
| Theoretical computer science: computability, decidability and logic | 2024-09-11 | Paper |
| Theoretical computer science: computational complexity | 2024-09-11 | Paper |
A continuous characterization of PSPACE using polynomial ordinary differential equations
Journal of Complexity | 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
(available as arXiv preprint) | 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
Theory and Applications of Computability | 2022-01-26 | Paper |
| Surreal fields stable under exponential and logarithmic functions | 2022-01-20 | Paper |
| Playing with population protocols | 2021-01-20 | Paper |
Playing with population protocols
(available as arXiv preprint) | 2021-01-20 | Paper |
| A Universal Ordinary Differential Equation | 2020-05-27 | Paper |
A universal ordinary differential equation
(available as arXiv preprint) | 2020-05-12 | 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
Computational Methods in Systems Biology | 2019-07-25 | Paper |
Reachability problems for one-dimensional piecewise affine maps
International Journal of Foundations of Computer Science | 2018-07-24 | Paper |
Homonym population protocols
Theory of Computing Systems | 2018-07-23 | Paper |
Some bounds on the computational power of piecewise constant derivative systems
Automata, Languages and Programming | 2018-07-04 | Paper |
On the complexity of bounded time and precision reachability for piecewise affine systems
Theoretical Computer Science | 2018-06-05 | Paper |
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
Journal of the ACM | 2018-05-17 | Paper |
Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length: the general purpose analog computer and computable analysis are two efficiently equivalent models of computations
(available as arXiv preprint) | 2017-12-19 | Paper |
On the functions generated by the general purpose analog computer
Information and Computation | 2017-11-16 | Paper |
On the functions generated by the general purpose analog computer
Information and Computation | 2017-11-16 | Paper |
Computing with polynomial ordinary differential equations
Journal of Complexity | 2016-09-01 | Paper |
Axiomatizing analog algorithms
Pursuit of the Universal | 2016-08-17 | Paper |
Rigorous numerical computation of polynomial differential equations over unbounded domains
Mathematical Aspects of Computer and Information Sciences | 2016-05-25 | Paper |
On the complexity of bounded time reachability for piecewise affine systems
Lecture Notes in Computer Science | 2015-10-28 | Paper |
On the complexity of solving initial value problems
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation | 2015-03-27 | Paper |
| From chemical rules to term rewriting | 2013-12-04 | Paper |
Computability and computational complexity of the evolution of nonlinear dynamical systems
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Computation with perturbed dynamical systems
Journal of Computer and System Sciences | 2013-07-24 | Paper |
Population protocols on graphs: a hierarchy
Unconventional Computation and Natural Computation | 2013-06-28 | Paper |
Turing machines can be efficiently simulated by the general purpose analog computer
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Safe recursion over an arbitrary structure: PAR, PH and DPH
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Computing with Large Populations Using Interactions
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Towards an Axiomatization of Simple Analog Algorithms
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Solving analytic differential equations in polynomial time over unbounded domains
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
On the number of binary-minded individuals required to compute \(\sqrt {\frac 12}\)
Theoretical Computer Science | 2011-05-10 | Paper |
Distributed learning of equilibria in a routing game
Parallel Processing Letters | 2010-09-29 | Paper |
Robust Computations with Dynamical Systems
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
On the convergence of population protocols when population goes to infinity
Applied Mathematics and Computation | 2009-11-13 | Paper |
On the Computational Capabilities of Several Models
Lecture Notes in Computer Science | 2009-03-05 | Paper |
Distributed Learning of Wardrop Equilibria
Unconventional Computing | 2008-12-02 | Paper |
Proving Positive Almost Sure Termination Under Strategies
Lecture Notes in Computer Science | 2008-09-25 | Paper |
| A survey on continuous time computations | 2008-04-29 | Paper |
Polynomial differential equations compute all real computable functions on computable compact intervals
Journal of Complexity | 2007-07-04 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
| Recursive analysis characterized as a class of real recursive functions | 2007-01-19 | Paper |
How much can analog and hybrid systems be proved (super-)Turing
Applied Mathematics and Computation | 2006-08-04 | Paper |
Implicit complexity over an arbitrary structure: Quantifier alternations
Information and Computation | 2006-04-28 | Paper |
Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
Theoretical Computer Science | 2006-01-09 | Paper |
Machines, Computations, and Universality
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
Journal Of Logic And Computation | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2163035 (Why is no real title available?) | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2090711 (Why is no real title available?) | 2004-08-13 | Paper |
| scientific article; zbMATH DE number 2090077 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2043521 (Why is no real title available?) | 2004-02-16 | Paper |
| scientific article; zbMATH DE number 2043519 (Why is no real title available?) | 2004-02-16 | Paper |
| scientific article; zbMATH DE number 1956513 (Why is no real title available?) | 2003-07-30 | Paper |
The mortality problem for matrices of low dimensions
Theory of Computing Systems | 2002-12-01 | Paper |
The stability of saturated linear dynamical systems is undecidable
Journal of Computer and System Sciences | 2002-10-15 | Paper |
| scientific article; zbMATH DE number 1670871 (Why is no real title available?) | 2001-11-11 | Paper |
Deciding stability and mortality of piecewise affine dynamical systems
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1500537 (Why is no real title available?) | 2001-06-28 | Paper |
| scientific article; zbMATH DE number 1444339 (Why is no real title available?) | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1303061 (Why is no real title available?) | 1999-12-02 | Paper |
Some bounds on the computational power of piecewise constant derivative systems
Theory of Computing Systems | 1999-02-02 | Paper |
Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
Theoretical Computer Science | 1999-01-12 | Paper |
On the computational power of dynamical systems and hybrid systems
Theoretical Computer Science | 1997-02-27 | Paper |
