Dmitry Kosolobov

Available identifiers

Publication	Date of Publication	Type
Linear time maximum segmentation problems in column stream model	2024-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q6098778	2023-06-14	Paper
Optimal Skeleton Huffman Trees Revisited	2022-10-19	Paper
https://portal.mardi4nfdi.de/entity/Q5090343	2022-07-18	Paper
Compressed Multiple Pattern Matching	2022-07-18	Paper
Internal shortest absent word queries in constant time and linear space	2022-06-13	Paper
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation	2021-02-16	Paper
Detecting One-Variable Patterns	2021-02-16	Paper
Lempel-Ziv-like parsing in small space	2020-10-21	Paper
https://portal.mardi4nfdi.de/entity/Q3304145	2020-08-05	Paper
LZ-End Parsing in Linear Time	2020-05-27	Paper
Palindromic length in linear time	2020-05-25	Paper
Comparison of LZ77-type parsings	2018-11-09	Paper
Tight lower bounds for the longest common extension problem	2017-06-13	Paper
Lempel-Ziv Factorization May Be Harder Than Computing All Runs	2017-01-24	Paper
Finding the leftmost critical factorization on unordered alphabet	2016-06-01	Paper
Computing runs on a general alphabet	2016-01-05	Paper
Faster Lightweight Lempel-Ziv Parsing	2015-09-16	Paper
Online Detection of Repetitions with Backtracking	2015-08-20	Paper
Pal k is Linear Recognizable Online	2015-02-20	Paper

This page was built for person: Dmitry Kosolobov