scientific article; zbMATH DE number 3976360

MaRDI QIDQ3741075zbMATH OpenFDO

Authors Michael O. Rabin

Publication date 1985

zbMATH Keywords

algorithmfingerprintsparallelizabilitystring matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99)

Recommendations

• An O(n log n) algorithm for finding all repetitions in a string
• Efficient randomized pattern-matching algorithms
• On the complexity of computing the order of repetition of a string
• Large-scale detection of repetitions
• Fast and Practical Algorithms for Computing All the Runs in a String

Cited in

(16)

• Optimal parallel detection of squares in strings
• Counting distinct strings
• \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity
• On the complexity of computing the order of repetition of a string
• Online detection of repetitions with backtracking
• An O(n log n) algorithm for finding all repetitions in a string
• Efficient string matching on packed texts
• Detecting the morphic images of a word : improving the general algorithm
• scientific article; zbMATH DE number 1052825 (Why is no real title available?)
• New simple efficient algorithms computing powers and runs in strings
• Repetition Detection in a Dynamic String
• Searching of Gapped Repeats and Subrepetitions in a Word
• Efficient detection of quasiperiodicities in strings
• A coarse-grained multicomputer algorithm for the detection of repetitions
• An efficient algorithm for online square detection
• Efficient on-line repetition detection

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3741075)