Roman M. Kolpakov
List of publications from the DBLP Bibliography Server - FAQ
| 2009 | ||
|---|---|---|
| 23 | Roman Kolpakov, Gregory Kucherov, Pascal Ochem: On maximal repetitions of arbitrary exponent CoRR abs/0906.4750: (2009) | |
| 2008 | ||
| 22 | Roman Kolpakov, Gregory Kucherov: Searching for Gapped Palindromes. CPM 2008: 18-30 | |
| 21 | Roman Kolpakov, Mathieu Raffinot: Faster Text Fingerprinting. SPIRE 2008: 15-26 | |
| 20 | Roman Kolpakov, Mathieu Raffinot: New algorithms for text fingerprinting. J. Discrete Algorithms 6(2): 243-255 (2008) | |
| 2006 | ||
| 19 | Roman Kolpakov, Mathieu Raffinot: New Algorithms for Text Fingerprinting. CPM 2006: 342-353 | |
| 2005 | ||
| 18 | Leszek Gasieniec, Roman M. Kolpakov, Igor Potapov, Paul Sant: Real-Time Traversal in Grammar-Based Compressed Files. DCC 2005: 458 | |
| 17 | Roman Kolpakov: Polynomial Time Checking for Generation of Finite Distributions of Rational Probabilities. SAGA 2005: 48-57 | |
| 16 | Leszek Gasieniec, Roman M. Kolpakov, Igor Potapov: Space efficient search for maximal repetitions. Theor. Comput. Sci. 339(1): 35-48 (2005) | |
| 2004 | ||
| 15 | Leszek Gasieniec, Roman M. Kolpakov: Real-Time String Matching in Sublinear Space. CPM 2004: 117-129 | |
| 14 | Roman M. Kolpakov: Criterion of generativeness of sets of rational probabilities by a class of Boolean functions. Discrete Applied Mathematics 135(1-3): 125-142 (2004) | |
| 13 | 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) | |
| 2003 | ||
| 12 | Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre: Linear-Time Computation of Local Periods. MFCS 2003: 388-397 | |
| 11 | Roman Kolpakov: Classes of Binary Rational Distributions Closed under Discrete Transformations. SAGA 2003: 157-166 | |
| 10 | Roman M. Kolpakov, Ghizlane Bana, Gregory Kucherov: mreps: efficient and flexible detection of tandem repeats in DNA. Nucleic Acids Research 31(13): 3672-3678 (2003) | |
| 9 | Roman M. Kolpakov, Gregory Kucherov: Finding approximate repetitions under Hamming distance. Theor. Comput. Sci. 1(303): 135-156 (2003) | |
| 2001 | ||
| 8 | Roman M. Kolpakov, Gregory Kucherov: Finding Approximate Repetitions under Hamming Distance. ESA 2001: 170-181 | |
| 2000 | ||
| 7 | Roman M. Kolpakov, Gregory Kucherov: Finding Repeats with Fixed Gap. SPIRE 2000: 162-168 | |
| 1999 | ||
| 6 | Roman M. Kolpakov, Gregory Kucherov: On Maximal Repetitions in Words. FCT 1999: 374-385 | |
| 5 | Roman M. Kolpakov, Gregory Kucherov: Finding Maximal Repetitions in a Word in Linear Time. FOCS 1999: 596-604 | |
| 4 | Roman M. Kolpakov, Gregory Kucherov, Yuriy Tarannikov: On Repetition-Free Binary Words of Minimal Density. Theor. Comput. Sci. 218(1): 161-175 (1999) | |
| 1998 | ||
| 3 | Roman M. Kolpakov, Gregory Kucherov, Yuriy Tarannikov: On Repetition-Free Binary Words of Minimal Density. MFCS 1998: 683-692 | |
| 1997 | ||
| 2 | Roman M. Kolpakov, Gregory Kucherov: Minimal Letter Frequency in n-th Power-Free Binary Words. MFCS 1997: 347-357 | |
| 1995 | ||
| 1 | Roman M. Kolpakov: On the Complexity of Generation of Rational Numbers by Boolean Functions. Fundam. Inform. 22(3): 289-298 (1995) | |
| 1 | Ghizlane Bana | [10] |
| 2 | Jean-Pierre Duval | [12] [13] |
| 3 | Leszek Gasieniec | [15] [16] [18] |
| 4 | Gregory Kucherov | [2] [3] [4] [5] [6] [7] [8] [9] [10] [12] [13] [22] [23] |
| 5 | Thierry Lecroq | [12] [13] |
| 6 | Arnaud Lefebvre | [12] [13] |
| 7 | Pascal Ochem | [23] |
| 8 | Igor Potapov | [16] [18] |
| 9 | Mathieu Raffinot | [19] [20] [21] |
| 10 | Paul Sant | [18] |
| 11 | Yuriy Tarannikov | [3] [4] |