Dmitry Kosolobov

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