Research interests

English language proficiency: С1

  • Combinatorics and Algorithmics of Strings and Related Objects;
  • Combinatorics on words, stringology, related aspects of formal languages, automata, trees, and graphs.

Supervisor’s specific requirements to prospective PhD students:

  • Strong background in discrete mathematics and theoretical computer science: algorithms and complexity, formal languages and automata, graphs, combinatorics and discrete probability
  • Programming skills are appreciated.

Research output

  1. On minimal critical exponent of balanced sequences

    Research output: Contribution to journalArticlepeer-review

  2. Computing The Maximum Exponent in a Stream

    Research output: Contribution to journalArticlepeer-review

  3. Abelian Repetition Threshold Revisited

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

View all (76) »

ID: 61788