We study two fundamental graph problems, Graph Connectivity (GC) and Minimum
Spanning Tree (MST), in the well-studied Congested Clique model, and present several …

In a multiparty message-passing model of communication, there are k players. Each player
has a private input, and they communicate by sending messages to one another over private …

The main result of this paper is a simulation algorithm which, under quite general
constraints, transforms algorithms running in the Congested Clique model into algorithms …

We initiate a thorough study of distributed property testing—producing algorithms for the
approximation problems of property testing in the CONGEST model. In particular, for the so …

This paper presents constant-time and near-constant-time distributed algorithms for a variety
of problems in the congested clique model. We show how to compute a 3-ruling set in …

We consider the communication cost of computing functions when inputs are distributed
among the vertices of an undirected graph. The communication is assumed to be point-to …

In this paper, we bring the main tools of the Laplacian paradigm to the Broadcast Congested
Clique. We introduce an algorithm to compute spectral sparsifiers in a polylogarithmic …

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 …

This paper presents fast, distributed, $ O (1) $-approximation algorithms for metric facility
location problems with outliers in the Congested Clique model, Massively Parallel …

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 …