Follow
Dmitry Kosolobov
Title
Cited by
Cited by
Year
Computing runs on a general alphabet
D Kosolobov
Information Processing Letters 116 (3), 241-244, 2016
282016
Palindromic length in linear time
K Borozdin, D Kosolobov, M Rubinchik, AM Shur
28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017
272017
LZ-End parsing in compressed space
D Kempa, D Kosolobov
2017 Data Compression Conference (DCC), 350-359, 2017
252017
Pal k is Linear Recognizable Online
D Kosolobov, M Rubinchik, AM Shur
International Conference on Current Trends in Theory and Practice of …, 2015
222015
Lempel-Ziv factorization may be harder than computing all runs
D Kosolobov
arXiv preprint arXiv:1409.5641, 2014
192014
Finding distinct subpalindromes online
D Kosolobov, M Rubinchik, AM Shur
Proceedings of the Prague Stringology Conference 2013, 63-69, 2013
182013
Linear time minimum segmentation enables scalable founder reconstruction
T Norri, B Cazaux, D Kosolobov, V Mäkinen
Algorithms for Molecular Biology 14 (1), 1-15, 2019
132019
Faster lightweight lempel-ziv parsing
D Kosolobov
International Symposium on Mathematical Foundations of Computer Science, 432-444, 2015
132015
Tight lower bounds for the longest common extension problem
D Kosolobov
Information Processing Letters 125, 26-29, 2017
112017
Lempel–Ziv-like parsing in small space
D Kosolobov, D Valenzuela, G Navarro, SJ Puglisi
Algorithmica 82 (11), 3195-3215, 2020
82020
Linear time maximum segmentation problems in column stream model
B Cazaux, D Kosolobov, V Mäkinen, T Norri
International Symposium on String Processing and Information Retrieval, 322-336, 2019
72019
Online detection of repetitions with backtracking
D Kosolobov
Annual Symposium on Combinatorial Pattern Matching, 295-306, 2015
72015
Minimum segmentation for pan-genomic founder reconstruction in linear time
T Norri, B Cazaux, D Kosolobov, V Mäkinen
arXiv preprint arXiv:1805.03574, 2018
62018
LZ-End parsing in linear time
D Kempa, D Kosolobov
25th Annual European Symposium on Algorithms (ESA 2017), 2017
62017
Weighted ancestors in suffix trees revisited
D Belazzougui, D Kosolobov, SJ Puglisi, R Raman
arXiv preprint arXiv:2103.00462, 2021
52021
Detecting one-variable patterns
D Kosolobov, F Manea, D Nowotka
International Symposium on String Processing and Information Retrieval, 254-270, 2017
52017
Comparison of LZ77-type parsings
D Kosolobov, AM Shur
Information Processing Letters 141, 25-29, 2019
42019
Compressed multiple pattern matching
D Kosolobov, N Sivukhin
arXiv preprint arXiv:1811.01248, 2018
42018
О секвенциально-компактно-открытой топологии
АВ Осипов, ДА Косолобов
Вестник Удмуртского университета. Математика. Механика. Компьютерные науки …, 2011
42011
On two LZ78-style grammars: Compression bounds and compressed-space computation
G Badkobeh, T Gagie, S Inenaga, T Kociumaka, D Kosolobov, SJ Puglisi
International Symposium on String Processing and Information Retrieval, 51-67, 2017
32017
The system can't perform the operation now. Try again later.
Articles 1–20