N. Sabadini
About
In The Last Decade
N. Sabadini
27 papers receiving 147 citations
Peers
Comparison fields: 5 of 30
- Computational Theory and Mathematics 123
- Artificial Intelligence 113
- Computer Networks and Communications 25
- Mathematical Physics 17
- Geometry and Topology 16
Countries citing papers authored by N. Sabadini
This map shows the geographic impact of N. Sabadini'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 N. Sabadini with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites N. Sabadini more than expected).
Fields of papers citing papers by N. Sabadini
This network shows the impact of papers produced by N. Sabadini. 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 N. Sabadini. The network helps show where N. Sabadini may publish in the future.
Co-authorship network of co-authors of N. Sabadini
This figure shows the co-authorship network connecting the top 25 collaborators of N. Sabadini. A scholar is included among the top collaborators of N. Sabadini 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 N. Sabadini. N. Sabadini 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 | 0 | |
| 3 | 2 | |
| 4 | 1 | |
| 5 | 1 | |
| 6 | 3 | |
| 7 | 2 | |
| 8 | 3 | |
| 9 | 3 | |
| 10 | 1 | |
| 11 | 29 | |
| 12 | 4 | |
| 13 | 4 | |
| 14 | Concurrent automata, prime event structures and universal domains | 1 |
| 15 | 22 | |
| 16 | 16 | |
| 17 | Generating functions of trace languages. | 1 |
| 18 | Unambiguous regular trace languages | 8 |
| 19 | On characterizing classes of efficiently parallelizable problems | 0 |
| 20 | Context-free trace languages | 3 |
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.