default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoman Kolpakov
Person information
- affiliation: University of Liverpool, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]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)- 2022
- [i11]Roman Kolpakov:
Almost optimal searching of maximal subrepetitions in a word. CoRR abs/2208.04380 (2022) - 2021
- [j21]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): 116-126 (2021) - 2020
- [j20]Roman Kolpakov:
Some results on the number of periodic factors in words. Inf. Comput. 270 (2020) - [j19]Roman Kolpakov, Mikhail Posypkin:
The scalability analysis of a parallel tree search algorithm. Optim. Lett. 14(8): 2211-2226 (2020)
2010 – 2019
- 2019
- [j18]Maxime Crochemore, Roman Kolpakov, Gregory Kucherov:
Optimal bounds for computing α-gapped repeats. Inf. Comput. 268 (2019) - 2018
- [j17]Roman Kolpakov:
On the number of gapped repeats with arbitrary gap. Theor. Comput. Sci. 723: 11-22 (2018) - 2017
- [j16]Roman M. Kolpakov, Mikhail Posypkin, Si Tu Tant Sin:
Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering. Autom. Remote. Control. 78(3): 463-474 (2017) - [j15]Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov:
Searching of gapped repeats and subrepetitions in a word. J. Discrete Algorithms 46-47: 1-15 (2017) - [i10]Roman Kolpakov:
On the number of gapped repeats with arbitrary gap. CoRR abs/1701.01190 (2017) - 2016
- [j14]Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot:
Indexing and querying color sets of images. Theor. Comput. Sci. 647: 74-84 (2016) - [c17]Maxime Crochemore, Roman Kolpakov, Gregory Kucherov:
Optimal Bounds for Computing \alpha α -gapped Repeats. LATA 2016: 245-255 - [i9]Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot:
Indexing and querying color sets of images. CoRR abs/1608.07847 (2016) - 2015
- [i8]Roman Kolpakov, Mikhail Posypkin:
Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method. CoRR abs/1506.06284 (2015) - [i7]Maxime Crochemore, Roman Kolpakov, Gregory Kucherov:
Optimal searching of gapped repeats in a word. CoRR abs/1509.01221 (2015) - 2014
- [c16]Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov:
Searching of Gapped Repeats and Subrepetitions in a Word. CPM 2014: 212-221 - 2013
- [j13]Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot:
Various improvements to text fingerprinting. J. Discrete Algorithms 22: 1-18 (2013) - [i6]Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot:
Various improvements to text fingerprinting. CoRR abs/1301.3488 (2013) - [i5]Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov:
Searching of gapped repeats and subrepetitions in a word. CoRR abs/1309.4055 (2013) - 2012
- [j12]Roman Kolpakov:
On primary and secondary repetitions in words. Theor. Comput. Sci. 418: 71-81 (2012) - 2011
- [j11]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): 6507-6516 (2011) - [c15]Roman Kolpakov, Gregory Kucherov, Tatiana Starikovskaya:
Pattern Matching on Sparse Suffix Trees. CCP 2011: 92-97 - [i4]Roman Kolpakov, Gregory Kucherov, Tatiana Starikovskaya:
Linear pattern matching on sparse suffix trees. CoRR abs/1103.2613 (2011) - [i3]Roman Kolpakov:
On primary and secondary repetitions in words. CoRR abs/1103.5230 (2011) - [i2]Roman Kolpakov, Michaël Rao:
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters. CoRR abs/1105.3116 (2011) - 2010
- [j10]Roman Kolpakov, Gregory Kucherov, Pascal Ochem:
On maximal repetitions of arbitrary exponent. Inf. Process. Lett. 110(7): 252-256 (2010)
2000 – 2009
- 2009
- [j9]Roman Kolpakov, Gregory Kucherov:
Searching for gapped palindromes. Theor. Comput. Sci. 410(51): 5365-5373 (2009) - [i1]Roman Kolpakov, Gregory Kucherov, Pascal Ochem:
On maximal repetitions of arbitrary exponent. CoRR abs/0906.4750 (2009) - 2008
- [j8]Roman Kolpakov, Mathieu Raffinot:
New algorithms for text fingerprinting. J. Discrete Algorithms 6(2): 243-255 (2008) - [c14]Roman Kolpakov, Gregory Kucherov:
Searching for Gapped Palindromes. CPM 2008: 18-30 - [c13]Roman Kolpakov, Mathieu Raffinot:
Faster Text Fingerprinting. SPIRE 2008: 15-26 - 2006
- [c12]Roman Kolpakov, Mathieu Raffinot:
New Algorithms for Text Fingerprinting. CPM 2006: 342-353 - 2005
- [j7]Leszek Gasieniec, Roman M. Kolpakov, Igor Potapov:
Space efficient search for maximal repetitions. Theor. Comput. Sci. 339(1): 35-48 (2005) - [c11]Leszek Gasieniec, Roman M. Kolpakov, Igor Potapov, Paul Sant:
Real-Time Traversal in Grammar-Based Compressed Files. DCC 2005: 458 - [c10]Roman Kolpakov:
Polynomial Time Checking for Generation of Finite Distributions of Rational Probabilities. SAGA 2005: 48-57 - 2004
- [j6]Roman M. Kolpakov:
Criterion of generativeness of sets of rational probabilities by a class of Boolean functions. Discret. Appl. Math. 135(1-3): 125-142 (2004) - [j5]Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre:
Linear-time computation of local periods. Theor. Comput. Sci. 326(1-3): 229-240 (2004) - [c9]Leszek Gasieniec, Roman M. Kolpakov:
Real-Time String Matching in Sublinear Space. CPM 2004: 117-129 - 2003
- [j4]Roman M. Kolpakov, Ghizlane Bana, Gregory Kucherov:
mreps: efficient and flexible detection of tandem repeats in DNA. Nucleic Acids Res. 31(13): 3672-3678 (2003) - [j3]Roman M. Kolpakov, Gregory Kucherov:
Finding approximate repetitions under Hamming distance. Theor. Comput. Sci. 303(1): 135-156 (2003) - [c8]Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre:
Linear-Time Computation of Local Periods. MFCS 2003: 388-397 - [c7]Roman Kolpakov:
Classes of Binary Rational Distributions Closed under Discrete Transformations. SAGA 2003: 157-166 - 2001
- [c6]Roman M. Kolpakov, Gregory Kucherov:
Finding Approximate Repetitions under Hamming Distance. ESA 2001: 170-181 - 2000
- [c5]Roman M. Kolpakov, Gregory Kucherov:
Finding Repeats with Fixed Gap. SPIRE 2000: 162-168
1990 – 1999
- 1999
- [j2]Roman M. Kolpakov, Gregory Kucherov, Yuriy V. Tarannikov:
On Repetition-Free Binary Words of Minimal Density. Theor. Comput. Sci. 218(1): 161-175 (1999) - [c4]Roman M. Kolpakov, Gregory Kucherov:
On Maximal Repetitions in Words. FCT 1999: 374-385 - [c3]Roman M. Kolpakov, Gregory Kucherov:
Finding Maximal Repetitions in a Word in Linear Time. FOCS 1999: 596-604 - 1998
- [c2]Roman M. Kolpakov, Gregory Kucherov, Yuriy V. Tarannikov:
On Repetition-Free Binary Words of Minimal Density. MFCS 1998: 683-692 - 1997
- [c1]Roman M. Kolpakov, Gregory Kucherov:
Minimal Letter Frequency in n-th Power-Free Binary Words. MFCS 1997: 347-357 - 1995
- [j1]Roman M. Kolpakov:
On the Complexity of Generation of Rational Numbers by Boolean Functions. Fundam. Informaticae 22(3): 289-298 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
