Combinatorics of palindromes

DOI10.1007/978-3-032-04700-7_19MaRDI QIDQ6852217zbMATH OpenFDO

Authors Michael Itzhaki

Publication date 26 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-04700-7_19

zbMATH Keywords

combinatoricsManacher arraypalindrome

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• Computing palindromic factorizations and palindromic covers on-line
• Duplication-correcting codes
• EERTREE: an efficient data structure for processing palindromes in strings
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• Longest palindromic substring in sublinear time
• Mathematical Foundations of Computer Science 2003
• PalFM-index: FM-index for palindrome pattern matching
• Palindromic length in linear time
• The derivation of on-line algorithms, with an application to finding palindromes
• Uniqueness Theorems for Periodic Functions
• Universal reconstruction of a string

This page was built for publication: Combinatorics of palindromes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852217)