On the Complexity of Generation of Rational Numbers by Boolean Functions. - Roman M. Kolpakov (Fundam. Informaticae, 1995)

Minimal Letter Frequency in n-th Power-Free Binary Words. - Roman M. Kolpakov; Gregory Kucherov (MFCS, 1997)

On Maximal Repetitions in Words. - Roman M. Kolpakov; Gregory Kucherov (FCT, 1999)

Finding Maximal Repetitions in a Word in Linear Time. - Roman M. Kolpakov; Gregory Kucherov (FOCS, 1999)

On Repetition-Free Binary Words of Minimal Density. - Roman M. Kolpakov; Gregory Kucherov; Yuriy V. Tarannikov (Theor. Comput. Sci., 1999)

Finding Repeats with Fixed Gap. - Roman M. Kolpakov; Gregory Kucherov (SPIRE, 2000)

Classes of Binary Rational Distributions Closed under Discrete Transformations. - Roman Kolpakov (SAGA, 2003)

mreps: efficient and flexible detection of tandem repeats in DNA. - Roman M. Kolpakov; Ghizlane Bana; Gregory Kucherov (Nucleic Acids Res., 2003)

Finding approximate repetitions under Hamming distance. - Roman M. Kolpakov; Gregory Kucherov (Theor. Comput. Sci., 2003)

Real-Time String Matching in Sublinear Space. - Leszek Gasieniec; Roman M. Kolpakov (CPM, 2004)

Criterion of generativeness of sets of rational probabilities by a class of Boolean functions. - Roman M. Kolpakov (Discret. Appl. Math., 2004)

Linear-time computation of local periods. - Jean-Pierre Duval; Roman Kolpakov; Gregory Kucherov; Thierry Lecroq; Arnaud Lefebvre (Theor. Comput. Sci., 2004)

Real-Time Traversal in Grammar-Based Compressed Files. - Leszek Gasieniec; Roman M. Kolpakov; Igor Potapov; Paul Sant (DCC, 2005)

Polynomial Time Checking for Generation of Finite Distributions of Rational Probabilities. - Roman Kolpakov (SAGA, 2005)

Space efficient search for maximal repetitions. - Leszek Gasieniec; Roman M. Kolpakov; Igor Potapov (Theor. Comput. Sci., 2005)

Faster Text Fingerprinting. - Roman Kolpakov; Mathieu Raffinot (SPIRE, 2008)

New algorithms for text fingerprinting. - Roman Kolpakov; Mathieu Raffinot (J. Discrete Algorithms, 2008)

Searching for gapped palindromes. - Roman Kolpakov; Gregory Kucherov (Theor. Comput. Sci., 2009)

On maximal repetitions of arbitrary exponent. - Roman Kolpakov; Gregory Kucherov; Pascal Ochem (Inf. Process. Lett., 2010)

Pattern Matching on Sparse Suffix Trees. - Roman Kolpakov; Gregory Kucherov; Tatiana Starikovskaya (CCP, 2011)

Linear pattern matching on sparse suffix trees - Roman Kolpakov; Gregory Kucherov; Tatiana Starikovskaya (CoRR, 2011)

On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters. - Roman Kolpakov; Michaël Rao (Theor. Comput. Sci., 2011)

On primary and secondary repetitions in words. - Roman Kolpakov (Theor. Comput. Sci., 2012)

Various improvements to text fingerprinting. - Djamal Belazzougui; Roman Kolpakov; Mathieu Raffinot (J. Discrete Algorithms, 2013)

Optimal searching of gapped repeats in a word. - Maxime Crochemore; Roman Kolpakov; Gregory Kucherov (CoRR, 2015)

Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method. - Roman Kolpakov; Mikhail Posypkin (CoRR, 2015)

Optimal Bounds for Computing alpha α -gapped Repeats. - Maxime Crochemore; Roman Kolpakov; Gregory Kucherov (LATA, 2016)

Indexing and querying color sets of images. - Djamal Belazzougui; Roman Kolpakov; Mathieu Raffinot (Theor. Comput. Sci., 2016)

Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering. - Roman M. Kolpakov; Mikhail Posypkin; Si Thu Thant Sin (Autom. Remote. Control., 2017)

Searching of gapped repeats and subrepetitions in a word. - Roman Kolpakov; Mikhail Podolskiy; Mikhail Posypkin; Nickolay Khrapov (J. Discrete Algorithms, 2017)

On the number of gapped repeats with arbitrary gap. - Roman Kolpakov (Theor. Comput. Sci., 2018)

Optimal bounds for computing α-gapped repeats. - Maxime Crochemore; Roman Kolpakov; Gregory Kucherov (Inf. Comput., 2019)

Some results on the number of periodic factors in words. - Roman Kolpakov (Inf. Comput., 2020)

The scalability analysis of a parallel tree search algorithm. - Roman Kolpakov; Mikhail Posypkin (Optim. Lett., 2020)

Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem. - Roman Kolpakov; Mikhail Posypkin (Open Comput. Sci., 2021)

Almost optimal searching of maximal subrepetitions in a word. - Roman Kolpakov (CoRR, 2022)

Lower time bounds for parallel solving of the subset sum problem by a dynamic programming algorithm. - Roman Kolpakov; Mikhail Posypkin (Concurr. Comput. Pract. Exp., 2024)

The comparing analysis of two parallelization schemes for computations with round memory. - Roman Kolpakov (Discret. Math. Algorithms Appl., 2025)