Pages that link to "Item:Q1660920"
From MaRDI portal
The following pages link to Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems (Q1660920):
Displaying 7 items.
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Single-source shortest paths in the CONGEST model with improved bounds (Q2166365) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Sparse matrix multiplication and triangle listing in the congested clique model (Q2290622) (← links)
- On approximating the eigenvalues of stochastic matrices in probabilistic logspace (Q2410679) (← links)
- (Q5091074) (← links)
