About me

I am an Assistant Professor in the Talgo (Theory, ALgorithms, Graphs, and Optimization) team at the Computer Science Department of École normale supérieure, Paris, France. I am interested in algorithms on strings, small-space algorithms and data structures, streaming algorithms, property testing algorithms, lower bounds, and communication complexity.

Short bio

  • Assistant Professor, École normale supérieure, Paris, France, 2017-up to date
  • Postdoc, Université Paris-Diderot, Paris, France, 2016-2017
  • Research Associate, University of Bristol, Bristol, UK, 2015-2016
  • Assistant Professor, Department of Computer Science, Higher School of Economics, Moscow, Russia, 2013-1015
  • Ph.D. in Mathematics, Lomonosov Moscow State University, Moscow, Russia, 2013
  • M.Sc. in Data Science, Moscow Institute of Physics and Technology and Yandex School of Data Analysis, Moscow, Russia, 2009
  • M.Sc. in Mathematics, Lomonosov Moscow State University, Moscow, Russia, 2009

Programme committee work

In the past, I was on the following program committees: CPM 2017, SPIRE 2017, IWOCA 2016, CSR 2016 SPIRE 2015, CPM 2015, CPM 2014

Selected publications

  1. Improved bounds for testing Dyck languages with E. Fischer and F. Magniez, accepted to ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)

  2. Approximate Hamming distance in a stream with R. Clifford, in International Colloquium on Automata, Languages and Programming (ICALP 2016)

  3. The k-mismatch problem revisited with R. Clifford, A. Fontaine, E. Porat, B. Sach, in ACM-SIAM Symposium on Discrete Algorithms (SODA 2016)

  4. Dictionary Matching in a Stream with R. Clifford, A. Fontaine, E. Porat, B. Sach, in European Symposium on Algorithms (ESA 2015)

  5. Wavelet Trees Meet Suffix Trees with M. Babenko, P. Gawrychowski, T. Kociumaka, in ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)

  6. Sublinear Space Algorithms for the Longest Common Substring Problem. with T. Kociumaka and H. W. Vildhøj, in European Symposium on Algorithms (ESA 2014)