Average running time of the Boyer-Moore-Horspool algorithm
type: Item
instance of: scholarly article
title: Average running time of the Boyer-Moore-Horspool algorithm
zbMATH Open document ID: 0747.68020
DOI: 10.1016/0304-3975(92)90133-Z
author: Ricardo Baeza-Yates
author: Mireille Régnier
published in: Theoretical Computer Science
publication date: 1992-09-26T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 55516
zbMATH Keywords: linear time algorithm
zbMATH Keywords: string matching
MaRDI profile type: Publication
cites work: Q4028869
cites work: Q4028877
cites work: Q3138910
cites work: Fast algorithms for two dimensional and multiple pattern matching
cites work: An analytical comparison of two string searching algorithms
cites work: Fast Pattern Matching in Strings
cites work: Q3975165
cites work: On the Worst-Case Behavior of String-Searching Algorithms
cites work: On the Expected Sublinearity of the Boyer–Moore Algorithm
cites work: The Complexity of Pattern Matching for a Random String
cites work: Q5538132
full work available at URL: 0304-3975(92)90133-z
OpenAlex ID: W2009334077
Wikidata QID: Q127740123
description: scientific article; zbMATH DE number 55516