scientific article; zbMATH DE number 7559452
From MaRDI portal
Publication:5089256
DOI10.4230/LIPIcs.MFCS.2020.81MaRDI QIDQ5089256
Mikhail Rubinchik, Arseny M. Shur
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2002.03965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- On palindromic factorization of words
- A subquadratic algorithm for minimum palindromic factorization
- EERTREE: an efficient data structure for processing palindromes in strings
- Palindromic length in free monoids and free groups
- Sturmian numeration systems and decompositions to palindromes
- Diverse Palindromic Factorization Is NP-complete
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- On the Complexity of Finite Sequences
- A Linear-Time On-Line Recognition Algorithm for ``Palstar
- Fast Pattern Matching in Strings
- Palindromic length in linear time
- Computing Palindromic Factorizations and Palindromic Covers On-line
- Pal k is Linear Recognizable Online
- Uniqueness Theorems for Periodic Functions
- Factorizing a String into Squares in Linear Time
- Free differential calculus. IV: The quotient groups of the lower central series
This page was built for publication:
