Michael Vyalyi
- Professor: Faculty of Computer Science / Big Data and Information Retrieval School
- Leading Research Fellow: Faculty of Computer Science / Big Data and Information Retrieval School / Laboratory of Theoretical Computer Science
- Michael Vyalyi has been at HSE University since 2014.
- Language Proficiency
- English
- Russian
- Ukrainian
- Contacts
- Phone:
+7(495) 531-0000
27240
+7(977) 285-7834 - Address: 11 Pokrovsky Bulvar, Pokrovka Complex, room S832
- SPIN-RSCI: 1110-3260
- ORCID: 0000-0001-9822-1060
- ResearcherID: L-3553-2016
- Scopus AuthorID: 23092601000
- Google Scholar
- Supervisors
- N. Vereshchagin
- E. Sokolov
Printable version
Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!
To be used only for spelling or punctuation mistakes.
Education, Degrees and Academic Titles
2009
Associate Professor1995
Candidate of Sciences* (PhD)1984
Degree in Automatic Control SystemsMoscow Institute of Physics and Technology
* Candidate of Sciences
According to the International Standard Classification of Education (ISCED) 2011, Candidate of Sciences belongs to ISCED level 8 - "doctoral or equivalent", together with PhD, DPhil, D.Lit, D.Sc, LL.D, Doctorate or similar. Candidate of Sciences allows its holders to reach the level of the Associate Professor.
According to the International Standard Classification of Education (ISCED) 2011, Candidate of Sciences belongs to ISCED level 8 - "doctoral or equivalent", together with PhD, DPhil, D.Lit, D.Sc, LL.D, Doctorate or similar. Candidate of Sciences allows its holders to reach the level of the Associate Professor.
Responsibilities
Duties within the framework of work at the International Laboratory for Theoretical Informatics: research work in the field of theoretical informatics and discrete mathematics. Specific research areas in recent years and in the near future: graph theory, formal language theory, algorithmic and combinatorial game theory, computational complexity theory.
Courses (2024/2025)
- Algorithmic Game Theory (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 1 year, 1, 2 module)Rus
- Algorithmic Game Theory (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 2 year, 1, 2 module)Rus
- Algorithmic Game Theory (Mago-Lego; 1, 2 module)Rus
- Discrete Mathematics (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 1 year, 1-3 module)Rus
- Mentor's Seminar "Theoretical Informatics" (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 2 year, 1-3 module)Rus
- Mentor's Seminar "Theoretical Informatics" (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 1 year, 1-4 module)Rus
- Research Seminar "Theoretical Informatics 2" (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 4 year, 1-3 module)Rus
- Research Seminar "Theoretical Informatics" (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 3 year, 1-4 module)Rus
- Past Courses
Courses (2023/2024)
- Algorithmic Game Theory (Mago-Lego; 1, 2 module)Rus
- Algorithmic Game Theory (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 1 year, 1, 2 module)Rus
- Algorithmic Game Theory (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 2 year, 1, 2 module)Rus
- Approximation Algorithms, Convex Programming (Mago-Lego; 3 module)Rus
- Approximation Algorithms, Convex Programming (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 1 year, 3 module)Rus
- Convex Programming and Approximation Algorithms (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 4 year, 3 module)Rus
- Discrete Mathematics (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 1 year, 1-3 module)Rus
- Mentor's Seminar "Theoretical Informatics" (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 1 year, 1-4 module)Rus
- Research Seminar "Theoretical Informatics 2" (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 4 year, 1-3 module)Rus
- Research Seminar "Theoretical Informatics" (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 3 year, 1-4 module)Rus
Courses (2022/2023)
- Discrete Mathematics (Bachelor’s programme; Faculty of Economic Sciences field of study Applied Mathematics and Information Science; 1 year, 1-3 module)Rus
- Discrete Mathematics (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 1 year, 1-3 module)Rus
- Mentor's Seminar "Theoretical Informatics" (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 1 year, 1-4 module)Rus
- Research Seminar "Theoretical Informatics 2" (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 4 year, 1-3 module)Rus
- Research Seminar "Theoretical Informatics" (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 2 year, 1, 2 module)Rus
- Research Seminar "Theoretical Informatics" (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 3 year, 1-4 module)Rus
Courses (2021/2022)
- Convex Programming and Approximation Algorithms (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 4 year, 3 module)Rus
- Convex Programming and Approximation Algorithms (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 1 year, 3 module)Rus
- Discrete Mathematics (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 1 year, 1-3 module)Rus
- Research Seminar "Theoretical Informatics 2" (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 4 year, 1-3 module)Rus
- Research Seminar "Theoretical Informatics" (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 3 year, 1-4 module)Rus
- Research Seminar "Theoretical Informatics" (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 2 year, 1, 2 module)Rus
- Research Seminar "Theoretical Informatics" (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 1 year, 1-4 module)Rus
Courses (2020/2021)
- A Theorist's Toolkit (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 4 year, 3 module)Eng
- A Theorist's Toolkit (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 1 year, 3 module)Rus
- Discrete Mathematics (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 1 year, 1-3 module)Rus
- Research Seminar "Theoretical Informatics 2" (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 4 year, 1-3 module)Rus
- Research Seminar "Theoretical Informatics" (Bachelor’s programme; Faculty of Computer Science field of study Applied Mathematics and Information Science; 3 year, 1-4 module)Rus
- Research Seminar "Theoretical Informatics" (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 2 year, 1, 2 module)Rus
- Research Seminar "Theoretical Informatics" (Master’s programme; Faculty of Computer Science field of study Applied Mathematics and Informatics; 1 year, 1-3 module)Rus
Conferences
Employment history
My research interests are theoretical computer science, combinatorics, combinatorial optimization, computational geometry, quantum computations, algorithmic complexity of pro problems in formal language theory.
My teaching experience is over 25 years. I've taught in several insititutions: Independent University of Moscow, Moscow Institute of Open Education, National Research University Higher School of Economics, Moscow Institute of Physics and Technology.