The strong Byzantine agreement (SBA) problem is defined among n processe...
Consensus enables n processes to agree on a common valid L-bit value, de...
This paper shows how to achieve contention resolution on a shared
commun...
The Byzantine consensus problem involves n processes, out of which t < n...
The Dolev-Reischuk bound says that any deterministic Byzantine consensus...
The best known solutions for k-message broadcast in dynamic networks of
...
Randomized backoff protocols, such as exponential backoff, are a powerfu...
Blockchains use peer-to-peer networks for disseminating information amon...
In the load balancing problem, each node in a network is assigned a load...
In this paper, we consider contention resolution algorithms that are
aug...
Imagine a large graph that is being processed by a cluster of computers,...
In this paper we present two versions of a parallel finger structure FS ...
Bandit-style algorithms have been studied extensively in stochastic and
...
Consider the problem of building a minimum-weight spanning tree for a gi...
In this paper, we explore the benefit of cooperation in adversarial band...
In this paper, we look at the problem of randomized leader election in
s...
Cellular bioelectricity describes the biological phenomenon in which cel...
In this paper we present two versions of a parallel working-set map on p...
In this paper, we study local and global broadcast in the dual graph mod...
The Split Packing algorithm is an offline algorithm that packs a set of
...
In this paper, we explore the use of multi-armed bandit online learning
...