Pages that link to "Item:Q2943637"
From MaRDI portal
The following pages link to On the power of the congested clique model (Q2943637):
Displayed 37 items.
- Sub-logarithmic distributed algorithms for metric facility location (Q748120) (← links)
- Lessons from the congested clique applied to MapReduce (Q896148) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- The role of randomness in the broadcast congested clique model (Q2051760) (← links)
- Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Approximate minimum directed spanning trees under congestion (Q2117742) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Graph reconstruction in the congested clique (Q2186818) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Detecting cliques in CONGEST networks (Q2220401) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Sparse matrix multiplication and triangle listing in the congested clique model (Q2290622) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Proof-labeling schemes: broadcast, unicast and in between (Q2672621) (← links)
- A note on improved results for one round distributed clique listing (Q2681399) (← links)
- The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model (Q2817860) (← links)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- Sparsifying Congested Cliques and Core-Periphery Networks (Q2835033) (← links)
- Deterministic Subgraph Detection in Broadcast CONGEST. (Q3300802) (← links)
- Lower Bounds for Subgraph Detection in the CONGEST Model (Q3300805) (← links)
- The Range of Topological Effects on Communication (Q3449503) (← links)
- Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model (Q3460729) (← links)
- (Q4612486) (← links)
- (Q4993305) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- (Q5002843) (← links)
- (Q5090906) (← links)
- (Q5091074) (← links)
- (Q5092335) (← links)
- Distributed Testing of Distance-k Colorings (Q5100965) (← links)
- The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)