Countries citing papers authored by Nikolay Mateev
Since
Specialization
Citations
This map shows the geographic impact of Nikolay Mateev'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 Nikolay Mateev with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nikolay Mateev more than expected).
This network shows the impact of papers produced by Nikolay Mateev. 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 Nikolay Mateev. The network helps show where Nikolay Mateev may publish in the future.
Co-authorship network of co-authors of Nikolay Mateev
This figure shows the co-authorship network connecting the top 25 collaborators of Nikolay Mateev.
A scholar is included among the top collaborators of Nikolay Mateev 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 Nikolay Mateev. Nikolay Mateev is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Menon, Vijay, Keshav Pingali, & Nikolay Mateev. (2003). Fractal symbolic analysis. ACM Transactions on Programming Languages and Systems. 25(6). 776–813.18 indexed citations
3.
Desoli, Giuseppe, Nikolay Mateev, Evelyn Duesterwald, Paolo Faraboschi, & Joseph A. Fisher. (2002). DELI: a new run-time control point. International Symposium on Microarchitecture. 257–268.66 indexed citations
Ahmed, Nawaaz, Nikolay Mateev, Keshav Pingali, & Paul Stodghill. (2000). Compiling Imperfectly-nested Sparse Matrix Codes with Dependences. eCommons (Cornell University).3 indexed citations
16.
Mateev, Nikolay, Vladimir Kotlyar, Keshav Pingali, & Paul Stodghill. (1999). A Generic Programming System for Sparse Matrix Computations. eCommons (Cornell University).4 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.