We study the computation power of the congested clique, a model of distributed computation
where n players communicate with each other over a complete network in order to compute …

A growing body of work addresses the challenge of processing dynamic graph streams: a
graph is defined by a sequence of edge insertions and deletions and the goal is to construct …

We consider the problem of finding a maximal independent set (MIS) in the shared
blackboard communication model with vertex-partitioned inputs. There are players …

We tackle local distributed testing of graph properties. This framework is well suited to
contexts in which data dispersed among the nodes of a network can be collected by some …

Consider the following distributed graph sketching model: There is a referee and n vertices
in an undirected graph G sharing public randomness. Each vertex v only knows its …

We study the multiparty communication model where players are the nodes of a network and
each of these players knows his/her own identifier together with the identifiers of his/her …

The CONGEST model is a synchronous, message-passing model of distributed computation
in which each node can send (possibly different) messages of O (log n) bits along each of its …

In this paper we study distributed algorithms on massive graphs where links represent a
particular relationship between nodes (for instance, nodes may represent phone numbers …

We study the message size complexity of recognizing, under the broadcast congested clique
model, whether a fixed graph H appears in a given graph G as a minor, as a subgraph or as …

The broadcast congested clique model (BClique) is a message-passing model of distributed
computation where n nodes communicate with each other in synchronous rounds. First, in …