Pages that link to "Item:Q2010605"
From MaRDI portal
The following pages link to Algebraic methods in the congested clique (Q2010605):
Displaying 13 items.
- Lessons from the congested clique applied to MapReduce (Q896148) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Single-source shortest paths in the CONGEST model with improved bounds (Q2166365) (← links)
- Detecting cliques in CONGEST networks (Q2220401) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
- Deterministic Subgraph Detection in Broadcast CONGEST. (Q3300802) (← links)
- Lower Bounds for Subgraph Detection in the CONGEST Model (Q3300805) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- (Q5090906) (← links)
- (Q5091075) (← links)
- On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model (Q6131191) (← links)
- On the power of threshold-based algorithms for detecting cycles in the CONGEST model (Q6148078) (← links)
