Dmitry Kosolobov

Citeret af

	Alle	Siden 2020
Henvisninger	374	250
h-index	12	9
i10-indeks	13	9

20122013201420152016201720182019202020212022202320244 3 8 25 24 24 33 45 38 39 52 76

Offentlig adgang

Se alle

8 artikler

0 artikler

tilgængelige

ikke tilgængelige

Baseret på krav i forbindelse med finansiering

Medforfattere

Arseny ShurSenior Researcher in Computer Science, Bar Ilan UniversityVerificeret mail på datalab.cs.biu.ac.il
Simon J. PuglisiProfessor, Department of Computer Science, University of HelsinkiVerificeret mail på cs.helsinki.fi
Veli MäkinenProfessor of Computer Science, University of HelsinkiVerificeret mail på helsinki.fi
Tuukka NorriVerificeret mail på helsinki.fi
Dominik KempaAssistant Professor, Stony Brook UniversityVerificeret mail på cs.stonybrook.edu
Daniel ValenzuelaResearch Scientist, Varian Medical SystemsVerificeret mail på varian.com
Gonzalo NavarroUniversity of ChileVerificeret mail på dcc.uchile.cl
Golnaz BadkobehCity, University of LondonVerificeret mail på city.ac.uk
djamal belazzouguiCERISTVerificeret mail på cerist.dz
Rajeev RamanProfessor, Department of Computing and Mathematical Sciences, University of LeicesterVerificeret mail på leicester.ac.uk
Florin ManeaUniversity of GöttingenVerificeret mail på informatik.uni-goettingen.de
Dirk NowotkaProfessor für Informatik, Christian-Albrechts-Universität zu KielVerificeret mail på zs.uni-kiel.de
Shunsuke InenagaProfessor, Department of Informatics, Kyushu UniversityVerificeret mail på inf.kyushu-u.ac.jp
Tomasz KociumakaINSAITVerificeret mail på insait.ai
Travis GagieAssociate Professor at Dalhousie UniversityVerificeret mail på dal.ca
Juha KärkkäinenDepartment of Computer scienceVerificeret mail på cs.helsinki.fi
Jose Fuentes SepúlvedaUniversity of ConcepciónVerificeret mail på udec.cl
Oleg MerkurevUral Federal University, department of algebra and fundamental informaticsVerificeret mail på urfu.ru
Kevin VerbeekAssociate Professor, Mathematics and Computer Science, TU EindhovenVerificeret mail på tue.nl
Kevin BuchinProfessor of Computer Science, Technical University DortmundVerificeret mail på tu-dortmund.de

Følg

Dmitry Kosolobov

Ural Federal University, Ekaterinburg, Russia

Verificeret mail på urfu.ru

алгоритмы и структуры данных алгоритмы на строках


Titel Sortér efter henvisninger Sortér efter årstal Sortér efter titel	Citeret af Citeret af	År
LZ-End parsing in compressed space D Kempa, D Kosolobov 2017 Data Compression Conference (DCC), 350-359, 2017	34	2017
Palindromic length in linear time K Borozdin, D Kosolobov, M Rubinchik, AM Shur 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017	34	2017
Computing runs on a general alphabet D Kosolobov Information Processing Letters 116 (3), 241-244, 2016	33	2016
Weighted ancestors in suffix trees revisited D Belazzougui, D Kosolobov, SJ Puglisi, R Raman arXiv preprint arXiv:2103.00462, 2021	26	2021
Pal^k is Linear Recognizable Online D Kosolobov, M Rubinchik, AM Shur SOFSEM 2015: Theory and Practice of Computer Science: 41st International …, 2015	25	2015
Lempel-Ziv factorization may be harder than computing all runs D Kosolobov arXiv preprint arXiv:1409.5641, 2014	22	2014
Finding distinct subpalindromes online D Kosolobov, M Rubinchik, AM Shur Proceedings of the Prague Stringology Conference 2013, 63-69, 2013	21	2013
Faster lightweight lempel-ziv parsing D Kosolobov International Symposium on Mathematical Foundations of Computer Science, 432-444, 2015	19	2015
Linear time minimum segmentation enables scalable founder reconstruction T Norri, B Cazaux, D Kosolobov, V Mäkinen Algorithms for Molecular Biology 14, 1-15, 2019	17	2019
LZ-End parsing in linear time D Kempa, D Kosolobov 25th Annual European Symposium on Algorithms (ESA 2017), 2017	17	2017
Lempel–Ziv-like parsing in small space D Kosolobov, D Valenzuela, G Navarro, SJ Puglisi Algorithmica 82 (11), 3195-3215, 2020	16	2020
Tight lower bounds for the longest common extension problem D Kosolobov Information Processing Letters 125, 26-29, 2017	12	2017
Online detection of repetitions with backtracking D Kosolobov Annual Symposium on Combinatorial Pattern Matching, 295-306, 2015	12	2015
Internal shortest absent word queries in constant time and linear space G Badkobeh, P Charalampopoulos, D Kosolobov, SP Pissis Theoretical Computer Science 922, 271-282, 2022	9	2022
Linear time maximum segmentation problems in column stream model B Cazaux, D Kosolobov, V Mäkinen, T Norri International Symposium on String Processing and Information Retrieval, 322-336, 2019	8	2019
Detecting one-variable patterns D Kosolobov, F Manea, D Nowotka International Symposium on String Processing and Information Retrieval, 254-270, 2017	8	2017
On two LZ78-style grammars: Compression bounds and compressed-space computation G Badkobeh, T Gagie, S Inenaga, T Kociumaka, D Kosolobov, SJ Puglisi International Symposium on String Processing and Information Retrieval, 51-67, 2017	8	2017
Finding the leftmost critical factorization on unordered alphabet D Kosolobov Theoretical Computer Science 636, 56-65, 2016	8	2016
Construction of sparse suffix trees and LCE indexes in optimal time and space D Kosolobov, N Sivukhin arXiv preprint arXiv:2105.03782, 2021	6	2021
Minimum segmentation for pan-genomic founder reconstruction in linear time T Norri, B Cazaux, D Kosolobov, V Mäkinen arXiv preprint arXiv:1805.03574, 2018	6	2018

Systemet kan ikke foretage handlingen nu. Prøv igen senere.

Artikler 1–20

Henvisninger pr. år

Dublerede henvisninger

Flettede henvisninger

Tilføj medforfattereMedforfattere

Følg

Citeret af

Medforfattere