D. Kosolobov

activity

20132022

most citedLZ-End Parsing in Compressed Space

18 citations · 54 across the 16 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

cs.DS2015

Finding the Leftmost Critical Factorization on Unordered Alphabet

Dmitry Kosolobov

We present a linear time and space algorithm computing the leftmost critical factorization of a given string on an unordered alphabet.

cs.DS2015★ 1 cited

Computing Runs on a General Alphabet

Dmitry Kosolobov

We describe a RAM algorithm computing all runs (maximal repetitions) of a given string of length $n$ over a general ordered alphabet in $O (n lo g^{\frac{2}{3}} n)$ time and linear spa…

cs.DS2015★ 1 cited

Faster Lightweight Lempel-Ziv Parsing

Dmitry Kosolobov

We present an algorithm that computes the Lempel-Ziv decomposition in $O (n (lo g σ + lo g lo g n))$ time and $n lo g σ + ε n$ bits of space, where $ε$ is a constant rational parameter, $n$ …