| Original language | English (US) |
|---|---|
| Title of host publication | Second Annual ACM Symposium on Discrete Algorithms |
| Pages | 224-233 |
| State | Published - 1991 |
Tight bounds on the complexity of the Boyer-Moore string matching algorithm
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution