"Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm."

Richard Cole (1994)

> Home

Details and statistics

DOI: 10.1137/S0097539791195543

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Cole94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Cole94
Richard Cole:
Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm. SIAM J. Comput. 23(5): 1075-1091 (1994)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.