Tight Cell-Probe Bounds for Online Hamming Distance Computation [chapter]

Raphaël Clifford, Markus Jalsenius, Benjamin Sach
2013 Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms  
We show tight bounds for online Hamming distance computation in the cell-probe model with word size w. The task is to output the Hamming distance between a fixed string of length n and the last n symbols of a stream. We give a lower bound of Ω δ w log n time on average per output, where δ is the number of bits needed to represent an input symbol. We argue that this bound is tight within the model. The lower bound holds under randomisation and amortisation. * Supported by EPSRC.
doi:10.1137/1.9781611973105.48 dblp:conf/soda/CliffordJS13 fatcat:bk7iqzfwlzhp5i5sny37q24sg4