This work revisits the multiplicative weights update technique (MWU) whi...
We study population protocols, a model of distributed computing appropri...
The text-to-pattern Hamming distances problem asks to compute the Hammin...
In this paper we study population protocols governed by the random
sched...
Cardinality estimation is the task of approximating the number of distin...
Let G=(V,E) be an n-vertex directed acyclic graph (DAG). A lowest common...
The shift distance 𝗌𝗁(S_1,S_2) between two strings S_1 and S_2
of the sa...
Consider a generalization of the classical binary search problem in line...
There has recently been a surge of interest in the computational and
com...
Text-to-pattern distance is a fundamental problem in string matching, wh...
We consider the problem of computing distance between a pattern of lengt...
We show that the edit distance between two run-length encoded strings of...
A distance labeling scheme is an assignment of bit-labels to the vertice...
Given a text T of length n and a pattern P of length m, the
approximate ...
Given a directed graph, the vertex connectivity from u to v is the
maxim...
We consider two types of searching models, where the goal is to design a...
A population protocol describes a set of state change rules for a popula...
We put forward a simple high-level framework for describing a population...
The model of population protocols refers to a large collection of simple...
The problem of finding distance between pattern of length m
and text of ...
We investigate relations between (+,) vector products for binary
integer...
Depth first search is a natural algorithmic technique for constructing a...