| Publication | Date of Publication | Type |
|---|
| Reachability in dynamical systems with rounding | 2026-03-23 | Paper |
On polynomial-time decidability of \(k\)-negations fragments of first-order theories
Logical Methods in Computer Science | 2026-03-23 | Paper |
| On the computation of the Zariski closure of finitely generated groups of matrices | 2025-01-17 | Paper |
| The membership problem for hypergeometric sequences with rational parameters | 2025-01-17 | Paper |
| On polynomial-time decidability of \(k\)-negations fragments of FO theories (extended abstract) | 2024-12-03 | Paper |
| Provable dual attacks on learning with errors | 2024-11-13 | Paper |
| On the Monniaux problem in abstract interpretation | 2024-04-19 | Paper |
On the decidability of reachability in continuous time linear time-invariant systems
Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control | 2024-02-21 | Paper |
A continuous characterization of PSPACE using polynomial ordinary differential equations
Journal of Complexity | 2023-06-07 | Paper |
scientific article; zbMATH DE number 7559488 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
A Survey on Analog Models of Computation
Theory and Applications of Computability | 2022-01-26 | Paper |
| On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices | 2021-06-03 | Paper |
Polynomial Invariants for Affine Programs
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 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 |
On the decidability of membership in matrix-exponential semigroups
Journal of the ACM | 2020-02-11 | Paper |
On the decidability of reachability in linear time-invariant systems
Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control | 2019-10-22 | Paper |
On the decidability of reachability in linear time-invariant systems
Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control | 2019-10-22 | Paper |
Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem
Theory of Computing Systems | 2019-08-27 | 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 |
Algebraic Invariants for Linear Hybrid Automata
(available as arXiv preprint) | 2019-02-27 | Paper |
Model checking flat Freeze LTL on one-counter automata
(available as arXiv preprint) | 2019-01-18 | 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 |
Solvability of Matrix-Exponential Equations
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Solvability of Matrix-Exponential Equations
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| Semialgebraic invariant synthesis for the Kannan-Lipton orbit problem | 2018-04-19 | Paper |
| Model checking flat freeze LTL on one-counter automata | 2018-03-21 | Paper |
On the Decidability of Reachability in Linear Time-Invariant Systems
(available as arXiv preprint) | 2018-02-19 | 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 |
| Explicit Error Bounds for Carleman Linearization | 2017-11-07 | Paper |
Computing with polynomial ordinary differential equations
Journal of Complexity | 2016-09-01 | Paper |
Rigorous numerical computation of polynomial differential equations over unbounded domains
Mathematical Aspects of Computer and Information Sciences | 2016-05-25 | Paper |
Computational complexity of solving polynomial differential equations over unbounded domains
Theoretical Computer Science | 2016-03-31 | 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 |
Computability and computational complexity of the evolution of nonlinear dynamical systems
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Turing machines can be efficiently simulated by the general purpose analog computer
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Solving analytic differential equations in polynomial time over unbounded domains
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
