Faster Algorithms for String Matching Problems: Matching the Convolution Bound

Piotr Indyk. Faster Algorithms for String Matching Problems: Matching the Convolution Bound. In FOCS. pages 166-173, 1998. [doi]

Authors

Piotr Indyk

This author has not been identified. Look up 'Piotr Indyk' in Google