Fibonacci arrays and their two-dimensional repetitions
From MaRDI portal
Publication:1566729
DOI10.1016/S0304-3975(98)00182-0zbMath0939.68162MaRDI QIDQ1566729
Valentin E. Brimkov, Alberto Apostolico
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (10)
Combinatorial properties of Fibonacci partial words and arrays ⋮ Multidimensional period recovery ⋮ Lower bounds for the number of repetitions in 2D strings ⋮ Two-dimensional Fibonacci words: tandem repeats and factor complexity ⋮ Algebraic properties of Parikh matrices of binary picture arrays ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two-dimensional maximal repetitions ⋮ Optimal discovery of repetitions in 2D ⋮ Optimal Parallel Searching an Array for Certain Repetitions
Cites Work
- An optimal algorithm for computing the repetitions in a word
- Optimal off-line detection of repetitions in a string
- Transducers and repetitions
- An O(n log n) algorithm for finding all repetitions in a string
- An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fibonacci arrays and their two-dimensional repetitions
