Online algorithms on antipowers and antiperiods
From MaRDI portal
Publication:6536254
DOI10.1007/978-3-030-32686-9_13zbMATH Open1539.68375MaRDI QIDQ6536254
Costas S. Iliopoulos, Daniele Greco, Nicola Prezza, Alessio Conte, Nadia Pisanti, Giulia Punzi, Mai Alzamel, Veronica Guerrini, Giovanna Rosone
Publication date: 19 April 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Anti-power prefixes of the Thue-Morse word
- Repetitions in strings: algorithms and combinatorics
- \((k,\lambda)\)-anti-powers and other patterns in words
- Algorithms for anti-powers in strings
- On finding a longest common palindromic subsequence
- Anti-powers in infinite words
- A hardness result and new algorithm for the longest common palindromic subsequence problem
- Longest Common Extensions in Sublinear Space
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Efficient randomized pattern-matching algorithms
- A Rigorous Time Bound for Factoring Integers
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Computing the Antiperiod(s) of a String
- Computing a Longest Common Palindromic Subsequence
- Über unendliche Zeichenreihen.
- Efficient representation and counting of antipower factors in words
- Longest property-preserved common factor
This page was built for publication: Online algorithms on antipowers and antiperiods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536254)
