The following pages link to Dean Leitersdorf (Q2064056):
Displaying 7 items.
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Sparse matrix multiplication and triangle listing in the congested clique model (Q2290622) (← links)
- (Q5091074) (← links)
- Fast Approximate Shortest Paths in the Congested Clique (Q5145183) (← links)
- Hardness of Distributed Optimization (Q5145214) (← links)
- On Distributed Listing of Cliques (Q5854055) (← links)
- (Q6126262) (← links)
