Research area: Algorithms and theory → String algorithms and data compression
Dr. Tomasz Kociumaka
Google scholar: link
Tomasz Kociumaka received the B.Sc., M.Sc., and Ph.D. degrees in computer science from the University of Warsaw, Poland. He has been a post-doctoral researcher at Bar-Ilan University, Israel; the University of California at Berkeley, USA; and the Max Planck Institute for Informatics, Saarbrücken, Germany. His research focuses on designing efficient algorithms for processing strings, with an emphasis on sequence similarity measures, approximate pattern matching, text indexing, and lossless data compression.
He studies string problems from multiple perspectives, including combinatorics on words, dynamic algorithms, fine-grained complexity, sublinear algorithms, and quantum computing. He is a co-author of over 100 publications, including 28 papers presented at the top three conferences in theoretical computer science (STOC, FOCS, and SODA). He has served as a program committee member for ten international conferences. He received the ERCIM Cor Baayen Young Researcher Award in 2021 and the Witold Lipski Prize in 2018. As a student, he scored a gold medal at the International Olympiad in Informatics, a silver medal at the International Mathematical Olympiad, and two silver medals at the International Collegiate Programming Contest World Finals.