An analysis of the Karp-Rabin string matching algorithm

DOI10.1016/0020-0190(90)90135-KzbMath0696.68057OpenAlexW1971581375MaRDI QIDQ911281

Gaston H. Gonnet, Ricardo A. Baeza-Yates

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90135-k

zbMATH Keywords

probabilistic algorithmsignaturesaverage case analysisstring searching

Mathematics Subject Classification ID

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

Related Items (2)

Engineering Practical Lempel-Ziv Tries ⋮ Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries

Cites Work

• Unnamed Item
• A fast string searching algorithm
• Efficient randomized pattern-matching algorithms
• On the Worst-Case Behavior of String-Searching Algorithms
• Fast Pattern Matching in Strings

This page was built for publication: An analysis of the Karp-Rabin string matching algorithm