5 citations · 7 across the 3 of their papers we have counts for
1 paper · 1 filter
Philipp Schepper
The currently fastest algorithm for regular expression pattern matching and membership improves the classical O(nm) time algorithm by a factor of about log^{3/2}n. Instead of focus…