In this work we initiate the study of buy-and-sell prophet inequalities....
We develop deterministic algorithms for the problems of consensus, gossi...
Fault-tolerant consensus is about reaching agreement on some of the inpu...
Suppose we are given integer k ≤ n and n boxes labeled 1,…, n
by an adve...
We study the Weighted Min Cut problem in the Adaptive Massively Parallel...
Consensus is one of the most thoroughly studied problems in distributed
...
In this work we consider the well-known Secretary Problem – a number n o...
We consider deterministic distributed algorithms solving Consensus in
sy...