E-LIB Suche - Ergebnisse für: Kolpakov, Roman

1

Lower time bounds for parallel solving of the subset sum pr..:

Kolpakov, Roman ; Posypkin, Mikhail
Concurrency and Computation: Practice and Experience. 36 (2024) 18 - p. , 2024

Link: https://doi.org/10.1002/..

2

Almost Optimal Searching of Maximal Subrepetitions in a Wor:

Kolpakov, Roman
Mathematics. 10 (2022) 19 - p. 3569 , 2022

Link: https://doi.org/10.3390/..

3

A Criterion of Optimality of Some Parallelization Scheme fo..:

, In: Communications in Computer and Information Science; Optimization and Applications,

Kolpakov, Roman ; Posypkin, Mikhail - p. 455-464 , 2020

Link: https://doi.org/10.1007/..

4

Optimality and Complexity Analysis of a Branch-and-Bound Me..:

Kolpakov, Roman ; Posypkin, Mikhail
Open Computer Science. 11 (2020) 1 - p. 116-126 , 2020

Link: https://doi.org/10.1515/..

5

The scalability analysis of a parallel tree search algorith:

Kolpakov, Roman ; Posypkin, Mikhail
Optimization Letters. 14 (2020) 8 - p. 2211-2226 , 2020

Link: https://doi.org/10.1007/..

6

Optimal bounds for computing α-gapped repeats:

Crochemore, Maxime ; Kolpakov, Roman ; Kucherov, Gregory
Information and Computation. 268 (2019) - p. 104434 , 2019

Link: https://doi.org/10.1016/..

7

The Scalability Analysis of a Parallel Tree Search Algorith:

, In: Communications in Computer and Information Science; Optimization and Applications,

Kolpakov, Roman ; Posypkin, Mikhail - p. 186-201 , 2019

Link: https://doi.org/10.1007/..

8

On the number of gapped repeats with arbitrary gap:

Kolpakov, Roman
Theoretical Computer Science. 723 (2018) - p. 11-22 , 2018

Link: https://doi.org/10.1016/..

9

Searching of gapped repeats and subrepetitions in a word:

Kolpakov, Roman ; Podolskiy, Mikhail ; Posypkin, Mikhail.
Journal of Discrete Algorithms. 46-47 (2017) - p. 1-15 , 2017

Link: https://doi.org/10.1016/..

10

Indexing and querying color sets of images:

Belazzougui, Djamal ; Kolpakov, Roman ; Raffinot, Mathieu
Theoretical Computer Science. 647 (2016) - p. 74-84 , 2016

Link: https://doi.org/10.1016/..

11

Various improvements to text fingerprinting:

Belazzougui, Djamal ; Kolpakov, Roman ; Raffinot, Mathieu
Journal of Discrete Algorithms. 22 (2013) - p. 1-18 , 2013

Link: https://doi.org/10.1016/..

12

On primary and secondary repetitions in words:

Kolpakov, Roman
Theoretical Computer Science. 418 (2012) - p. 71-81 , 2012

Link: https://doi.org/10.1016/..

13

On the number of Dejean words over alphabets of 5, 6, 7, 8,..:

Kolpakov, Roman ; Rao, Michaël
Theoretical Computer Science. 412 (2011) 46 - p. 6507-6516 , 2011

Link: https://doi.org/10.1016/..

14

On maximal repetitions of arbitrary exponent:

Kolpakov, Roman ; Kucherov, Gregory ; Ochem, Pascal
Information Processing Letters. 110 (2010) 7 - p. 252-256 , 2010

Link: https://doi.org/10.1016/..

15

Searching for gapped palindromes:

Kolpakov, Roman ; Kucherov, Gregory
Theoretical Computer Science. 410 (2009) 51 - p. 5365-5373 , 2009

Link: https://doi.org/10.1016/..