Work

Tight Bounds on the Complexity of the Boyer–Moore String Matching Algorithm

Year: 1994

Type: article

Source: SIAM Journal on Computing

DOI: 10.1137/s0097539791195543

Author: Richard Cole

Language: English

Topic: Algorithms and Data Compression

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2054898096

FWCI: 5.617

Cites: 17

Cited by: 75

Related to: 10