M. Vyalyi

441 total citations
25 papers, 156 citations indexed

About

M. Vyalyi is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, M. Vyalyi has authored 25 papers receiving a total of 156 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computational Theory and Mathematics, 13 papers in Artificial Intelligence and 3 papers in Computer Networks and Communications. Recurrent topics in M. Vyalyi's work include semigroups and automata theory (8 papers), Computability, Logic, AI Algorithms (5 papers) and Complexity and Algorithms in Graphs (4 papers). M. Vyalyi is often cited by papers focused on semigroups and automata theory (8 papers), Computability, Logic, AI Algorithms (5 papers) and Complexity and Algorithms in Graphs (4 papers). M. Vyalyi collaborates with scholars based in Russia, United States and Tajikistan. M. Vyalyi's co-authors include S. Yu. Tarasov, Sergey Bravyi, Vladimir Gurvich, Kazuhisa Makino, Vladimir Gurvich, Qi Cheng, Endre Boros, Alexei Kitaev, Daniel Gottesman and Paolo Giulio Franciosa and has published in prestigious journals such as American Mathematical Monthly, Discrete Applied Mathematics and International Journal of Game Theory.

In The Last Decade

M. Vyalyi

19 papers receiving 144 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
M. Vyalyi Russia	6	88	55	35	30	27	25	156
Ferenc Szöllősi Hungary	8	48 0.5×	78 1.4×	16 0.5×	11 0.4×	24 0.9×	17	191
Yaroslav Shitov Russia	8	116 1.3×	37 0.7×	6 0.2×	12 0.4×	7 0.3×	51	184
Raanan Schul United States	8	57 0.6×	22 0.4×	37 1.1×	4 0.1×	4 0.1×	12	200
A. Sossinsky Russia	6	57 0.6×	10 0.2×	24 0.7×	10 0.3×	5 0.2×	17	211
E. D. Gluskin Israel	7	37 0.4×	15 0.3×	19 0.5×	12 0.4×	4 0.1×	16	259
F. Barthe France	10	26 0.3×	11 0.2×	8 0.2×	9 0.3×	6 0.2×	12	224
Paweł Gajer United States	5	18 0.2×	5 0.1×	62 1.8×	19 0.6×	6 0.2×	8	116
Paul Breiding Germany	8	61 0.7×	23 0.4×	12 0.3×	4 0.1×	7 0.3×	27	157
Josephine Yu United States	9	195 2.2×	30 0.5×	6 0.2×	26 0.9×	3 0.1×	25	268
Olivier Ruatta France	6	44 0.5×	57 1.0×	9 0.3×	6 0.2×	3 0.1×	13	116

Countries citing papers authored by M. Vyalyi

Since Specialization

Citations

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

Fields of papers citing papers by M. Vyalyi

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of M. Vyalyi

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Gurvich, Vladimir, et al.. (2025). Avoidability Beyond Paths. The Electronic Journal of Combinatorics. 32(2).

Vyalyi, M., et al.. (2024). Regular Realizability Problems for Descriptions of Finite Relations. 60(3). 46–58. 1 indexed citations

Vyalyi, M., et al.. (2024). On Universality of Regular Realizability Problems. Problems of Information Transmission. 60(3). 209–232. 1 indexed citations

Boros, Endre, Vladimir Gurvich, Kazuhisa Makino, & M. Vyalyi. (2024). Computing remoteness functions of Moore, Wythoff, and Euclid’s games. International Journal of Game Theory. 53(4). 1315–1333. 2 indexed citations

Vyalyi, M.. (2023). Testing the Satisfiability of Algebraic Formulas over the Field of Two Elements. Problems of Information Transmission. 59(1). 57–62.

Boros, Endre, Paolo Giulio Franciosa, Vladimir Gurvich, & M. Vyalyi. (2023). Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies. International Journal of Game Theory. 53(2). 449–473. 2 indexed citations

Vyalyi, M., et al.. (2017). Lower estimate for the cardinality of the domain of universal functions for the class of linear Boolean functions. Discrete Mathematics and Applications. 27(5). 319–324. 3 indexed citations

Babenko, Artem & M. Vyalyi. (2017). On the linear classification of even and odd permutation matrices and the complexity of computing the permanent. Computational Mathematics and Mathematical Physics. 57(2). 362–371.

Vyalyi, M., et al.. (2017). Fast protocols for leader election and spanning tree construction in a distributed network. Problems of Information Transmission. 53(2). 183–201. 1 indexed citations

10.

Vyalyi, M., et al.. (2016). Нижняя оценка мощности области определения универсальных функций для класса линейных булевых функций. Дискретная математика. 28(4). 50–57. 2 indexed citations

11.

Vyalyi, M., et al.. (2015). On regular realizability problems for context-free languages. Problems of Information Transmission. 51(4). 349–360. 1 indexed citations

12.

Vyalyi, M., et al.. (2015). Distributed communication complexity of spanning tree construction. Problems of Information Transmission. 51(1). 49–65. 1 indexed citations

13.

Vyalyi, M., et al.. (2014). Separating words by occurrences of subwords. Journal of Applied and Industrial Mathematics. 8(2). 293–299.

14.

Vyalyi, M.. (2013). On expressive power of regular realizability problems. Problems of Information Transmission. 49(3). 276–291. 2 indexed citations

15.

Gurvich, Vladimir & M. Vyalyi. (2012). Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs. Discrete Applied Mathematics. 160(12). 1742–1756. 23 indexed citations

16.

Vyalyi, M. & S. Yu. Tarasov. (2011). Orbits of linear maps and regular languages. Journal of Applied and Industrial Mathematics. 5(3). 448–465. 3 indexed citations

17.

Cheng, Qi, S. Yu. Tarasov, & M. Vyalyi. (2008). Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing. Theory of Computing Systems. 46(1). 120–142. 2 indexed citations

18.

Vyalyi, M.. (2003). QMA=PP implies that PP contains PH. Electronic colloquium on computational complexity. 10. 79–88. 9 indexed citations

19.

Gottesman, Daniel, et al.. (2003). Classical and Quantum Computation. American Mathematical Monthly. 110(10). 969–969. 5 indexed citations

20.

Tarasov, S. Yu. & M. Vyalyi. (1997). Some PL functions on surfaces are not height functions. 113–118. 2 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