Daniel Silva Graça

48 papers A* 1B 3C 10Journal 33Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	C	`conf`	Computation with Real Numbers and Continuous-Time Dynamical Systems. CiE Daniel Silva Graça
2024	J	`jnl`	Robust non-computability of dynamical systems and computability of robust dynamical systems. Log. Methods Comput. Sci. Daniel Silva Graça, Ning Zhong
2023	J	`jnl`	A continuous characterization of PSPACE using polynomial ordinary differential equations. J. Complex. Olivier Bournez, Riccardo Gozzi, Daniel Silva Graça, Amaury Pouly
2023	J	`jnl`	Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines. Comput. Daniel Silva Graça, Ning Zhong
2023	J	`jnl`	Robust non-computability and stability of dynamical systems. CoRR Daniel Silva Graça, Ning Zhong
2021	J	`jnl`	Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines. CoRR Daniel Silva Graça, Ning Zhong
2021	C	`conf`	Computability of Limit Sets for Two-Dimensional Flows. CiE Daniel Silva Graça, Ning Zhong
2021	J	`jnl`	Computing the exact number of periodic orbits for planar flows. CoRR Daniel Silva Graça, Ning Zhong
2021	J	`jnl`	Robustness of non-computability. CoRR Daniel Silva Graça, Ning Zhong
2021	J	`jnl`	The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable. Theor. Comput. Sci. Daniel Silva Graça, Ning Zhong
2020	J	`jnl`	The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable. CoRR Daniel Silva Graça, Ning Zhong
2018	C	`conf`	Computability of Ordinary Differential Equations. CiE Daniel Silva Graça, Ning Zhong
2017	J	`jnl`	Computing geometric Lorenz attractors with arbitrary precision. CoRR Daniel Silva Graça, Cristobal Rojas, Ning Zhong
2017	J	`jnl`	On the functions generated by the general purpose analog computer. Inf. Comput. Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2017	J	`jnl`	Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. J. ACM Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016	J	`jnl`	Computational complexity of solving polynomial differential equations over unbounded domains. Theor. Comput. Sci. Amaury Pouly, Daniel Silva Graça
2016	J	`jnl`	Computing with Polynomial Ordinary Differential Equations. CoRR Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016	J	`jnl`	Computing with polynomial ordinary differential equations. J. Complex. Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016	J	`jnl`	On the Functions Generated by the General Purpose Analog Computer. CoRR Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016	J	`jnl`	Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version). CoRR Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016	A*	`conf`	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. ICALP Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016	J	`jnl`	Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. CoRR Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2015	J	`jnl`	An analytic System with a Computable Hyperbolic Sink Whose Basin of Attraction is Non-Computable. Theory Comput. Syst. Daniel Silva Graça, Ning Zhong
2015	—	`conf`	Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains. MACIS Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2014	J	`jnl`	Computational complexity of solving elementary differential equations over unbounded domains. CoRR Amaury Pouly, Daniel Silva Graça
2013	C	`conf`	Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. CiE Olivier Bournez, Daniel Silva Graça, Amaury Pouly, Ning Zhong
2013	J	`jnl`	Computation with perturbed dynamical systems. J. Comput. Syst. Sci. Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry
2013	C	`conf`	Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. TAMC Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2012	J	`jnl`	Computability, noncomputability, and hyperbolic systems. Appl. Math. Comput. Daniel Silva Graça, Ning Zhong, Jorge Buescu
2012	J	`jnl`	Noncomputability, unpredictability, and financial markets. Complex. Daniel Silva Graça
2012	J	`jnl`	On the complexity of solving initial value problems CoRR Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2012	B	`conf`	On the complexity of solving initial value problems. ISSAC Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2012	J	`jnl`	The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited. Theor. Comput. Sci. Daniel Silva Graça, Ning Zhong, H. S. Dumas
2012	J	`jnl`	Turing machines can be efficiently simulated by the General Purpose Analog Computer. CoRR Amaury Pouly, Olivier Bournez, Daniel Silva Graça
2011	J	`jnl`	Computability in planar dynamical systems. Nat. Comput. Daniel Silva Graça, Ning Zhong
2011	B	`conf`	Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. MFCS Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2010	B	`conf`	Robust Computations with Dynamical Systems. MFCS Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry
2009	J	`jnl`	Computational bounds on polynomial differential equations. Appl. Math. Comput. Daniel Silva Graça, Jorge Buescu, Manuel Lameiras Campagnolo
2009	C	`conf`	Computing Domains of Attraction for Planar Dynamics. UC Daniel Silva Graça, Ning Zhong
2009	J	`jnl`	Effective Computability of Solutions of Differential Inclusions The Ten Thousand Monkeys Approach. J. Univers. Comput. Sci. Pieter Collins, Daniel Silva Graça
2008	J	`jnl`	Computability with polynomial differential equations. Adv. Appl. Math. Daniel Silva Graça, Manuel Lameiras Campagnolo, Jorge Buescu
2008	C	`conf`	Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach. CCA Pieter Collins, Daniel Silva Graça
2007	C	`conf`	Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs. CCA Daniel Silva Graça, Jorge Buescu, Manuel Lameiras Campagnolo
2007	J	`jnl`	Polynomial differential equations compute all real computable functions on computable compact intervals. J. Complex. Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry
2006	C	`conf`	The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. TAMC Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry
2005	C	`conf`	Robust Simulations of Turing Machines with Analytic Maps and Flows. CiE Daniel Silva Graça, Manuel Lameiras Campagnolo, Jorge Buescu
2004	J	`jnl`	Some recent developments on Shannon's General Purpose Analog Computer. Math. Log. Q. Daniel Silva Graça
2003	J	`jnl`	Analog computers and recursive functions over the reals. J. Complex. Daniel Silva Graça, José Félix Costa