Pages that link to "Item:Q2010605"

The following pages link to Algebraic methods in the congested clique (Q2010605):

Displaying 34 items.

• 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)
• Fast approximate shortest paths in the congested clique (Q2064057) (← links)
• Near-optimal scheduling in the congested clique (Q2117708) (← links)
• Approximate minimum directed spanning trees under congestion (Q2117742) (← 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)
• 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)
• A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
• (Q2796251) (redirect page) (← links)
• The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model (Q2817860) (← 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)
• Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
• A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
• (Q5002843) (← links)
• Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
• Detecting cliques in CONGEST networks (Q5090906) (← links)
• (Q5091074) (← links)
• (Q5091075) (← links)
• The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
• Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths (Q5233107) (← links)
• Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
• Fast distributed algorithms for testing graph properties (Q5915702) (← links)
• On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model (Q6131191) (← links)
• Improved hardness of approximation of diameter in the CONGEST model (Q6535016) (← links)
• Fast distributed algorithms for girth, cycles and small subgraphs (Q6535032) (← links)
• Deterministic near-optimal distributed listing of cliques (Q6658820) (← links)