# Shlomit Tassa

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

Learn More

It is known that about 4n 3 comparisons are needed, in the worst case, to nd all the occurrences of the string aba in a text of length n if only pattern{text comparisons are allowed. We show that if text{text comparisons can be used then only about 5n 4 comparisons are required. This gives the rst example in which text{text comparisons provably help.

- ‹
- 1
- ›