Online algorithms on antipowers and antiperiods
From MaRDI portal
Publication:6536254
Recommendations
Cites work
- \((k,\lambda)\)-anti-powers and other patterns in words
- A hardness result and new algorithm for the longest common palindromic subsequence problem
- A Rigorous Time Bound for Factoring Integers
- Algorithms for anti-powers in strings
- Anti-power prefixes of the Thue-Morse word
- Anti-powers in infinite words
- Anti-powers in infinite words
- Computing a longest common palindromic subsequence
- Computing longest common square subsequences
- Computing the Antiperiod(s) of a String
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Efficient randomized pattern-matching algorithms
- scientific article; zbMATH DE number 177800 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 6850408 (Why is no real title available?)
- Longest common extensions in sublinear space
- Longest property-preserved common factor
- On finding a longest common palindromic subsequence
- Repetitions in strings: algorithms and combinatorics
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Über unendliche Zeichenreihen.
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)