Daniel S. Graça
Impact in
-
- Computability, Logic, AI Algorithms
- Cellular Automata and Applications
- semigroups and automata theory
- Numerical Methods and Algorithms
- Formal Methods in Verification
-
- Mathematical Dynamics and Fractals
Papers in
-
- Computability, Logic, AI Algorithms 28
- Cellular Automata and Applications 17
- semigroups and automata theory 11
- Numerical Methods and Algorithms 6
- Polynomial and algebraic computation 2
-
- Mathematical Dynamics and Fractals 5
- Mathematical and Theoretical Analysis 3
- Co-authors
- José Félix Costa (1 shared paper)Jorge Buescu (6 shared papers)Manuel L. Campagnolo (4 shared papers)Olivier Bournez (7 shared papers)Ning Zhong (9 shared papers)Pieter Collins (2 shared papers)Cristóbal Rojas (1 shared paper)H. Scott Dumas (1 shared paper)
- Journals
- Journal of Complexity (4 papers)Transactions of the American Mathematical Society (3 papers)Theoretical Computer Science (3 papers)Applied Mathematics and Computation (2 papers)Theory of Computing Systems (1 paper)
- Partner nations
- PortugalUnited StatesFrance
In The Last Decade
Daniel S. Graça
29 papers receiving 241 citations
Peers
Comparison fields: 5 of 38
- Computational Theory and Mathematics 221
- Mathematical Physics 26
- Artificial Intelligence 84
- Geometry and Topology 13
- Theoretical Computer Science 1
Countries citing papers authored by Daniel S. Graça
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
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-authors
The 8 scholars most cited alongside Daniel S. Graça, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 30 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2003 | 48 | |
| 2 | 2004 | 29 | |
| 3 | 2007 | 26 | |
| 4 | 2007 | 20 | |
| 5 | 2009 | 19 | |
| 6 | 2016 | 13 | |
| 7 | 2016 | 11 | |
| 8 | 2009 | 11 | |
| 9 | 2008 | 9 | |
| 10 | 2008 | 7 | |
| 11 | 2012 | 6 | |
| 12 | 2013 | 6 | |
| 13 | 2009 | 6 | |
| 14 | 2017 | 5 | |
| 15 | The general purpose analog computer and recursive functionsover the reals | 2002 | 5 |
| 16 | 2016 | 5 | |
| 17 | On the functions generated by the general purpose analog computer | 2017 | 4 |
| 18 | 2012 | 4 | |
| 19 | 2012 | 4 | |
| 20 | 2022 | 3 |
About Daniel S. Graça
Daniel S. Graça is a scholar working on Computational Theory and Mathematics, Mathematical Physics, Artificial Intelligence, Computer Networks and Communications and Geometry and Topology, having authored 30 papers that have together received 256 indexed citations. Recurring topics across this work include Computability, Logic, AI Algorithms (28 papers), Cellular Automata and Applications (17 papers), semigroups and automata theory (11 papers), Numerical Methods and Algorithms (6 papers), Mathematical Dynamics and Fractals (5 papers), Logic, programming, and type systems (4 papers), Mathematical and Theoretical Analysis (3 papers) and Polynomial and algebraic computation (2 papers). The work is most often cited by research in Computational Theory and Mathematics (221 citations), Mathematical Physics (26 citations), Artificial Intelligence (84 citations), Geometry and Topology (13 citations) and Theoretical Computer Science (1 citation). Daniel S. Graça has collaborated with scholars based in Portugal, United States and France. Frequent co-authors include José Félix Costa, Jorge Buescu, Manuel L. Campagnolo, Olivier Bournez, Ning Zhong, Pieter Collins, Cristóbal Rojas and H. Scott Dumas. Their work appears in journals such as Journal of Complexity, Transactions of the American Mathematical Society, Theoretical Computer Science, Applied Mathematics and Computation and Theory of Computing Systems.
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.