Space-time trade-offs for finding shortest unique substrings and maximal unique matches

By choosing τ=ω(1), our results imply the first sub-linear space (in addition to the input string) solution to these problems. We also present the following two results.