Dmitry Kosolobov
Dmitry Kosolobov
Подтвержден адрес электронной почты в домене urfu.ru
Название
Процитировано
Процитировано
Год
Pal k is Linear Recognizable Online
D Kosolobov, M Rubinchik, AM Shur
International Conference on Current Trends in Theory and Practice of …, 2015
202015
Computing runs on a general alphabet
D Kosolobov
Information Processing Letters 116 (3), 241-244, 2016
192016
Lempel-Ziv factorization may be harder than computing all runs
D Kosolobov
arXiv preprint arXiv:1409.5641, 2014
162014
LZ-End parsing in compressed space
D Kempa, D Kosolobov
2017 Data Compression Conference (DCC), 350-359, 2017
152017
Palindromic length in linear time
K Borozdin, D Kosolobov, M Rubinchik, AM Shur
28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017
152017
Finding distinct subpalindromes online
D Kosolobov, M Rubinchik, AM Shur
Proceedings of the Prague Stringology Conference 2013, 63-69, 2013
142013
Faster lightweight lempel-ziv parsing
D Kosolobov
International Symposium on Mathematical Foundations of Computer Science, 432-444, 2015
92015
Tight lower bounds for the longest common extension problem
D Kosolobov
Information Processing Letters 125, 26-29, 2017
82017
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
52018
Detecting one-variable patterns
D Kosolobov, F Manea, D Nowotka
International Symposium on String Processing and Information Retrieval, 254-270, 2017
52017
Online detection of repetitions with backtracking
D Kosolobov
Annual Symposium on Combinatorial Pattern Matching, 295-306, 2015
52015
Relations between greedy and bit-optimal LZ77 encodings
D Kosolobov
arXiv preprint arXiv:1707.09789, 2017
32017
О секвенциально-компактно-открытой топологии
АВ Осипов, ДА Косолобов
Вестник Удмуртского университета. Математика. Механика. Компьютерные науки …, 2011
32011
Linear time minimum segmentation enables scalable founder reconstruction
T Norri, B Cazaux, D Kosolobov, V Mäkinen
Algorithms for Molecular Biology 14 (1), 12, 2019
22019
Finding the leftmost critical factorization on unordered alphabet
D Kosolobov
Theoretical Computer Science 636, 56-65, 2016
22016
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
12019
Lempel-Ziv-like Parsing in Small Space
D Valenzuela, D Kosolobov, G Navarro, SJ Puglisi
arXiv preprint arXiv:1903.01909, 2019
12019
Compressed multiple pattern matching
D Kosolobov, N Sivukhin
arXiv preprint arXiv:1811.01248, 2018
12018
Run Compressed Rank/Select for Large Alphabets
J Fuentes-Sepúlveda, J Kärkkäinen, D Kosolobov, S Puglisi
2018 Data Compression Conference, 315-324, 2018
12018
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
12017
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20