Dmitry Kosolobov

According to our database1, Dmitry Kosolobov authored at least 33 papers between 2013 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Internal shortest absent word queries in constant time and linear space.
Theor. Comput. Sci., 2022

The Efficiency of the ANS Entropy Encoding.
CoRR, 2022

2021
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space.
CoRR, 2021

Lempel-Ziv Parsing for Sequences of Blocks.
Algorithms, 2021

Weighted Ancestors in Suffix Trees Revisited.
Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020
Lempel-Ziv-Like Parsing in Small Space.
Algorithmica, 2020

Optimal Skeleton Huffman Trees Revisited.
Proceedings of the Computer Science - Theory and Applications, 2020

2019
Comparison of LZ77-type parsings.
Inf. Process. Lett., 2019

Linear time minimum segmentation enables scalable founder reconstruction.
Algorithms Mol. Biol., 2019

Linear Time Maximum Segmentation Problems in Column Stream Model.
Proceedings of the String Processing and Information Retrieval, 2019

Compressed Multiple Pattern Matching.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time.
CoRR, 2018

Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Relations Between Greedy and Bit-Optimal LZ77 Encodings.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Run Compressed Rank/Select for Large Alphabets.
Proceedings of the 2018 Data Compression Conference, 2018

2017
Tight lower bounds for the longest common extension problem.
Inf. Process. Lett., 2017

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.
CoRR, 2017

Detecting One-Variable Patterns.
Proceedings of the String Processing and Information Retrieval, 2017

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.
Proceedings of the String Processing and Information Retrieval, 2017

LZ-End Parsing in Linear Time.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

LZ-End Parsing in Compressed Space.
Proceedings of the 2017 Data Compression Conference, 2017

Palindromic Length in Linear Time.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
Finding the leftmost critical factorization on unordered alphabet.
Theor. Comput. Sci., 2016

Computing runs on a general alphabet.
Inf. Process. Lett., 2016

Detecting Unary Patterns.
CoRR, 2016

2015
Lempel-Ziv Factorization May Be Harder Than Computing All Runs.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Pal k is Linear Recognizable Online.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Faster Lightweight Lempel-Ziv Parsing.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Online Detection of Repetitions with Backtracking.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014
$\mathrm{Pal}^k$ Is Linear Recognizable Online.
CoRR, 2014

Online Repetition Detection With Backtracking.
CoRR, 2014

Online Square Detection.
CoRR, 2014

2013
Finding Distinct Subpalindromes Online.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013


  Loading...