V.M. Sidelnikov
Impact in
- Artificial Intelligence top 10%
- Coding theory and cryptography
- Cryptographic Implementations and Security
- Cryptography and Data Security
Papers in
-
- Coding theory and cryptography 8
- Quantum Information and Cryptography 1
-
- graph theory and CDMA systems 5
- Journals
- Problems of Information Transmission (2 papers)Journal of Algebraic Combinatorics (1 paper)Designs Codes and Cryptography (1 paper)Cybernetics and Systems Analysis (1 paper)Discrete Mathematics and Applications (3 papers)
- Partner nations
- RussiaTajikistan
In The Last Decade
V.M. Sidelnikov
14 papers receiving 186 citations
Peers
Comparison fields: 5 of 35
- Discrete Mathematics and Combinatorics 21
- Artificial Intelligence 185
- Numerical Analysis 19
- Computer Networks and Communications 54
- Computer Vision and Pattern Recognition 42
Countries citing papers authored by V.M. Sidelnikov
This map shows the geographic impact of V.M. Sidelnikov'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.M. Sidelnikov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites V.M. Sidelnikov more than expected).
Fields of papers citing papers by V.M. Sidelnikov
This network shows the impact of papers produced by V.M. Sidelnikov. 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.M. Sidelnikov. The network helps show where V.M. Sidelnikov may publish in the future.
Co-authors
The 2 scholars most cited alongside V.M. Sidelnikov, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 1992 | 106 | |
| 2 | 1994 | 53 | |
| 3 | 1974 | 14 | |
| 4 | 1999 | 11 | |
| 5 | 1988 | 8 | |
| 6 | 1992 | 6 | |
| 7 | 1975 | 6 | |
| 8 | 2004 | 5 | |
| 9 | 2002 | 3 | |
| 10 | 2002 | 3 | |
| 11 | 1965 | 2 | |
| 12 | 2005 | 2 | |
| 13 | 2009 | 1 | |
| 14 | 2006 | 1 | |
| 15 | 2002 | 0 |
About V.M. Sidelnikov
V.M. Sidelnikov is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics, Numerical Analysis and Computer Networks and Communications, having authored 15 papers that have together received 221 indexed citations. Recurring topics across this work include Coding theory and cryptography (8 papers), graph theory and CDMA systems (5 papers), Finite Group Theory Research (4 papers), Mathematical Approximation and Integration (4 papers), Error Correcting Code Techniques (2 papers), Quantum Information and Cryptography (1 paper), Quantum-Dot Cellular Automata (1 paper) and Cooperative Communication and Network Coding (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (21 citations), Artificial Intelligence (185 citations), Numerical Analysis (19 citations), Computer Networks and Communications (54 citations) and Computer Vision and Pattern Recognition (42 citations). V.M. Sidelnikov has collaborated with scholars based in Russia and Tajikistan. Frequent co-authors include Vladimir S. Mironov and Л. С. Казарин. Their work appears in journals such as Problems of Information Transmission, Journal of Algebraic Combinatorics, Designs Codes and Cryptography, Cybernetics and Systems Analysis and Discrete Mathematics and Applications.
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.