A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We revisit the complexity of online computation in the cell probe model. We consider a class of problems where we are first given a fixed pattern or vector F of n symbols and then one symbol arrives at a time in a stream. After each symbol has arrived we must output some function of F and the n-length suffix of the arriving stream. Cell probe bounds of Ω(δn/w) have previously been shown for both convolution and Hamming distance in this setting, where δ is the size of a symbol in bits and w∈Ω(n)arXiv:1504.00834v1 fatcat:hdw2okkdjremflekbl6b4uanhi