Dmitry Kosolobov

According to our database, Dmitry Kosolobov authored at least 37 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Relating Left and Right Extensions of Maximal Repeats.

Shunsuke Inenaga, Dmitry Kosolobov

CoRR, 2024

Closed Repeats.

Dmitry Kosolobov

CoRR, 2024

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

Dmitry Kosolobov, Nikita Sivukhin

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

Simplified Tight Bounds for Monotone Minimal Perfect Hashing.

Dmitry Kosolobov

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2022

Internal shortest absent word queries in constant time and linear space.

Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis

Theor. Comput. Sci., 2022

The Efficiency of the ANS Entropy Encoding.

Dmitry Kosolobov

CoRR, 2022

2021

Lempel-Ziv Parsing for Sequences of Blocks.

Dmitry Kosolobov, Daniel Valenzuela

Algorithms, 2021

Weighted Ancestors in Suffix Trees Revisited.

Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

Lempel-Ziv-Like Parsing in Small Space.

Dmitry Kosolobov, Daniel Valenzuela, Gonzalo Navarro, Simon J. Puglisi

Algorithmica, 2020

Ordered Strip Packing.

Kevin Buchin, Dmitry Kosolobov, Willem Sonke, Bettina Speckmann, Kevin Verbeek

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Optimal Skeleton Huffman Trees Revisited.

Dmitry Kosolobov, Oleg Merkurev

Proceedings of the Computer Science - Theory and Applications, 2020

2019

Comparison of LZ77-type parsings.

Dmitry Kosolobov, Arseny M. Shur

Inf. Process. Lett., 2019

Linear time minimum segmentation enables scalable founder reconstruction.

Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen

Algorithms Mol. Biol., 2019

Linear Time Maximum Segmentation Problems in Column Stream Model.

Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen, Tuukka Norri

Proceedings of the String Processing and Information Retrieval, 2019

Compressed Multiple Pattern Matching.

Dmitry Kosolobov, Nikita Sivukhin

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

2018

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

Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen

CoRR, 2018

Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time.

Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen

Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Relations Between Greedy and Bit-Optimal LZ77 Encodings.

Dmitry Kosolobov

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Run Compressed Rank/Select for Large Alphabets.

José Fuentes-Sepúlveda, Juha Kärkkäinen, Dmitry Kosolobov, Simon J. Puglisi

Proceedings of the 2018 Data Compression Conference, 2018

2017

Tight lower bounds for the longest common extension problem.

Dmitry Kosolobov

Inf. Process. Lett., 2017

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

Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Dmitry Kosolobov, Simon J. Puglisi

CoRR, 2017

Detecting One-Variable Patterns.

Dmitry Kosolobov, Florin Manea, Dirk Nowotka

Proceedings of the String Processing and Information Retrieval, 2017

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

Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi

Proceedings of the String Processing and Information Retrieval, 2017

LZ-End Parsing in Linear Time.

Dominik Kempa, Dmitry Kosolobov

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

LZ-End Parsing in Compressed Space.

Dominik Kempa, Dmitry Kosolobov

Proceedings of the 2017 Data Compression Conference, 2017

Palindromic Length in Linear Time.

Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

Finding the leftmost critical factorization on unordered alphabet.

Dmitry Kosolobov

Theor. Comput. Sci., 2016

Computing runs on a general alphabet.

Dmitry Kosolobov

Inf. Process. Lett., 2016

Detecting Unary Patterns.

Dmitry Kosolobov, Florin Manea, Dirk Nowotka

CoRR, 2016

2015

Lempel-Ziv Factorization May Be Harder Than Computing All Runs.

Dmitry Kosolobov

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Pal k is Linear Recognizable Online.

Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Faster Lightweight Lempel-Ziv Parsing.

Dmitry Kosolobov

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Online Detection of Repetitions with Backtracking.

Dmitry Kosolobov

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

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

Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur

CoRR, 2014

Online Repetition Detection With Backtracking.

Dmitry Kosolobov

CoRR, 2014

Online Square Detection.

Dmitry Kosolobov

CoRR, 2014

2013

Finding Distinct Subpalindromes Online.

Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013