Palindromic length in linear time

Show simple item record

dc.contributor University of Helsinki, Department of Computer Science en
dc.contributor.author Kosolobov, Dmitry
dc.contributor.author Shur, Arseny M.
dc.contributor.author Rubinchik, Mikhail
dc.contributor.author Borozdin, Kirill
dc.contributor.editor Kärkkäinen, Juha
dc.contributor.editor Radoszewski, Jakub
dc.contributor.editor Rytter, Wojciech
dc.date.accessioned 2018-05-22T10:57:01Z
dc.date.available 2018-05-22T10:57:01Z
dc.date.issued 2017
dc.identifier.citation Kosolobov , D , Shur , A M , Rubinchik , M & Borozdin , K 2017 , Palindromic length in linear time . in J Kärkkäinen , J Radoszewski & W Rytter (eds) , Palindromic length in linear time . , 23 , Leibniz International Proceedings in Informatics (LIPIcs) , no. 78 , Leibniz-Zentrum für Informatik , Wadern , pp. 23:1-23:12 , Annual Symposium on Combinatorial Pattern Matching , Warsaw , Poland , 04/07/2017 . https://doi.org/10.4230/LIPIcs.CPM.2017.23 en
dc.identifier.citation conference en
dc.identifier.isbn 978-3-95977-039-2
dc.identifier.other PURE: 100337529
dc.identifier.other PURE UUID: 96d0b90f-3611-414a-b74d-1c4a525368d9
dc.identifier.other Scopus: 85027252807
dc.identifier.other ORCID: /0000-0002-2909-2952/work/45000185
dc.identifier.uri http://hdl.handle.net/10138/235301
dc.description.abstract Palindromic length of a string is the minimum number of palindromes whose concatenation is equal to this string. The problem of finding the palindromic length drew some attention, and a few $O(n\log n)$ time online algorithms were recently designed for it. In this paper we present the first linear time online algorithm for this problem. en
dc.format.extent 12
dc.language.iso eng
dc.publisher Leibniz-Zentrum für Informatik
dc.relation.ispartof Palindromic length in linear time
dc.relation.ispartofseries Leibniz International Proceedings in Informatics (LIPIcs)
dc.rights en
dc.subject 113 Computer and information sciences en
dc.title Palindromic length in linear time en
dc.type Conference contribution
dc.identifier.doi https://doi.org/10.4230/LIPIcs.CPM.2017.23
dc.type.uri info:eu-repo/semantics/other
dc.contributor.pbl
dc.contributor.pbl

Files in this item

Total number of downloads: Loading...

Files Size Format View
LIPIcs_CPM_2017_23.pdf 561.1Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record