Maxim A. Babenko
- Department Head, Associate Professor:Faculty of Computer Science / Big Data and Information Retrieval School / Joint Department with Yandex
- Maxim A. Babenko has been at HSE University since 2009.
Education and Degrees
- 2007
Candidate of Sciences* (PhD) in Mathematical Logic, Algebra and Number Theory
- 2004
Degree
Lomonosov Moscow State University
* Candidate of Sciences
According to the International Standard Classification of Education (ISCED) 2011, Candidate of Sciences belongs to ISCED level 8 - "doctoral or equivalent", together with PhD, DPhil, D.Lit, D.Sc, LL.D, Doctorate or similar. Candidate of Sciences allows its holders to reach the level of the Associate Professor.
According to the International Standard Classification of Education (ISCED) 2011, Candidate of Sciences belongs to ISCED level 8 - "doctoral or equivalent", together with PhD, DPhil, D.Lit, D.Sc, LL.D, Doctorate or similar. Candidate of Sciences allows its holders to reach the level of the Associate Professor.
Young Faculty Support Program (Group of Young Academic Professionals)
Category "Future Professoriate" (2015)
Courses (2022/2023)
Algorithms and Data Structures 1 (Master’s programme; Faculty of Computer Science; field of study "01.04.02. Прикладная математика и информатика", field of study "01.04.02. Прикладная математика и информатика", field of study "01.04.02. Прикладная математика и информатика"; 1 year, 1, 2 module)Rus
- Algorithms and Data Structures 2 (Mago-Lego; 3, 4 module)Rus
- Algorithms and Data Structures 2 (Master’s programme; Faculty of Computer Science; 1 year, 3, 4 module)Rus
- Past Courses
Courses (2021/2022)
Algorithms and Data Structures (Master’s programme; Faculty of Computer Science; field of study "01.04.02. Прикладная математика и информатика", field of study "01.04.02. Прикладная математика и информатика"; 1 year, 1, 2 module)Rus
Courses (2020/2021)
Algorithms and Data Structures (Master’s programme; Faculty of Computer Science; field of study "01.04.02. Прикладная математика и информатика", field of study "01.04.02. Прикладная математика и информатика"; 1 year, 1, 2 module)Rus
Courses (2019/2020)
- Advanced Deep Learning (Master’s programme; Faculty of Computer Science; 2 year, 1, 2 module)Rus
- Algorithms and Data Structures (Master’s programme; Faculty of Computer Science; 1 year, 1, 2 module)Rus
- Practical Analytics (Master’s programme; Faculty of Computer Science; 2 year, 1, 2 module)Rus
Courses (2018/2019)
- Algorithms and Data Structures (Master’s programme; Faculty of Computer Science; 1 year, 1, 2 module)Rus
- Methods and Systems for Processing Big Data (Master’s programme; Faculty of Computer Science; 1 year, 1, 2 module)Rus
- Optimization in Machine Learning (Master’s programme; Faculty of Computer Science; 1 year, 3, 4 module)Rus
- Parallel and Distributed Computations (Master’s programme; Faculty of Computer Science; 1 year, 3, 4 module)Rus
- Recovery Dependencies Using Empirical Data (Master’s programme; Faculty of Computer Science; 1 year, 1, 2 module)Rus
Courses (2017/2018)
Algorithms and Data Structures 2 (Bachelor’s programme; Faculty of Computer Science; 2 year, 1 module)Rus
Publications25
- Article Babenko M. A., Kolesnichenko I., Smirnov I. Cascade Heap: Towards Time-Optimal Extractions // Theory of Computing Systems. 2019. Vol. 63. No. 4. P. 637-646. doi
- Article Artamonov S., Babenko M. A. A fast scaling algorithm for the weighted triangle-free 2-matching problem // European Journal of Combinatorics. 2018. P. 3-23. doi
- Chapter Babenko M. A., Колесниченко И. И. External memory algorithms for finding disjoint paths in undirected graphs(, in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 10706. Springer, 2018. doi P. 295-304. doi
- Chapter Babenko M. A., Колесниченко И. И., Smirnov I. Cascade heap: Towards time-optimal extractions, in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 10304. Springer, 2017. doi P. 62-70. doi
- Chapter Babenko M. A., Artamonov S. Faster algorithms for half-integral T -Path packing, in: 28th International Symposium on Algorithms and Computation, ISAAC 2017 Vol. 92. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, 2017. P. 1-12. doi
- Chapter Artamonov S., Babenko M. A. A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem, in: Combinatorial Algorithms. 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers Vol. 9538. Switzerland : Springer, 2016. doi P. 25-37. doi
- Article Babenko M. A., Goldberg A., Gupta A., Nagarajan V. Algorithms for Hub Label Optimization // ACM Transactions on Algorithms. 2016. Vol. 13. No. 1. P. 16:1-16:17. doi
- Article Maxim Babenko, Gawrychowski P., Kociumaka T., Kolesnichenko I., Starikovskaya T. Computing minimal and maximal suffixes of a substring // Theoretical Computer Science. 2016. Vol. 638. P. 112-121. doi
- Chapter Babenko M. A., Karzanov A. A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes, in: Computer Science -- Theory and Applications 10th International Computer Science Symposium in Russia, CSR 2015 Vol. 9139. Springer, 2015. P. 53-66. (in press)
- Chapter Babenko M. A., Goldberg A., Weller M., Savchenko R., Kaplan H. On the Complexity of Hub Labeling (Extended Abstract), in: Mathematical Foundations of Computer Science 2015 Vol. 9235. Springer, 2015. P. 62-74. (in press)
- Chapter Babenko M. A., Gawrychowski P., Kociumaka T., Starikovskaya T. Wavelet Trees Meet Suffix Trees, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. San Diego : SIAM, 2015. P. 572-591.
- Chapter Babenko M. A., Kociumaka T., Gawrychowski P., Starikovskaya T. Computing Minimal and Maximal Suffixes of a Substring Revisited, in: Lecture Notes in Computer Science Vol. 8486: Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching. Springer, 2014. P. 30-39.
- Article Maxim Babenko, Goldberg A. V., Gupta A., Nagarajan V. Algorithms for Hub Label Optimization // Lecture Notes in Computer Science. 2013. Vol. 7965. No. PART 1. P. 69-80.
- Article Maxim Babenko. Flow Decompositions in External Memory // Lecture Notes in Computer Science. 2013. Vol. 7741. P. 146-156.
- Article Maxim Babenko, Ignat Kolesnichenko, Starikovskaya T. On Minimal and Maximal Suffixes of a Substring // Lecture Notes in Computer Science. 2013. Vol. 7922. P. 28-37.
- Chapter Бабенко М.А., Пузыревский И.В. YT – эволюция системы распределенных вычислений // В кн.: Большие Данные в национальной экономике. М. : ЗАО "Открытые системы", 2013. С. 19-21.
- Article Babenko M. A., Artamonov S. I., Salikhov K. An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks // Lecture Notes in Computer Science. 2012. No. 7434. P. 109-120.
- Article Babenko M. A. Improved Algorithms for Even Factors and Square-Free Simple b-Matchings // Algorithmica. 2012. Vol. 64. No. 3. P. 362-383.
- Article Babenko M. A., Karzanov A. V. Min-Cost Multiflows in Node-Capacitated Undirected Networks // Journal of Combinatorial Optimization. 2012. Vol. 24. No. 3. P. 202-228.
- Article Babenko M. A., Puzyrevskiy I. V. Resilient Quicksort and Selection // Lecture Notes in Computer Science. 2012. No. 7353. P. 6-17.
- Article Бабенко М. А., Стариковская Т. А. Вычисление длиннейшей общей подстроки с одной ошибкой // Проблемы передачи информации. 2011. Т. 47. № 1. С. 28-33.
- Article Babenko M. A. A Fast Algorithm for the Path 2-Packing Problem // Theory of Computing Systems. 2010. No. 46(1). P. 59-79.
- Article Разенштейн И. П., Бабенко М. А., Колесниченко И. И. A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks // Lecture Notes in Computer Science. 2010. № 5901. С. 165-175.
- Article Babenko M. A., Razenshteyn I. P., Gusakov A. Triangle-Free 2-Matching Revisited // Lecture Notes in Computer Science. 2010. No. 6196. P. 120-129.
- Chapter Babenko M. A., Starikovskaya T. Computing Longest Common Substrings Via Suffix Arrays, in: Lecture Notes in Computer Science Vol. 5010: Proceedings of the Third International Computer Science Symposium in Russia. Berlin : Springer, 2008. P. 64-75.
10th International Computer Science Symposium in Russia
On July 13th-17th 2015, the 10th International Computer Science Symposium in Russia took place. The largest conference on theoretical informatics in Russia was organized by Irkutsk State University, the Higher School of Economics and Yandex. Vladimir Podolskii, Associate Professor at the Big Data and Information Retrieval School took part in the event as guest speaker. Maxim Babenko, Head of the Joint Department with Yandex also delivered a report during the event.