M. Vyalyi

444 citations
25 papers · 159 · h-index 6

Impact in

Papers in

    • semigroups and automata theory 8
    • Computability, Logic, AI Algorithms 5
    • Complexity and Algorithms in Graphs 4
    • Quantum Computing Algorithms and Architecture 3
    • Coding theory and cryptography 3
    • Artificial Intelligence in Games 2
    • Algorithms and Data Compression 2
    • Machine Learning and Algorithms 2

M. Vyalyi

19 papers receiving 147 citations

Peers

M. Vyalyi
Comparison fields: 5 of 42
  • Computer Graphics and Computer-Aided Design 31
  • Computational Theory and Mathematics 89
  • Geometry and Topology 22
  • Algebra and Number Theory 10
  • Artificial Intelligence 56
Replace Ferenc Szöllősi with:
Ferenc Szöllősi Hungary
Yaroslav Shitov Russia
E. D. Gluskin Israel
Raanan Schul United States
F. Barthe France
A. Sossinsky Russia
Paweł Gajer United States
В. Е. Кузнецов United States
Olivier Ruatta France
Tim Netzer Germany
M. Vyalyi relative to Ferenc Szöllősi Hungary Ferenc Szöllősi's profile →
Citations per field
00.5×2.8×
Ferenc Szöllősi · 1×
Citations per year

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-authors

The 12 scholars most cited alongside M. Vyalyi, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with M. Vyalyi Line = papers co-authored together M. Vyalyi links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 25 papers — load more, or switch the sort, to bring in the rest.

#Work
1 199854
2 200534
3 201223
4
QMA=PP implies that PP contains PH
200310
5 20076
6 20036
7 20173
8 20113
9 20113
10 20232
11 20242
12 20162
13 20082
14 19972
15 20132
16 20241
17 20241
18 20151
19 20151
20 20171

About M. Vyalyi

M. Vyalyi is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Electrical and Electronic Engineering and Molecular Biology, having authored 25 papers that have together received 159 indexed citations. Recurring topics across this work include semigroups and automata theory (8 papers), Computability, Logic, AI Algorithms (5 papers), Complexity and Algorithms in Graphs (4 papers), Quantum Computing Algorithms and Architecture (3 papers), Coding theory and cryptography (3 papers), Artificial Intelligence in Games (2 papers), Algorithms and Data Compression (2 papers) and Machine Learning and Algorithms (2 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (31 citations), Computational Theory and Mathematics (89 citations), Geometry and Topology (22 citations), Algebra and Number Theory (10 citations) and Artificial Intelligence (56 citations). M. Vyalyi has collaborated with scholars based in Russia, United States and Italy. Frequent co-authors include S. Yu. Tarasov, Sergey Bravyi, Vladimir Gurvich, Daniel Gottesman, Alexei Kitaev, Kazuhisa Makino, Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich and Qi Cheng. Their work appears in journals such as Problems of Information Transmission, Discrete Applied Mathematics, International Journal of Game Theory, Theory of Computing Systems and Quantum Information and Computation.

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