24 citations · 145 across the 45 of their papers we have counts for
4 papers · 1 filter
An Parallel Time Population Protocol for Majority with States
Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus +1
In population protocols, the underlying distributed network consists of nodes (or agents), denoted by , and a scheduler that continuously selects uniformly random pairs of n…
Improved Circular -Mismatch Sketches
Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz +2
The shift distance between two strings and of the same length is defined as the minimum Hamming distance between and any rotation (cyclic s…
The Streaming k-Mismatch Problem: Tradeoffs between Space and Total Time
Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz +1
We revisit the -mismatch problem in the streaming model on a pattern of length and a streaming text of length , both over a size- alphabet. The current state-of-the-ar…
Approximating Text-to-Pattern Hamming Distances
Timothy M. Chan, Shay Golan, Tomasz Kociumaka +2
We revisit a fundamental problem in string matching: given a pattern of length m and a text of length n, both over an alphabet of size , compute the Hamming distance between the…