Repetitions detection on a linear array with reconfigurable pipelined bus system
From MaRDI portal
Publication:3439858
DOI10.1080/17445760601125434zbMath1115.68162OpenAlexW2001753559MaRDI QIDQ3439858
Publication date: 18 May 2007
Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/17445760601125434
Cites Work
- Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system
- An optimal algorithm for computing the repetitions in a word
- Optimal off-line detection of repetitions in a string
- 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
- Optimally scaling permutation routing on reconfigurable linear arrays with optical buses
This page was built for publication: Repetitions detection on a linear array with reconfigurable pipelined bus system