A coarse-grained multicomputer algorithm for the detection of repetitions

DOI10.1016/J.IPL.2004.12.004zbMath1173.68819OpenAlexW2047768311MaRDI QIDQ835058

David Semé, Thierry Garcia

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.12.004

zbMATH Keywords

dynamic programmingparallel algorithmsstring matchingcoarse-grained multicomputers

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Related Items (1)

A fast algorithm for finding the positions of all squares in a run-length encoded string

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved linear systolic algorithms for substring statistics
• An optimal algorithm for computing the repetitions in a word
• A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers
• On the computational power of pushdown automata
• Fast Pattern Matching in Strings
• Uniqueness Theorems for Periodic Functions
• SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS

This page was built for publication: A coarse-grained multicomputer algorithm for the detection of repetitions