We develop deterministic algorithms for the problems of consensus, gossi...
Fault-tolerant consensus is about reaching agreement on some of the inpu...
A number of stations, independently activated over time, is able to
comm...
In a multiple access channel, autonomous stations are able to transmit a...
We study computer systems with transactions executed on a set of shared
...
Suppose we are given integer k ≤ n and n boxes labeled 1,…, n
by an adve...
When facing a very large stream of data, it is often desirable to extrac...
Consensus is one of the most thoroughly studied problems in distributed
...
In this work we address the question of efficiency of distributed comput...
We study broadcasting on multiple-access channels under adversarial pack...
We study the problem of online tree exploration by a deterministic mobil...
In the Group Testing problem, the objective is to learn a subset K of so...
In this work we consider the well-known Secretary Problem – a number n o...
Population protocols model information spreading in networks where pairw...
Counting the number of nodes in Anonymous Dynamic Networks is enticing f...
We consider deterministic distributed algorithms solving Consensus in
sy...
We study the problem of randomized Leader Election in synchronous distri...
In this work, we study the fundamental problem of scheduling communicati...
We study the problem of bi-chromatic coloring of hypergraphs in the LOCA...
The paper studies the problem of reaching agreement in a distributed
mes...
The randomized rumor spreading problem generates a big interest in the a...
We consider the impact of scheduling disciplines on performance of routi...
We investigate routing on multiple access channels when packets are inje...
We examine deterministic broadcasting on multiple-access channels for a
...
We consider dynamic routing in multi-hop wireless networks with adversar...
The problem of finding a spanning forest of a graph in a
distributed-pro...
We consider deterministic distributed broadcasting on multiple access
ch...
We study the problem of scheduling jobs on fault-prone machines communic...