• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
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

Book chapter
Computing majority by constant depth majority circuits with low fan-in gates

Kulikov A., Podolskii V. V.

In bk.: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). March 8–11, 2017, Hannover, Germany. Vol. 66. Leipzig: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017. P. 1-14.

Book chapter
GANs for Biological Image Synthesis

Osokin A., Chessel A., Carazo Salas R. E. et al.

In bk.: Proceedings of the IEEE International Conference on Computer Vision (ICCV 2017). Venice: IEEE, 2017. P. 2252-2261.

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.

Theoretical Computer Science and Combinatorics

"Theoretical Computer Science and Combinatorics" is a joint seminar of the Faculty of Computer Science of HSE and the Department of Innovation and High Technology of MIPT. The seminar is held 1-2 times per semester. The seminar is intended to enrich scientific collaboration between two departments in the fields of Theoretical Computer Science and Combinatorics. The seminar is hosted by turns by HSE and MIPT.

Talks:

9 March 2016
(FCS, room 509, 16:40-18:00)
Mikhail Tikhomirov, Geometric Graphs and Complexity of Their Recognition