• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Article
Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree

V.L. Chernyshev, Tolchennikov A.

Russian Journal of Mathematical Physics. 2017. Vol. 24. No. 3. P. 290-298.

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 "international faculty" – News

A Chance to Work with the Best Experts on Algorithmic Information Theory

Bruno Bauwens, an expert in Kolmogorov complexity, is a new recruit at the HSE Faculty of Computer Science. He started in September 2015. Bruno received his PhD from Ghent University in Belgium, after which he held postdoctoral fellowships at Porto University (Portugal), as well as at the University of Montpellier and University of Lorraine.

International Experts in the Faculty of Computer Science

An important step in integrating the university into the global educational, scientific and research space is the expansion of international recruiting. Since its very first year, the Faculty of Computer Science at the Higher School of Economics has had a foreign professor working on staff. In 2015, four internationally recruited experts teach and conduct research in the faculty.