Daniel da Silva Graça
AuthID: R-000-423
11
TÃTULO: Computability of Ordinary Differential Equations
AUTORES: Graca, DS; Zhong, N;
PUBLICAÇÃO: 2018, FONTE: 14th Conference on Computability in Europe (CiE) in SAILING ROUTES IN THE WORLD OF COMPUTATION, VOLUME: 10936
AUTORES: Graca, DS; Zhong, N;
PUBLICAÇÃO: 2018, FONTE: 14th Conference on Computability in Europe (CiE) in SAILING ROUTES IN THE WORLD OF COMPUTATION, VOLUME: 10936
14
TÃTULO: Computational complexity of solving polynomial differential equations over unbounded domains Full Text
AUTORES: Amaury Pouly; Daniel S Graca;
PUBLICAÇÃO: 2016, FONTE: THEORETICAL COMPUTER SCIENCE, VOLUME: 626
AUTORES: Amaury Pouly; Daniel S Graca;
PUBLICAÇÃO: 2016, FONTE: THEORETICAL COMPUTER SCIENCE, VOLUME: 626
15
TÃTULO: Rigorous numerical computation of polynomial differential equations over unbounded domains
AUTORES: Bournez, O; Graça, DS; Pouly, A;
PUBLICAÇÃO: 2016, FONTE: 6th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2015 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 9582
AUTORES: Bournez, O; Graça, DS; Pouly, A;
PUBLICAÇÃO: 2016, FONTE: 6th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2015 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 9582
INDEXADO EM: 
Scopus 
CrossRef
Scopus CrossRef16
TÃTULO: Computing with polynomial ordinary differential equations Full Text
AUTORES: Olivier Bournez; Daniel Graca; Amaury Pouly;
PUBLICAÇÃO: 2016, FONTE: JOURNAL OF COMPLEXITY, VOLUME: 36
AUTORES: Olivier Bournez; Daniel Graca; Amaury Pouly;
PUBLICAÇÃO: 2016, FONTE: JOURNAL OF COMPLEXITY, VOLUME: 36
17
TÃTULO: 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
AUTORES: Bournez, O; Graca, DS; Pouly, A;
PUBLICAÇÃO: 2016, FONTE: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 in Leibniz International Proceedings in Informatics, LIPIcs, VOLUME: 55
AUTORES: Bournez, O; Graca, DS; Pouly, A;
PUBLICAÇÃO: 2016, FONTE: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 in Leibniz International Proceedings in Informatics, LIPIcs, VOLUME: 55
INDEXADO EM: Scopus
Scopus18
TÃTULO: An analytic System with a Computable Hyperbolic Sink Whose Basin of Attraction is Non-Computable Full Text
AUTORES: Graca, DS; Zhong, N;
PUBLICAÇÃO: 2015, FONTE: THEORY OF COMPUTING SYSTEMS, VOLUME: 57, NÚMERO: 2
AUTORES: Graca, DS; Zhong, N;
PUBLICAÇÃO: 2015, FONTE: THEORY OF COMPUTING SYSTEMS, VOLUME: 57, NÚMERO: 2
INDEXADO EM: Scopus 
WOS
Scopus WOS NO MEU: 
ORCID
ORCID19
TÃTULO: An analytic System with a Computable Hyperbolic Sink Whose Basin of Attraction is Non-Computable Full Text
AUTORES: Daniel S Graça; Ning Zhong;
PUBLICAÇÃO: 2015, FONTE: Theory of Computing Systems - Theory Comput Syst, VOLUME: 57, NÚMERO: 2
AUTORES: Daniel S Graça; Ning Zhong;
PUBLICAÇÃO: 2015, FONTE: Theory of Computing Systems - Theory Comput Syst, VOLUME: 57, NÚMERO: 2
20
TÃTULO: Turing machines can be efficiently simulated by the general purpose analog computer
AUTORES: Bournez, O; Graca, DS; Pouly, A;
PUBLICAÇÃO: 2013, FONTE: 10th International Conference on Theory and Applications of Models of Computation, TAMC 2013 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 7876 LNCS
AUTORES: Bournez, O; Graca, DS; Pouly, A;
PUBLICAÇÃO: 2013, FONTE: 10th International Conference on Theory and Applications of Models of Computation, TAMC 2013 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 7876 LNCS
