Roman Kolpakov

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 14

Top Topics

Tree Search Algorithm

Retrieving Images

Complexity Analysis

Top Venues

Theor. Comput. Sci.

Publications

Roman Kolpakov, Mikhail Posypkin
Lower time bounds for parallel solving of the subset sum problem by a dynamic programming algorithm. Concurr. Comput. Pract. Exp. 36 (18) (2024)
Roman Kolpakov
Almost optimal searching of maximal subrepetitions in a word. CoRR (2022)
Roman Kolpakov, Mikhail Posypkin
Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem. Open Comput. Sci. 11 (1) (2021)
Roman Kolpakov
Some results on the number of periodic factors in words. Inf. Comput. 270 (2020)
Roman Kolpakov, Mikhail Posypkin
The scalability analysis of a parallel tree search algorithm. Optim. Lett. 14 (8) (2020)
Maxime Crochemore, Roman Kolpakov, Gregory Kucherov
-gapped repeats. Inf. Comput. 268 (2019)
Roman Kolpakov
On the number of gapped repeats with arbitrary gap. Theor. Comput. Sci. 723 (2018)
Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov
Searching of gapped repeats and subrepetitions in a word. J. Discrete Algorithms (2017)
Roman Kolpakov
On the number of gapped repeats with arbitrary gap. CoRR (2017)
Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot
Indexing and querying color sets of images. CoRR (2016)
Maxime Crochemore, Roman Kolpakov, Gregory Kucherov
Optimal Bounds for Computing \alpha α -gapped Repeats. LATA (2016)
Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot
Indexing and querying color sets of images. Theor. Comput. Sci. 647 (2016)
Maxime Crochemore, Roman Kolpakov, Gregory Kucherov
Optimal searching of gapped repeats in a word. CoRR (2015)
Roman Kolpakov, Mikhail Posypkin
Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method. CoRR (2015)
Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov
Searching of Gapped Repeats and Subrepetitions in a Word. CPM (2014)
Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot
Various improvements to text fingerprinting CoRR (2013)
Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov
Searching of gapped repeats and subrepetitions in a word. CoRR (2013)
Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot
Various improvements to text fingerprinting. J. Discrete Algorithms 22 (2013)
Roman Kolpakov
On primary and secondary repetitions in words. Theor. Comput. Sci. 418 (2012)
Roman Kolpakov
On primary and secondary repetitions in words CoRR (2011)
Roman Kolpakov, Gregory Kucherov, Tatiana Starikovskaya
Pattern Matching on Sparse Suffix Trees. CCP (2011)
Roman Kolpakov, Michaël Rao
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters CoRR (2011)
Roman Kolpakov, Gregory Kucherov, Tatiana Starikovskaya
Linear pattern matching on sparse suffix trees CoRR (2011)
Roman Kolpakov, Michaël Rao
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters. Theor. Comput. Sci. 412 (46) (2011)
Roman Kolpakov, Gregory Kucherov, Pascal Ochem
On maximal repetitions of arbitrary exponent. Inf. Process. Lett. 110 (7) (2010)
Roman Kolpakov, Gregory Kucherov, Pascal Ochem
On maximal repetitions of arbitrary exponent CoRR (2009)
Roman Kolpakov, Gregory Kucherov
Searching for gapped palindromes. Theor. Comput. Sci. 410 (51) (2009)
Roman Kolpakov, Gregory Kucherov
Searching for Gapped Palindromes. CPM (2008)
Roman Kolpakov, Mathieu Raffinot
New algorithms for text fingerprinting. J. Discrete Algorithms 6 (2) (2008)
Roman Kolpakov, Mathieu Raffinot
Faster Text Fingerprinting. SPIRE (2008)
Roman Kolpakov, Mathieu Raffinot
New Algorithms for Text Fingerprinting. CPM (2006)
Roman Kolpakov
Polynomial Time Checking for Generation of Finite Distributions of Rational Probabilities. SAGA (2005)
Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre
Linear-time computation of local periods. Theor. Comput. Sci. 326 (1-3) (2004)
Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre
Linear-Time Computation of Local Periods. MFCS (2003)
Roman Kolpakov
Classes of Binary Rational Distributions Closed under Discrete Transformations. SAGA (2003)