• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта
Версия для слабовидящихЛичный кабинет сотрудника ВШЭПоискМеню

Математические методы в исследованиях алгоритмической сложности и формальных языков

Приоритетные направления развития: компьютерно-математическое
2021

Публикации по проекту:


Buhrman H., Christandl M., Koucky M., Lotker Z., Patt-Shamir B., Vereshchagin N. High Entropy Random Selection Protocols // Algorithmica. 2021. Vol. 83. P. 667-694. doi
Vyalyi M. Counting the Number of Perfect Matchings, and Generalized Decision Trees // Проблемы передачи информации. 2021. Vol. 57. No. 2. P. 143-160. doi
Chikin N., Gurvich V., Knop K., Paterson M., Vyalyi M. More about Exact Slow k-Nim // Integers. Electronic Journal of Combinatorial Number Theory. 2021. Vol. 21. P. 1-14. 
Gurvich V., Krnc M., Martin M., Vyalyi M. Shifting paths to avoidable ones // Journal of Graph Theory. 2021. P. 1-15. doi
Bychkov A., Pogudin G. Optimal Monomial Quadratization for ODE Systems, in: International Workshop on Combinatorial Algorithms, 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021.: Springer, 2021. С. 122-136. 
Barto L., Brady Z., Bulatov M., Kozik M., Zhuk D. Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP, in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)., 2021. С. 1-13. 
Zhuk D. No-Rainbow Problem and the Surjective Constraint Satisfaction Problem, in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)., 2021. С. 1-7. 
Milovanov A. Predictions and Algorithmic Statistics for Infinite Sequences, in: Computer Science – Theory and Applications: 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings.: Springer, 2021. С. 283-295. 
Kikot S., Kurucz A., Podolskii V. V., Zakharyaschev M. Deciding Boundedness of Monadic Sirups, in: PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. New York : Association for Computing Machinery (ACM), 2021. С. 370-387. 
Proskurin N. V. On Separation Between the Degree of a Boolean Function and the Block Sensitivity., in: Computer Science – Theory and Applications: 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings.: Springer, 2021. С. 406-421. 
Shabanov D. A., Zakharov P. On the Maximum Cut in Sparse Random Hypergraphs, in: Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications. Cham : Birkhäuser, 2021. С. 817-822.