We reduce the cost of communication and synchronization in graph processing by analyzing
the fastest way to process graphs: pushing the updates to a shared state or pulling the …

With random network coding, network nodes between the source and receivers are able to
not only relay and replicate data packets, but also code them using randomly generated …

Reliable local information dissemination is the primary concern for periodic safety
broadcasting in VANETs. We propose a sublayer in the application layer of the WAVE stack …

We study how to spread k tokens of information to every node on an n-node dynamic
network, the edges of which are changing at each round. This basic gossip problem can be …

We introduce projection analysis-a new technique to analyze the stop** time of gossip
protocols that are based on random linear network coding (RLNC). Projection analysis …

We use network coding to improve the speed of distributed computation in the dynamic
network model of Kuhn, Lynch and Oshman [STOC'10]. In this model an adversary …

This paper addresses partial information spreading among n nodes of a network. As
opposed to traditional information spreading, where each node has a message that must be …

The paper investigates efficient distributed computation in dynamic networks in which the
network topology changes (arbitrarily) from round to round. Random walks are a …

In this paper, we investigate the benefits of applying a form of network coding known as
random linear coding (RLC) to unicast applications in disruption-tolerant networks (DTNs) …

Gathering data from nodes in a network is at the heart of many distributed applications, most
notably while performing a global task. We consider information spreading among n nodes …