Daniel S. Graça

750 total citations
30 papers, 256 citations indexed

About

Daniel S. Graça is a scholar working on Computational Theory and Mathematics, Mathematical Physics and Artificial Intelligence. According to data from OpenAlex, Daniel S. Graça has authored 30 papers receiving a total of 256 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Computational Theory and Mathematics, 8 papers in Mathematical Physics and 7 papers in Artificial Intelligence. Recurrent topics in Daniel S. Graça's work include Computability, Logic, AI Algorithms (28 papers), Cellular Automata and Applications (17 papers) and semigroups and automata theory (11 papers). Daniel S. Graça is often cited by papers focused on Computability, Logic, AI Algorithms (28 papers), Cellular Automata and Applications (17 papers) and semigroups and automata theory (11 papers). Daniel S. Graça collaborates with scholars based in Portugal, United States and France. Daniel S. Graça's co-authors include José Félix Costa, Jorge Buescu, Manuel L. Campagnolo, Olivier Bournez, Ning Zhong, Pieter Collins, H. Scott Dumas and Cristóbal Rojas and has published in prestigious journals such as Transactions of the American Mathematical Society, Applied Mathematics and Computation and Theoretical Computer Science.

In The Last Decade

Daniel S. Graça

29 papers receiving 241 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Daniel S. Graça Portugal 9 221 84 26 20 13 30 256
José Félix Costa Portugal 10 278 1.3× 199 2.4× 11 0.4× 12 0.6× 3 0.2× 45 337
M. Vyalyi Russia 6 88 0.4× 55 0.7× 14 0.5× 4 0.2× 22 1.7× 25 156
Alf van der Poorten Australia 7 109 0.5× 82 1.0× 60 2.3× 10 0.5× 60 4.6× 13 221
Pavel Hrubeš United States 8 124 0.6× 86 1.0× 6 0.2× 4 0.2× 13 1.0× 40 180
Roman Matuszewski Poland 3 74 0.3× 105 1.3× 6 0.2× 7 0.3× 20 1.5× 5 146
Edmund F. Robertson United Kingdom 8 132 0.6× 61 0.7× 43 1.7× 9 0.5× 117 9.0× 31 230
Natacha Portier France 6 114 0.5× 74 0.9× 4 0.2× 3 0.1× 16 1.2× 15 142
Olivier Bodini France 6 55 0.2× 49 0.6× 23 0.9× 17 0.8× 7 0.5× 32 109
Yaroslav Shitov Russia 8 116 0.5× 37 0.4× 7 0.3× 8 0.4× 28 2.2× 51 184
Michel Bauderon France 6 122 0.6× 92 1.1× 8 0.3× 25 1.3× 7 0.5× 12 173

Countries citing papers authored by Daniel S. Graça

Since Specialization
Citations

This map shows the geographic impact of Daniel S. Graça's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Daniel S. Graça with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel S. Graça more than expected).

Fields of papers citing papers by Daniel S. Graça

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Daniel S. Graça. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Daniel S. Graça. The network helps show where Daniel S. Graça may publish in the future.

Co-authorship network of co-authors of Daniel S. Graça

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel S. Graça. A scholar is included among the top collaborators of Daniel S. Graça based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Daniel S. Graça. Daniel S. Graça is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Graça, Daniel S. & Ning Zhong. (2024). Robust non-computability of dynamical systems and computability of robust dynamical systems. Logical Methods in Computer Science. Volume 20, Issue 2. 1 indexed citations
3.
Graça, Daniel S. & Ning Zhong. (2022). Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines. 12(2). 117–144. 3 indexed citations
4.
Bournez, Olivier, et al.. (2017). On the functions generated by the general purpose analog computer. Sapientia (Algarve University). 4 indexed citations
5.
Graça, Daniel S., et al.. (2017). Computing geometric Lorenz attractors with arbitrary precision. Transactions of the American Mathematical Society. 370(4). 2955–2970. 5 indexed citations
6.
Bournez, Olivier, et al.. (2016). Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. arXiv (Cornell University). 13 indexed citations
7.
Graça, Daniel S., et al.. (2016). Computational complexity of solving polynomial differential equations over unbounded domains. Theoretical Computer Science. 626. 67–82. 11 indexed citations
9.
Graça, Daniel S. & Ning Zhong. (2015). An analytic System with a Computable Hyperbolic Sink Whose Basin of Attraction is Non-Computable. Theory of Computing Systems. 57(2). 478–520. 1 indexed citations
10.
Bournez, Olivier, et al.. (2013). Computation with perturbed dynamical systems. Journal of Computer and System Sciences. 79(5). 714–724. 6 indexed citations
11.
Graça, Daniel S., Ning Zhong, & H. Scott Dumas. (2012). The connection between computability of a nonlinear problem and its linearization: The Hartman–Grobman theorem revisited. Theoretical Computer Science. 457. 101–110. 6 indexed citations
12.
Graça, Daniel S., Ning Zhong, & Jorge Buescu. (2012). Computability, noncomputability, and hyperbolic systems. Applied Mathematics and Computation. 219(6). 3039–3054. 4 indexed citations
13.
Collins, Pieter & Daniel S. Graça. (2009). Effective Computability of Solutions of Differential Inclusions The Ten Thousand Monkeys Approach. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 11 indexed citations
14.
Graça, Daniel S., Ning Zhong, & Jorge Buescu. (2009). Computability, noncomputability and undecidability of maximal intervals of IVPs. Transactions of the American Mathematical Society. 361(6). 2913–2927. 19 indexed citations
15.
Graça, Daniel S., Jorge Buescu, & Manuel L. Campagnolo. (2009). Computational bounds on polynomial differential equations. Applied Mathematics and Computation. 215(4). 1375–1385. 6 indexed citations
16.
Bournez, Olivier, et al.. (2007). Polynomial differential equations compute all real computable functions on computable compact intervals. Journal of Complexity. 23(3). 317–335. 20 indexed citations
17.
Graça, Daniel S., Manuel L. Campagnolo, & Jorge Buescu. (2007). Computability with polynomial differential equations. Advances in Applied Mathematics. 40(3). 330–349. 26 indexed citations
18.
Graça, Daniel S.. (2004). Some recent developments on Shannon's General Purpose Analog Computer. Mathematical logic quarterly. 50(4-5). 473–485. 29 indexed citations
19.
Graça, Daniel S. & José Félix Costa. (2003). Analog computers and recursive functions over the reals. Journal of Complexity. 19(5). 644–664. 48 indexed citations
20.
Graça, Daniel S.. (2002). The general purpose analog computer and recursive functionsover the reals. Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT). 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026