This map shows the geographic impact of V. E. Kotov'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 V. E. Kotov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites V. E. Kotov more than expected).
This network shows the impact of papers produced by V. E. Kotov. 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 V. E. Kotov. The network helps show where V. E. Kotov may publish in the future.
Co-authorship network of co-authors of V. E. Kotov
This figure shows the co-authorship network connecting the top 25 collaborators of V. E. Kotov.
A scholar is included among the top collaborators of V. E. Kotov 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 V. E. Kotov. V. E. Kotov is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Cherkasova, Ludmila & V. E. Kotov. (1990). Descriptive and analytical process algebras. Springer eBooks. 77–104.1 indexed citations
16.
Kotov, V. E., et al.. (1989). The USSR Academy of Sciences Start Project.. IFIP Congress. 623–626.3 indexed citations
17.
Cherkasova, Ludmila & V. E. Kotov. (1987). The undecidability of propositional temporal logic for Petri nets. Computing and Informatics / Computers and Artificial Intelligence. 6(2). 123–130.2 indexed citations
18.
Kotov, V. E., et al.. (1986). MARS—a hierarchical heterogeneous modular system. 277–289.2 indexed citations
19.
Kotov, V. E.. (1980). On Basic Parallel Language.. IFIP Congress. 229–240.2 indexed citations
20.
Kotov, V. E., et al.. (1968). On transformation of sequential programs into asynchronous parallel programs.. IFIP Congress. 351–357.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.