The following pages link to (Q5302080):
Displaying 13 items.
- Spectral sparsification in the semi-streaming setting (Q372976) (← links)
- Cover times, blanket times, and majorizing measures (Q431644) (← links)
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
- Electric routing and concurrent flow cutting (Q553348) (← links)
- The resistance perturbation distance: a metric for the analysis of dynamic networks (Q1693161) (← links)
- Commute times of random walks on trees (Q1949106) (← links)
- On graph parameters guaranteeing fast sandpile diffusion (Q2260617) (← links)
- Toward a spectral theory of cellular sheaves (Q2304007) (← links)
- Sobolev extension by linear operators (Q2862635) (← links)
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1. (Q4603696) (← links)
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness (Q4993271) (← links)
- Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610) (← links)
- Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
