• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Book chapter
Stochasticity in Algorithmic Statistics for Polynomial Time

Vereshchagin N., Milovanov A.

In bk.: 32nd Computational Complexity Conference. Вадерн: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, 2017. P. 1-18.

Working paper
Spatially Adaptive Computation Time for Residual Networks

Figurnov M., Collins M. D., Zhu Y. et al.

arXiv:1612.02297. arXiv. Cornell University, 2016

Tag "Faculty of Computer Science" – News

"I want my students to have a better understanding of the optimization algorithms after my course"

"I want my students to have a better understanding of the optimization algorithms after my course"
Darina Dvinskikh has been working at the Faculty of Computer Science since September. She has been hired via the tenure track programme. Darina told us how her choice of research topic for the master's thesis determined her path in science and where the Wasserstein barycenters can be useful.

"The belief that everything can be modelled gave me the incentive to model everything"

"The belief that everything can be modelled gave me the incentive to model everything"
Alexander Tarakanov started out in science as a physicist, earned his PhD in the USA and worked both in industry and academia. Since September, he has been working at the Faculty of Computer Science via the Tenure Track programme. We talked to him about his research, favourite papers and plans.

Laboratory of Theoretical Computer Science Researchers Get Grant from RFBR and Royal Society

Laboratory of Theoretical Computer Science Researchers Get Grant from RFBR and Royal Society
Researchers from the HSE Laboratory of Theoretical Computer Science have won a competition organized by the Russian Foundation for Basic Research (RFBR) and the Royal Society of London for Improving Natural Knowledge.