3 Kochnovsky Proezd (near metro station 'Aeroport').
Phone: +7 (495) 772-95-90 *12332
First Deputy Dean
Deputy Dean for Research and International Relations
Deputy Dean for Methodical and Educational Work
Deputy Dean for Development, Finance and Administration
Bellec P., Dalalyan A., Grappin E. et al.
Electronic journal of statistics. 2018. Vol. 12. No. 2. P. 3443-3472.
Durand B., Shen A., Vereshchagin N.
Discrete and Computational Geometry. 2019. P. 1-30.
Zakharyaschev M. et al.
International Journal of Applied Mathematics and Computer Science. 2019. Vol. 29. No. 1. P. 17-30.
Tyuryumina E., Neznanov A.
The Breast. 2019. Vol. 44. P. 88-89.
Mikhail S. Gelfand
Nature Communications. 2019. Т. 10. № 1. С. 1-11.
The faculty trains developers and researchers. The programme has been created based on the experience of leading American and European universities, such as Stanford University (U.S.) and EPFL (Switzerland). Also taken into consideration when creating the faculty was the School of Data Analysis, which is one of the strongest postgraduate schools in the field of computer science in Russia. The wide range of elective courses will allow each student to create his or her own educational path. In the faculty, learning is based on practice and projects.
16 October 2018, 18:10, room 205 (Kochnovskii proezd, 3)
Luca Bernardinello (University of Milano-Bicocca)
Games on graphs and on trees have been used in the fields of semantics and verification. Usually, they are defined as sequential games, where a play is a sequence of moves by the players.
However, when synthesizing or analyzing distributed systems, in which events happen concurrently and the global state is not observable, this approach is not always appropriate, since concurrency is hidden in the interleaving of events. Therefore, several kinds of games in which the players can move asynchronously have been proposed in recent years. I will present an attempt to define such a game, originally conceived in order to tackle the problem of “observable liveness”, in which an agent tries to control a Petri net so that a given transition will fire over and over, assuming that only a subset of the transitions is directly controllable.