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
332016
LZ-End parsing in compressed space
D Kempa, D Kosolobov
2017 Data Compression Conference (DCC), 350-359, 2017
312017
Palindromic length in linear time
K Borozdin, D Kosolobov, M Rubinchik, AM Shur
28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017
302017
Pal k is Linear Recognizable Online
D Kosolobov, M Rubinchik, AM Shur
SOFSEM 2015: Theory and Practice of Computer Science: 41st International …, 2015
232015
Finding distinct subpalindromes online
D Kosolobov, M Rubinchik, AM Shur
Proceedings of the Prague Stringology Conference 2013, 63-69, 2013
212013
Lempel-Ziv factorization may be harder than computing all runs
D Kosolobov
arXiv preprint arXiv:1409.5641, 2014
202014
Faster lightweight lempel-ziv parsing
D Kosolobov
International Symposium on Mathematical Foundations of Computer Science, 432-444, 2015
172015
Weighted ancestors in suffix trees revisited
D Belazzougui, D Kosolobov, SJ Puglisi, R Raman
arXiv preprint arXiv:2103.00462, 2021
162021
Linear time minimum segmentation enables scalable founder reconstruction
T Norri, B Cazaux, D Kosolobov, V Mäkinen
Algorithms for Molecular Biology 14, 1-15, 2019
152019
LZ-End parsing in linear time
D Kempa, D Kosolobov
25th Annual European Symposium on Algorithms (ESA 2017), 2017
152017
Lempel–Ziv-like parsing in small space
D Kosolobov, D Valenzuela, G Navarro, SJ Puglisi
Algorithmica 82 (11), 3195-3215, 2020
132020
Tight lower bounds for the longest common extension problem
D Kosolobov
Information Processing Letters 125, 26-29, 2017
112017
Online detection of repetitions with backtracking
D Kosolobov
Annual Symposium on Combinatorial Pattern Matching, 295-306, 2015
112015
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
82019
Finding the leftmost critical factorization on unordered alphabet
D Kosolobov
Theoretical Computer Science 636, 56-65, 2016
82016
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
72017
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
Detecting one-variable patterns
D Kosolobov, F Manea, D Nowotka
International Symposium on String Processing and Information Retrieval, 254-270, 2017
62017
Comparison of LZ77-type parsings
D Kosolobov, AM Shur
Information Processing Letters 141, 25-29, 2019
42019
Relations between greedy and bit-optimal LZ77 encodings
D Kosolobov
arXiv preprint arXiv:1707.09789, 2017
42017
The system can't perform the operation now. Try again later.
Articles 1–20