Mose Mizrahi

collaborators

3 papers

cs.DC2026

Multivalued Consensus: General Adversaries Require More Communication

Mose Mizrahi, Roger Wattenhofer

We study $n$ -party fault-tolerant consensus against general (non-threshold) adversaries. We describe an infinite family $Z_{proj}^{n, d}$ of $Q^{d}$ -satisfying $n$ -party advers…

cs.DC2026

Subcubic Coin Tossing in Asynchrony without PKI

Mose Mizrahi, Roger Wattenhofer

We consider an asynchronous network of $n$ parties connected to each other via secure channels, up to $t$ of which are byzantine. We study common coin tossing, a task where the par…

math.CO2020

Firefighting on the Hexagonal Grid and on Infinite Trees

Alexander Dean, Sean English, Tongyun Huang +4

The firefighter problem with $k$ firefighters on an infinite graph $G$ is an iterative graph process, defined as follows: Suppose a fire breaks out at a given vertex $v \in V (G)$ on…