The following pages link to Dmitry Kosolobov (Q290523):
Displaying 19 items.
- Finding the leftmost critical factorization on unordered alphabet (Q290524) (← links)
- Computing runs on a general alphabet (Q903195) (← links)
- Comparison of LZ77-type parsings (Q1621503) (← links)
- Lempel-Ziv-like parsing in small space (Q2205632) (← links)
- Tight lower bounds for the longest common extension problem (Q2628282) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Online Detection of Repetitions with Backtracking (Q2942265) (← links)
- Faster Lightweight Lempel-Ziv Parsing (Q2946413) (← links)
- Lempel-Ziv Factorization May Be Harder Than Computing All Runs (Q2955025) (← links)
- (Q3304145) (← links)
- Optimal Skeleton Huffman Trees Revisited (Q5042248) (← links)
- Compressed Multiple Pattern Matching (Q5088902) (← links)
- (Q5090343) (← links)
- Palindromic length in linear time (Q5110889) (← links)
- LZ-End Parsing in Linear Time (Q5111742) (← links)
- On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation (Q5150918) (← links)
- Detecting One-Variable Patterns (Q5150937) (← links)
- Pal k is Linear Recognizable Online (Q5175115) (← links)
- (Q6098778) (← links)
