Roman Kolpakov

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