Alexander Rybalov

2.2k total citations · 1 hit paper
53 papers, 1.4k citations indexed

About

Alexander Rybalov is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Management Science and Operations Research. According to data from OpenAlex, Alexander Rybalov has authored 53 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Computational Theory and Mathematics, 24 papers in Artificial Intelligence and 10 papers in Management Science and Operations Research. Recurrent topics in Alexander Rybalov's work include Computability, Logic, AI Algorithms (15 papers), semigroups and automata theory (10 papers) and Multi-Criteria Decision Making (10 papers). Alexander Rybalov is often cited by papers focused on Computability, Logic, AI Algorithms (15 papers), semigroups and automata theory (10 papers) and Multi-Criteria Decision Making (10 papers). Alexander Rybalov collaborates with scholars based in United States, Russia and Israel. Alexander Rybalov's co-authors include Ronald R. Yager, János Fodor, Eugene Kagan, Alexei Myasnikov, Hava T. Siegelmann, Irad Ben‐Gal and Alexey Y. Nikitin and has published in prestigious journals such as Fuzzy Sets and Systems, IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) and Theoretical Computer Science.

In The Last Decade

Alexander Rybalov

36 papers receiving 1.3k citations

Hit Papers

Uninorm aggregation operators 1996 2026 2006 2016 1996 200 400 600
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Uninorm aggregation operators
    1996 643 citations Ronald R. Yager, Alexander Rybalov Fuzzy Sets and Systems profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Alexander Rybalov United States 10 978 855 521 305 138 53 1.4k
Gaspar Mayor Spain 17 1.1k 1.1× 748 0.9× 343 0.7× 441 1.4× 211 1.5× 53 1.4k
Wiesław A. Dudek Poland 22 1.5k 1.6× 1.1k 1.2× 569 1.1× 125 0.4× 202 1.5× 89 1.8k
Gert de Cooman Belgium 25 862 0.9× 563 0.7× 1.1k 2.0× 493 1.6× 97 0.7× 127 1.6k
G. Muhiuddin Saudi Arabia 16 825 0.8× 466 0.5× 245 0.5× 109 0.4× 170 1.2× 132 1.2k
Antonio Di Nola Italy 23 984 1.0× 1.6k 1.9× 1.1k 2.1× 245 0.8× 157 1.1× 166 2.1k
Joan Torrens Spain 33 2.5k 2.6× 2.1k 2.4× 1.0k 2.0× 658 2.2× 295 2.1× 124 3.0k
C. Alsina Spain 14 624 0.6× 370 0.4× 314 0.6× 215 0.7× 147 1.1× 44 952
Zengtai Gong China 16 492 0.5× 532 0.6× 241 0.5× 593 1.9× 168 1.2× 106 1.2k
Regivan Santiago Brazil 14 675 0.7× 552 0.6× 479 0.9× 242 0.8× 93 0.7× 99 936
C.V. Negoita Romania 10 851 0.9× 445 0.5× 525 1.0× 567 1.9× 230 1.7× 20 1.3k

Countries citing papers authored by Alexander Rybalov

Since Specialization
Citations

This map shows the geographic impact of Alexander Rybalov'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 Alexander Rybalov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alexander Rybalov more than expected).

Fields of papers citing papers by Alexander Rybalov

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Alexander Rybalov. 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 Alexander Rybalov. The network helps show where Alexander Rybalov may publish in the future.

Co-authorship network of co-authors of Alexander Rybalov

This figure shows the co-authorship network connecting the top 25 collaborators of Alexander Rybalov. A scholar is included among the top collaborators of Alexander Rybalov 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 Alexander Rybalov. Alexander Rybalov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kagan, Eugene, Alexander Rybalov, & Ronald R. Yager. (2025). Multi-valued Logic for Decision-Making Under Uncertainty.
2.
Rybalov, Alexander. (2024). Generically undecidable and hard problems. PRIKLADNAYa DISKRETNAYa MATEMATIKA. 109–116.
3.
Rybalov, Alexander. (2024). On the generic complexity of solving equations over natural numbers with addition. PRIKLADNAYa DISKRETNAYa MATEMATIKA. 72–78.
4.
Rybalov, Alexander. (2020). ON GENERIC NP-COMPLETENESS OF THE PROBLEM OF BOOLEAN CIRCUITS SATISFIABILITY. PRIKLADNAYa DISKRETNAYa MATEMATIKA. 101–107. 1 indexed citations
5.
Rybalov, Alexander. (2020). ON GENERIC COMPLEXITY OF THE PROBLEM OF REPRESENTATION OF NATURAL NUMBERS BY SUM OF TWO SQUARES. PRIKLADNAYa DISKRETNAYa MATEMATIKA. 93–99.
6.
Rybalov, Alexander. (2019). ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM. PRIKLADNAYa DISKRETNAYa MATEMATIKA. 72–77.
7.
Nikitin, Alexey Y. & Alexander Rybalov. (2018). ON COMPLEXITY OF THE SATISFIABILITY PROBLEM OF SYSTEMS OVER FINITE POSETS. PRIKLADNAYa DISKRETNAYa MATEMATIKA. 94–98. 2 indexed citations
8.
Rybalov, Alexander. (2017). ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM. PRIKLADNAYa DISKRETNAYa MATEMATIKA. 100–106. 2 indexed citations
9.
Rybalov, Alexander. (2017). ON GENERIC COMPLEXITY OF THE PROBLEM OF FINDING ROOTS IN GROUPS OF RESIDUES. PRIKLADNAYa DISKRETNAYa MATEMATIKA. 95–100. 1 indexed citations
10.
Rybalov, Alexander. (2016). ON GENERIC COMPLEXITY OF THE DISCRETE LOGARITHM PROBLEM. PRIKLADNAYa DISKRETNAYa MATEMATIKA. 93–97. 2 indexed citations
11.
Rybalov, Alexander. (2016). ON GENERIC COMPLEXITY OF THE VALIDITY PROBLEM FOR BOOLEAN FORMULAS. PRIKLADNAYa DISKRETNAYa MATEMATIKA. 119–126.
12.
Rybalov, Alexander. (2015). ON GENERIC COMPLEXITY OF THE QUADRATIC RESIDUOSITY PROBLEM. PRIKLADNAYa DISKRETNAYa MATEMATIKA. 54–58. 2 indexed citations
13.
Kagan, Eugene, Alexander Rybalov, & Ronald R. Yager. (2014). Multi-valued logic based on probability-generated aggregators. 10. 1–5.
14.
Rybalov, Alexander, Eugene Kagan, & Ronald R. Yager. (2012). Parameterized uninorm and absorbing norm and their application for logic design. 1–5. 7 indexed citations
15.
Rybalov, Alexander. (2007). On the strongly generic undecidability of the Halting Problem. Theoretical Computer Science. 377(1-3). 268–270. 11 indexed citations
16.
Rybalov, Alexander. (2003). On the P–NP problem over real matrix rings. Theoretical Computer Science. 314(1-2). 281–285. 2 indexed citations
17.
Yager, Ronald R. & Alexander Rybalov. (1998). Full reinforcement operators in aggregation techniques. IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics). 28(6). 757–769. 56 indexed citations
18.
Yager, Ronald R. & Alexander Rybalov. (1998). On the fusion of documents from multiple collection information retrieval systems. Journal of the American Society for Information Science. 49(13). 1177–1184. 18 indexed citations
19.
Yager, Ronald R. & Alexander Rybalov. (1997). A note on the incompatibility of openness and associativity. Fuzzy Sets and Systems. 89(1). 125–127. 1 indexed citations
20.
Yager, Ronald R. & Alexander Rybalov. (1996). Uninorm aggregation operators. Fuzzy Sets and Systems. 80(1). 111–120. 643 indexed citations breakdown →

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Gaspar Mayor Breakdown of academic impact, for papers by Wiesław A. Dudek Breakdown of academic impact, for papers by Gert de Cooman Breakdown of academic impact, for papers by G. Muhiuddin Breakdown of academic impact, for papers by Antonio Di Nola Breakdown of academic impact, for papers by Joan Torrens Breakdown of academic impact, for papers by C. Alsina Breakdown of academic impact, for papers by Zengtai Gong Breakdown of academic impact, for papers by Regivan Santiago Breakdown of academic impact, for papers by C.V. Negoita
Rankless by CCL
2026