default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitry Kosolobov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]Dmitry Kosolobov:
Simplified Tight Bounds for Monotone Minimal Perfect Hashing. CPM 2024: 19:1-19:13- [c19]Dmitry Kosolobov, Nikita Sivukhin:
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space. CPM 2024: 20:1-20:18 - [i25]Dmitry Kosolobov:
Simplified Tight Bounds for Monotone Minimal Perfect Hashing. CoRR abs/2403.07760 (2024) - [i24]Dmitry Kosolobov:
Closed Repeats. CoRR abs/2410.00209 (2024) - 2022
- [j8]Golnaz Badkobeh, Panagiotis Charalampopoulos
, Dmitry Kosolobov, Solon P. Pissis:
Internal shortest absent word queries in constant time and linear space. Theor. Comput. Sci. 922: 271-282 (2022) - [i23]Dmitry Kosolobov:
The Efficiency of the ANS Entropy Encoding. CoRR abs/2201.02514 (2022) - 2021
- [j7]Dmitry Kosolobov, Daniel Valenzuela:
Lempel-Ziv Parsing for Sequences of Blocks. Algorithms 14(12): 359 (2021) - [c18]Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman:
Weighted Ancestors in Suffix Trees Revisited. CPM 2021: 8:1-8:15 - [i22]Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman:
Weighted Ancestors in Suffix Trees Revisited. CoRR abs/2103.00462 (2021) - [i21]Dmitry Kosolobov, Nikita Sivukhin:
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space. CoRR abs/2105.03782 (2021) - [i20]Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis:
Internal Shortest Absent Word Queries in Constant Time and Linear Space. CoRR abs/2106.01763 (2021) - 2020
- [j6]Dmitry Kosolobov, Daniel Valenzuela, Gonzalo Navarro, Simon J. Puglisi:
Lempel-Ziv-Like Parsing in Small Space. Algorithmica 82(11): 3195-3215 (2020) - [c17]Dmitry Kosolobov, Oleg Merkurev:
Optimal Skeleton Huffman Trees Revisited. CSR 2020: 276-288 - [c16]Kevin Buchin, Dmitry Kosolobov, Willem Sonke, Bettina Speckmann, Kevin Verbeek:
Ordered Strip Packing. LATIN 2020: 258-270 - [i19]Dmitry Kosolobov, Oleg Merkurev:
Optimal Skeleton Huffman Trees Revisited. CoRR abs/2001.05239 (2020)
2010 – 2019
- 2019
- [j5]Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen:
Linear time minimum segmentation enables scalable founder reconstruction. Algorithms Mol. Biol. 14(1): 12:1-12:15 (2019) - [j4]Dmitry Kosolobov, Arseny M. Shur:
Comparison of LZ77-type parsings. Inf. Process. Lett. 141: 25-29 (2019) - [c15]Dmitry Kosolobov, Nikita Sivukhin:
Compressed Multiple Pattern Matching. CPM 2019: 13:1-13:14 - [c14]Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen, Tuukka Norri:
Linear Time Maximum Segmentation Problems in Column Stream Model. SPIRE 2019: 322-336 - [i18]Daniel Valenzuela, Dmitry Kosolobov, Gonzalo Navarro, Simon J. Puglisi:
Lempel-Ziv-like Parsing in Small Space. CoRR abs/1903.01909 (2019) - 2018
- [c13]José Fuentes-Sepúlveda, Juha Kärkkäinen, Dmitry Kosolobov, Simon J. Puglisi:
Run Compressed Rank/Select for Large Alphabets. DCC 2018: 315-324 - [c12]Dmitry Kosolobov:
Relations Between Greedy and Bit-Optimal LZ77 Encodings. STACS 2018: 46:1-46:14 - [c11]Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen:
Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time. WABI 2018: 15:1-15:15 - [i17]Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen:
Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time. CoRR abs/1805.03574 (2018) - [i16]Dmitry Kosolobov, Nikita Sivukhin:
Compressed Multiple Pattern Matching. CoRR abs/1811.01248 (2018) - 2017
- [j3]Dmitry Kosolobov:
Tight lower bounds for the longest common extension problem. Inf. Process. Lett. 125: 26-29 (2017) - [c10]Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur:
Palindromic Length in Linear Time. CPM 2017: 23:1-23:12 - [c9]Dominik Kempa, Dmitry Kosolobov:
LZ-End Parsing in Compressed Space. DCC 2017: 350-359 - [c8]Dominik Kempa, Dmitry Kosolobov:
LZ-End Parsing in Linear Time. ESA 2017: 53:1-53:14 - [c7]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: 51-67 - [c6]Dmitry Kosolobov, Florin Manea, Dirk Nowotka:
Detecting One-Variable Patterns. SPIRE 2017: 254-270 - [i15]Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Dmitry Kosolobov, Simon J. Puglisi:
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. CoRR abs/1705.09538 (2017) - [i14]Dmitry Kosolobov:
Relations Between Greedy and Bit-Optimal LZ77 Encodings. CoRR abs/1707.09789 (2017) - [i13]Dmitry Kosolobov, Arseny M. Shur:
Comparison of LZ77-type Parsings. CoRR abs/1708.03558 (2017) - [i12]José Fuentes-Sepúlveda, Juha Kärkkäinen, Dmitry Kosolobov, Simon J. Puglisi:
Run Compressed Rank/Select for Large Alphabets. CoRR abs/1711.02910 (2017) - 2016
- [j2]Dmitry Kosolobov:
Computing runs on a general alphabet. Inf. Process. Lett. 116(3): 241-244 (2016) - [j1]Dmitry Kosolobov:
Finding the leftmost critical factorization on unordered alphabet. Theor. Comput. Sci. 636: 56-65 (2016) - [i11]Dmitry Kosolobov, Florin Manea, Dirk Nowotka:
Detecting Unary Patterns. CoRR abs/1604.00054 (2016) - [i10]Dominik Kempa, Dmitry Kosolobov:
LZ-End Parsing in Compressed Space. CoRR abs/1611.01769 (2016) - [i9]Dmitry Kosolobov:
Tight Lower Bounds for the Longest Common Extension Problem. CoRR abs/1611.02891 (2016) - 2015
- [c5]Dmitry Kosolobov:
Online Detection of Repetitions with Backtracking. CPM 2015: 295-306 - [c4]Dmitry Kosolobov:
Faster Lightweight Lempel-Ziv Parsing. MFCS (2) 2015: 432-444 - [c3]Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur:
Pal k is Linear Recognizable Online. SOFSEM 2015: 289-301 - [c2]Dmitry Kosolobov:
Lempel-Ziv Factorization May Be Harder Than Computing All Runs. STACS 2015: 582-593 - [i8]Dmitry Kosolobov:
Faster Lightweight Lempel-Ziv Parsing. CoRR abs/1504.06712 (2015) - [i7]Dmitry Kosolobov:
Computing Runs on a General Alphabet. CoRR abs/1507.01231 (2015) - [i6]Dmitry Kosolobov:
Finding the Leftmost Critical Factorization on Unordered Alphabet. CoRR abs/1509.01018 (2015) - 2014
- [i5]Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur:
$\mathrm{Pal}^k$ Is Linear Recognizable Online. CoRR abs/1404.5244 (2014) - [i4]Dmitry Kosolobov:
Lempel-Ziv Factorization May Be Harder Than Computing All Runs. CoRR abs/1409.5641 (2014) - [i3]Dmitry Kosolobov:
Online Square Detection. CoRR abs/1411.2022 (2014) - [i2]Dmitry Kosolobov:
Online Repetition Detection With Backtracking. CoRR abs/1412.4471 (2014) - 2013
- [c1]Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur:
Finding Distinct Subpalindromes Online. Stringology 2013: 63-69 - [i1]Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur:
Finding Distinct Subpalindromes Online. CoRR abs/1305.2540 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
