5 citations · 15 across the 23 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DC2017★ 5 cited
Distributed Subgraph Detection
Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti +2
In the standard CONGEST model for distributed network computing, it is known that "global" tasks such as minimum spanning tree, diameter, and all-pairs shortest paths, consume larg…
cs.DC2017
Graph Reconstruction in the Congested Clique
Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport +1
The congested clique model is a message-passing model of distributed computation where the underlying communication network is the complete graph of nodes. In this paper we con…