Rogério Reis
About
In The Last Decade
Rogério Reis
48 papers receiving 157 citations
Peers
Comparison fields: 5 of 35
- Computational Theory and Mathematics 129
- Artificial Intelligence 109
- Molecular Biology 72
- Discrete Mathematics and Combinatorics 14
- Software 12
Countries citing papers authored by Rogério Reis
This map shows the geographic impact of Rogério Reis'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 Rogério Reis with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rogério Reis more than expected).
Fields of papers citing papers by Rogério Reis
This network shows the impact of papers produced by Rogério Reis. 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 Rogério Reis. The network helps show where Rogério Reis may publish in the future.
Co-authorship network of co-authors of Rogério Reis
This figure shows the co-authorship network connecting the top 25 collaborators of Rogério Reis. A scholar is included among the top collaborators of Rogério Reis 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 Rogério Reis. Rogério Reis is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 1 | |
| 3 | 1 | |
| 4 | 1 | |
| 5 | 0 | |
| 6 | 5 | |
| 7 | 1 | |
| 8 | On the dissimilarity operation on finite languages | 2 |
| 9 | 2 | |
| 10 | 3 | |
| 11 | 2 | |
| 12 | 3 | |
| 13 | The Distinguishability Operation On Regular Languages | 2 |
| 14 | Statistical study on the number of injective linear finite transducers. | 1 |
| 15 | 5 | |
| 16 | Turing e a Enigma | 0 |
| 17 | Formal Power Series and the Invertibility of Finite Linear Transducers. | 1 |
| 18 | Aspects of enumeration and generation with a string automata representation | 0 |
| 19 | 18 | |
| 20 | On the density of languages representing finite set partitions. | 4 |
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.