Pages that link to "Item:Q4909412"

The following pages link to “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting (Q4909412):

Displaying 21 items.

• Lessons from the congested clique applied to MapReduce (Q896148) (← links)
• Algebraic methods in the congested clique (Q2010605) (← links)
• Reliable communication over highly connected noisy networks (Q2010609) (← links)
• Fast approximate shortest paths in the congested clique (Q2064057) (← links)
• Near-optimal scheduling in the congested clique (Q2117708) (← links)
• Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← 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)
• The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model (Q2817860) (← links)
• Deterministic Subgraph Detection in Broadcast CONGEST. (Q3300802) (← links)
• Lower Bounds for Subgraph Detection in the CONGEST Model (Q3300805) (← links)
• A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
• (Q5090906) (← links)
• (Q5091074) (← links)
• (Q5091075) (← links)
• Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
• Fast distributed algorithms for testing graph properties (Q5915702) (← links)
• Fast distributed algorithms for girth, cycles and small subgraphs (Q6535032) (← links)
• Deterministic near-optimal distributed listing of cliques (Q6658820) (← links)