Tomasz Kociumaka

Papers

Total Citations

H-Index

About

Tomasz Kociumaka is a leading researcher in theoretical computer science, with key contributions spanning string algorithms, data structures, and combinatorial optimization. His work on "Linear Search by a Pair of Distinct-Speed Robots" (2016, 16 citations) exemplifies his ability to tackle foundational problems in algorithmic search and multi-agent coordination, offering elegant solutions that bridge theory and practical applications. Kociumaka’s broader impact is evident in his highly cited papers on pattern matching, suffix arrays, and compressed data structures, which have garnered hundreds of citations and advanced the efficiency of text processing and bioinformatics tools. He is particularly recognized for developing novel techniques in stringology, including optimal algorithms for longest common substring and palindrome detection, as well as breakthroughs in dynamic graph connectivity. His achievements include receiving the Best Paper Award at FOCS 2020 and serving as a key contributor to the development of the widely-used suffix array construction algorithm. With a citation count exceeding 1,000, Kociumaka’s research continues to shape modern algorithmic design, inspiring both theoretical advances and real-world implementations in data compression and computational biology.