Dmitry Kosolobov

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 38

Top Topics

Pattern Matching

Compressed Text

Top Venues

Inf. Process. Lett.

Publications

Dmitry Kosolobov
Simplified Tight Bounds for Monotone Minimal Perfect Hashing. CoRR (2024)
Dmitry Kosolobov, Nikita Sivukhin
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space. CPM (2024)
Dmitry Kosolobov
Simplified Tight Bounds for Monotone Minimal Perfect Hashing. CPM (2024)
Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis
Internal shortest absent word queries in constant time and linear space. Theor. Comput. Sci. 922 (2022)
Dmitry Kosolobov
The Efficiency of the ANS Entropy Encoding. CoRR (2022)
Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis
Internal Shortest Absent Word Queries in Constant Time and Linear Space. CoRR (2021)
Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman
Weighted Ancestors in Suffix Trees Revisited. CoRR (2021)
Dmitry Kosolobov, Daniel Valenzuela
Lempel-Ziv Parsing for Sequences of Blocks. Algorithms 14 (12) (2021)
Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman
Weighted Ancestors in Suffix Trees Revisited. CPM (2021)
Dmitry Kosolobov, Nikita Sivukhin
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space. CoRR (2021)
Dmitry Kosolobov, Oleg Merkurev
Optimal Skeleton Huffman Trees Revisited. CSR (2020)
Dmitry Kosolobov, Daniel Valenzuela, Gonzalo Navarro, Simon J. Puglisi
Lempel-Ziv-Like Parsing in Small Space. Algorithmica 82 (11) (2020)
Dmitry Kosolobov, Oleg Merkurev
Optimal Skeleton Huffman Trees Revisited. CoRR (2020)
Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen
Linear time minimum segmentation enables scalable founder reconstruction. Algorithms Mol. Biol. 14 (1) (2019)
Dmitry Kosolobov, Nikita Sivukhin
Compressed Multiple Pattern Matching. CPM (2019)
Daniel Valenzuela, Dmitry Kosolobov, Gonzalo Navarro, Simon J. Puglisi
Lempel-Ziv-like Parsing in Small Space. CoRR (2019)
Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen, Tuukka Norri
Linear Time Maximum Segmentation Problems in Column Stream Model. SPIRE (2019)
Dmitry Kosolobov, Arseny M. Shur
Comparison of LZ77-type parsings. Inf. Process. Lett. 141 (2019)
Dmitry Kosolobov, Nikita Sivukhin
Compressed Multiple Pattern Matching. CoRR (2018)
Dmitry Kosolobov
Relations Between Greedy and Bit-Optimal LZ77 Encodings. STACS (2018)
Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen
Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time. CoRR (2018)
Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen
Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time. WABI (2018)
José Fuentes-Sepúlveda, Juha Kärkkäinen, Dmitry Kosolobov, Simon J. Puglisi
Run Compressed Rank/Select for Large Alphabets. DCC (2018)
José Fuentes-Sepúlveda, Juha Kärkkäinen, Dmitry Kosolobov, Simon J. Puglisi
Run Compressed Rank/Select for Large Alphabets. CoRR (2017)
Dmitry Kosolobov, Florin Manea, Dirk Nowotka
Detecting One-Variable Patterns. SPIRE (2017)
Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Dmitry Kosolobov, Simon J. Puglisi
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. CoRR (2017)
Dominik Kempa, Dmitry Kosolobov
LZ-End Parsing in Compressed Space. DCC (2017)
Dmitry Kosolobov, Arseny M. Shur
Comparison of LZ77-type Parsings. CoRR (2017)
Dominik Kempa, Dmitry Kosolobov
LZ-End Parsing in Linear Time. ESA (2017)
Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. SPIRE (2017)
Dmitry Kosolobov
Tight lower bounds for the longest common extension problem. Inf. Process. Lett. 125 (2017)
Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
Palindromic Length in Linear Time. CPM (2017)
Dmitry Kosolobov
Relations Between Greedy and Bit-Optimal LZ77 Encodings. CoRR (2017)
Dominik Kempa, Dmitry Kosolobov
LZ-End Parsing in Compressed Space. CoRR (2016)
Dmitry Kosolobov
Tight Lower Bounds for the Longest Common Extension Problem. CoRR (2016)
Dmitry Kosolobov, Florin Manea, Dirk Nowotka
Detecting Unary Patterns. CoRR (2016)
Dmitry Kosolobov
Finding the leftmost critical factorization on unordered alphabet. Theor. Comput. Sci. 636 (2016)
Dmitry Kosolobov
Computing runs on a general alphabet. Inf. Process. Lett. 116 (3) (2016)
Dmitry Kosolobov
Faster Lightweight Lempel-Ziv Parsing. CoRR (2015)
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
Pal k is Linear Recognizable Online. SOFSEM (2015)
Dmitry Kosolobov
Computing Runs on a General Alphabet. CoRR (2015)
Dmitry Kosolobov
Faster Lightweight Lempel-Ziv Parsing. MFCS (2) (2015)
Dmitry Kosolobov
Lempel-Ziv Factorization May Be Harder Than Computing All Runs. STACS (2015)
Dmitry Kosolobov
Online Detection of Repetitions with Backtracking. CPM (2015)
Dmitry Kosolobov
Finding the Leftmost Critical Factorization on Unordered Alphabet. CoRR (2015)
Dmitry Kosolobov
Online Repetition Detection With Backtracking. CoRR (2014)
Dmitry Kosolobov
Lempel-Ziv Factorization May Be Harder Than Computing All Runs. CoRR (2014)
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
$\mathrm{Pal}^k$ Is Linear Recognizable Online. CoRR (2014)
Dmitry Kosolobov
Online Square Detection. CoRR (2014)
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
Finding Distinct Subpalindromes Online. Stringology (2013)
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
Finding Distinct Subpalindromes Online CoRR (2013)