Optimal Parallel Searching an Array for Certain Repetitions

DOI10.1016/S1571-0653(04)00476-7zbMath1138.68662MaRDI QIDQ3438903

Valentin E. Brimkov

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

tandemrepetitionoptimal parallel algorithm2D array

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Parallel algorithms in computer science (68W10)

Related Items (1)

Optimal discovery of repetitions in 2D

Cites Work

• Unnamed Item
• Unnamed Item
• Structural properties of the string statistics problem
• An optimal algorithm for computing the repetitions in a word
• Optimal off-line detection of repetitions in a string
• Fibonacci arrays and their two-dimensional repetitions
• An O(n log n) algorithm for finding all repetitions in a string
• Optimal parallel pattern matching in strings
• Relations between Concurrent-Write Models of Parallel Computation
• The Parallel Evaluation of General Arithmetic Expressions
• An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String

This page was built for publication: Optimal Parallel Searching an Array for Certain Repetitions