Connectivity lower bounds in broadcast congested clique
From MaRDI portal
Cites work
- A trade-off between information and communication in broadcast protocols
- Approximation of distances and shortest paths in the broadcast congest clique
- Brief announcement: Deterministic graph connectivity in the broadcast congested clique
- Communication Complexity
- Communication complexity in vertex partition whiteboard model
- Detecting cliques in CONGEST networks
- Distributed Computing: A Locality-Sensitive Approach
- Distributed verification and hardness of distributed approximation
- Elements of Information Theory
- MST in \(O(1)\) rounds of congested clique
- MST in log-star rounds of congested clique
- On the power of the congested clique model
- Optimal lower bounds for distributed and streaming spanning forest computation
- Proof labeling schemes
- Proof-labeling schemes: broadcast, unicast and in between
- Quadratic and near-quadratic lower bounds for the CONGEST model
- Randomized proof-labeling schemes
- The effect of range and bandwidth on the round complexity in the congested clique model
- The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors
- The VLSI Complexity of Selected Graph Problems
- Toward optimal bounds in the congested clique, graph connectivity and MST
- Whitney Number Inequalities for Geometric Lattices
This page was built for publication: Connectivity lower bounds in broadcast congested clique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839872)
