| 2025 | CiE | Computation with Real Numbers and Continuous-Time Dynamical Systems. | Daniel Silva Graa |
| 2021 | CiE | Computability of Limit Sets for Two-Dimensional Flows. | Daniel Silva Graa, Ning Zhong |
| 2018 | CiE | Computability of Ordinary Differential Equations. | Daniel Silva Graa, Ning Zhong |
| 2016 | ICALP | 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. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly |
| 2013 | CiE | Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly, Ning Zhong |
| 2013 | TAMC | Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly |
| 2012 | ISSAC | On the complexity of solving initial value problems. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly |
| 2011 | MFCS | Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly |
| 2010 | MFCS | Robust Computations with Dynamical Systems. | Olivier Bournez, Daniel Silva Graa, Emmanuel Hainry |
| 2009 | UC | Computing Domains of Attraction for Planar Dynamics. | Daniel Silva Graa, Ning Zhong |
| 2006 | TAMC | The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. | Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graa, Emmanuel Hainry |
| 2005 | CiE | Robust Simulations of Turing Machines with Analytic Maps and Flows. | Daniel Silva Graa, Manuel Lameiras Campagnolo, Jorge Buescu |