In recent years the Cache-Oblivious model of external memory computation has provided an attractive theoretical basis for the analysis of algorithms on massive datasets. Much progress has been madeâ€¦ (More)

We revisit the complexity of one of the most basic problems in pattern matching. In the k-mismatch problem we must compute the Hamming distance between a pattern of length m and every m-lengthâ€¦ (More)

We show tight bounds for online Hamming distance computation in the cellprobe model with word size w. The task is to output the Hamming distance between a fixed string of length n and the last nâ€¦ (More)

We give cell-probe bounds for the computation of edit distance, Hamming distance, convolution and longest common subsequence in a stream. In this model, a fixed string of n symbols is given and oneâ€¦ (More)

We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an nÃ—n board of tiles where each tile is allocated one of c colours. The goalâ€¦ (More)

A substring of a string is unbordered if its only border is the empty string. The study of unbordered substrings goes back to the paper of Ehrenfeucht and Silberger [Discr. Math 26 (1979)]. The mainâ€¦ (More)

Side-channel analysis techniques can be used to construct key recovery attacks by observing a side-channel medium such as the power consumption or electromagnetic radiation of a device while is itâ€¦ (More)

We investigate the problem of deterministic pattern matching in multiple streams. In this model, one symbol arrives at a time and is associated with one of s streaming texts. The task at each timeâ€¦ (More)