Matan Kraus

most citedAn

O (lo g^{3/2} n)

Parallel Time Population Protocol for Majority with

O (lo g n)

States

3 citations · 3 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DC2020★ 3 cited

An $O (lo g^{3/2} n)$ Parallel Time Population Protocol for Majority with $O (lo g n)$ States

Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus +1

In population protocols, the underlying distributed network consists of $n$ nodes (or agents), denoted by $V$ , and a scheduler that continuously selects uniformly random pairs of n…

cs.DS2020

Time-Space Tradeoffs for Finding a Long Common Substring

Stav Ben-Nun, Shay Golan, Tomasz Kociumaka +1

We consider the problem of finding, given two documents of total length $n$ , a longest string occurring as a substring of both documents. This problem, known as the Longest Common…

An O(log3/2n) Parallel Time Population Protocol for Majority with O(logn) States

Time-Space Tradeoffs for Finding a Long Common Substring

An $O (lo g^{3/2} n)$ Parallel Time Population Protocol for Majority with $O (lo g n)$ States