Real-Time Streaming String-Matching

This paper presents a real-time randomized streaming string matching algorithm that uses O(logm) space. The algorithm only makes one-sided small probability false-positive errors, possibly reporting phantom occurrences of the pattern, but never misses an actual occurrence.