Roman M. Kolpakov

15 papers A* 1A 1B 5C 1Journal 7
YearRankTypeTitle / Venue / Authors
2017 J jnl
Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering.
Autom. Remote. Control.
Roman M. Kolpakov, Mikhail Posypkin, Si Thu Thant Sin
2005 B conf
Real-Time Traversal in Grammar-Based Compressed Files.
DCC
Leszek Gasieniec, Roman M. Kolpakov, Igor Potapov, Paul Sant
2005 J jnl
Space efficient search for maximal repetitions.
Theor. Comput. Sci.
Leszek Gasieniec, Roman M. Kolpakov, Igor Potapov
2004 J jnl
Criterion of generativeness of sets of rational probabilities by a class of Boolean functions.
Discret. Appl. Math.
Roman M. Kolpakov
2004 B conf
Real-Time String Matching in Sublinear Space.
CPM
Leszek Gasieniec, Roman M. Kolpakov
2003 J jnl
Finding approximate repetitions under Hamming distance.
Theor. Comput. Sci.
Roman M. Kolpakov, Gregory Kucherov
2003 J jnl
mreps: efficient and flexible detection of tandem repeats in DNA.
Nucleic Acids Res.
Roman M. Kolpakov, Ghizlane Bana, Gregory Kucherov
2001 A conf
Finding Approximate Repetitions under Hamming Distance.
ESA
Roman M. Kolpakov, Gregory Kucherov
2000 C conf
Finding Repeats with Fixed Gap.
SPIRE
Roman M. Kolpakov, Gregory Kucherov
1999 A* conf
Finding Maximal Repetitions in a Word in Linear Time.
FOCS
Roman M. Kolpakov, Gregory Kucherov
1999 B conf
On Maximal Repetitions in Words.
FCT
Roman M. Kolpakov, Gregory Kucherov
1999 J jnl
On Repetition-Free Binary Words of Minimal Density.
Theor. Comput. Sci.
Roman M. Kolpakov, Gregory Kucherov, Yuriy V. Tarannikov
1998 B conf
On Repetition-Free Binary Words of Minimal Density.
MFCS
Roman M. Kolpakov, Gregory Kucherov, Yuriy V. Tarannikov
1997 B conf
Minimal Letter Frequency in n-th Power-Free Binary Words.
MFCS
Roman M. Kolpakov, Gregory Kucherov
1995 J jnl
On the Complexity of Generation of Rational Numbers by Boolean Functions.
Fundam. Informaticae
Roman M. Kolpakov