Andrei Romashchenko

722 total citations
25 papers, 293 citations indexed

About

Andrei Romashchenko is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Statistics and Probability. According to data from OpenAlex, Andrei Romashchenko has authored 25 papers receiving a total of 293 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 9 papers in Artificial Intelligence and 6 papers in Statistics and Probability. Recurrent topics in Andrei Romashchenko's work include Computability, Logic, AI Algorithms (19 papers), semigroups and automata theory (8 papers) and Complexity and Algorithms in Graphs (7 papers). Andrei Romashchenko is often cited by papers focused on Computability, Logic, AI Algorithms (19 papers), semigroups and automata theory (8 papers) and Complexity and Algorithms in Graphs (7 papers). Andrei Romashchenko collaborates with scholars based in Russia, France and United States. Andrei Romashchenko's co-authors include Nikolay Vereshchagin, Alexander Shen, Konstantin Makarychev, Yury Makarychev, Bruno Durand, Troy Lee, Alexey Chernov, Laurent Bienvenu, Péter Gács and Marius Zimand and has published in prestigious journals such as IEEE Transactions on Information Theory, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Andrei Romashchenko

21 papers receiving 270 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Andrei Romashchenko Russia 7 175 100 99 75 32 25 293
Caterina De Simone Italy 10 231 1.3× 69 0.7× 57 0.6× 49 0.7× 11 0.3× 26 390
Nati Linial Israel 11 216 1.2× 48 0.5× 169 1.7× 52 0.7× 7 0.2× 35 353
太舜 韓 2 96 0.5× 188 1.9× 110 1.1× 101 1.3× 71 2.2× 2 294
Martin Loebl Czechia 11 222 1.3× 36 0.4× 82 0.8× 28 0.4× 28 0.9× 58 414
Marc Vuffray United States 9 40 0.2× 65 0.7× 81 0.8× 56 0.7× 17 0.5× 26 245
Matthias Beck United States 14 252 1.4× 53 0.5× 47 0.5× 24 0.3× 11 0.3× 62 698
Aidan Roy Canada 10 126 0.7× 94 0.9× 314 3.2× 30 0.4× 10 0.3× 15 415
Anup Rao United States 16 368 2.1× 97 1.0× 340 3.4× 109 1.5× 27 0.8× 40 527
Adi Shraibman Israel 11 240 1.4× 44 0.4× 215 2.2× 41 0.5× 9 0.3× 19 335
Gábor Simonyi Hungary 12 294 1.7× 94 0.9× 66 0.7× 84 1.1× 49 1.5× 40 423

Countries citing papers authored by Andrei Romashchenko

Since Specialization
Citations

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

Fields of papers citing papers by Andrei Romashchenko

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Andrei Romashchenko

This figure shows the co-authorship network connecting the top 25 collaborators of Andrei Romashchenko. A scholar is included among the top collaborators of Andrei Romashchenko 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 Andrei Romashchenko. Andrei Romashchenko 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.
Romashchenko, Andrei, et al.. (2024). Common Information in Well-Mixing Graphs and Applications to Information-Theoretic Cryptography. SPIRE - Sciences Po Institutional REpository. 181–186.
2.
Romashchenko, Andrei, et al.. (2024). Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. SPIRE - Sciences Po Institutional REpository. 16(3). 1–37. 1 indexed citations
3.
Gács, Péter, et al.. (2022). Inequalities for space-bounded Kolmogorov complexity. HAL (Le Centre pour la Communication Scientifique Directe). 11(3-4). 165–185.
4.
Romashchenko, Andrei. (2022). Clustering with respect to the information distance. Theoretical Computer Science. 929. 164–171. 1 indexed citations
5.
Romashchenko, Andrei, Alexander Shen, & Marius Zimand. (2021). 27 Open Problems in Kolmogorov Complexity. ACM SIGACT News. 52(4). 31–54. 1 indexed citations
6.
Romashchenko, Andrei, et al.. (2019). How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma. SPIRE - Sciences Po Institutional REpository. 1377–1381. 12 indexed citations
7.
Romashchenko, Andrei, et al.. (2018). A Conditional Information Inequality and Its Combinatorial Applications. IEEE Transactions on Information Theory. 64(5). 3610–3615. 5 indexed citations
8.
Romashchenko, Andrei, et al.. (2017). On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
9.
Bienvenu, Laurent, et al.. (2014). The axiomatic power of Kolmogorov complexity. Annals of Pure and Applied Logic. 165(9). 1380–1402. 4 indexed citations
10.
Romashchenko, Andrei, et al.. (2013). Conditional Information Inequalities for Entropic and Almost Entropic Points. IEEE Transactions on Information Theory. 59(11). 7149–7167. 11 indexed citations
11.
Durand, Bruno, Andrei Romashchenko, & Alexander Shen. (2011). Fixed-point tile sets and their applications. Journal of Computer and System Sciences. 78(3). 731–764. 23 indexed citations
12.
Durand, Bruno, Andrei Romashchenko, & Alexander Shen. (2010). Fixed point theorem and aperiodic tilings. Bulletin of the European Association for Theoretical Computer Science. 97. 126–136. 1 indexed citations
13.
Romashchenko, Andrei, et al.. (2010). Stability of properties of Kolmogorov complexity under relativization. Problems of Information Transmission. 46(1). 38–61. 3 indexed citations
14.
Lee, Troy & Andrei Romashchenko. (2005). Resource bounded symmetry of information revisited. Theoretical Computer Science. 345(2-3). 386–405. 4 indexed citations
15.
Lee, Troy & Andrei Romashchenko. (2004). On Polynomially Time Bounded Symmetry of Information. Electronic colloquium on computational complexity. 1 indexed citations
16.
Romashchenko, Andrei. (2004). Extracting the mutual information for a triple of binary strings. 221–229. 3 indexed citations
17.
Romashchenko, Andrei. (2003). A Criterion for Extractability of Mutual Information for a Triple of Strings. Problems of Information Transmission. 39(1). 148–157. 2 indexed citations
18.
Chernov, Alexey, et al.. (2002). Upper semi-lattice of binary strings with the relation “x is simple conditional to y”. Theoretical Computer Science. 271(1-2). 69–95. 17 indexed citations
19.
Makarychev, Konstantin, Yury Makarychev, Andrei Romashchenko, & Nikolay Vereshchagin. (2002). A new class of non-Shannon-type inequalities for entropies. Communications in Information and Systems. 2(2). 147–166. 80 indexed citations
20.
Romashchenko, Andrei, et al.. (2000). Inequalities for Shannon Entropy and Kolmogorov Complexity. Journal of Computer and System Sciences. 60(2). 442–464. 108 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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Caterina De Simone Breakdown of academic impact, for papers by Nati Linial Breakdown of academic impact, for papers by 太舜 韓 Breakdown of academic impact, for papers by Martin Loebl Breakdown of academic impact, for papers by Marc Vuffray Breakdown of academic impact, for papers by Matthias Beck Breakdown of academic impact, for papers by Aidan Roy Breakdown of academic impact, for papers by Anup Rao Breakdown of academic impact, for papers by Adi Shraibman Breakdown of academic impact, for papers by Gábor Simonyi
Rankless by CCL
2026