On the Worst-Case Behavior of String-Searching Algorithms

DOI10.1137/0206048zbMath0366.68032OpenAlexW1971820292MaRDI QIDQ4142690

Ronald L. Rivest

Publication date: 1977

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/762a11b27c5a3dd74cddc626da01d4e2189d6f3c

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items

On Boyer-Moore automata, String overlaps, pattern matching, and nontransitive games, Unnamed Item, An analysis of the Karp-Rabin string matching algorithm, Worst-case behavior of string-searching algorithms, String Matching: Communication, Circuits, and Learning., Average running time of the Boyer-Moore-Horspool algorithm, Tight comparison bounds for the string prefix-matching problem, Optimal partial-match retrieval