Tight cell-probe bounds for online hamming distance computation

Raphael Clifford, Markus T Jalsenius, Benjamin G Sach

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

6 Citations (Scopus)
52 Downloads (Pure)

Abstract

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 Omege(delta/w log n) time on average per output, where delta 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.
Original languageEnglish
Title of host publicationProceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, USA, January 6-8, 2013.
Place of PublicationNew Orleans
PublisherSociety for Industrial and Applied Mathematics
Pages664-674
ISBN (Electronic)978-1-611972-52-8
Publication statusPublished - Jan 2013

Keywords

  • algorithms
  • lower bounds
  • pattern matching
  • streaming

Fingerprint Dive into the research topics of 'Tight cell-probe bounds for online hamming distance computation'. Together they form a unique fingerprint.

Cite this