The following pages link to Atish Das Sarma (Q477094):
Displaying 20 items.
- Fast distributed PageRank computation (Q477098) (← links)
- Best-order streaming model (Q534570) (← links)
- Efficient distributed computation of distance sketches in networks (Q748116) (← links)
- Distributed computation in dynamic networks via random walks (Q2345448) (← links)
- An Approximate Restatement of the Four-Color Theorem (Q2856478) (← links)
- Algorithms for Message Ferrying on Mobile ad hoc Networks (Q2920109) (← links)
- A tight unconditional lower bound on distributed randomwalk computation (Q2943404) (← links)
- Estimating PageRank on graph streams (Q3016259) (← links)
- Finding Dense Subgraphs in G(n,1/2) (Q3558917) (← links)
- Best-Order Streaming Model (Q3630203) (← links)
- Sparse Cut Projections in Graph Streams (Q3639268) (← links)
- Distributed Verification and Hardness of Distributed Approximation (Q4907581) (← links)
- Fast Distributed Computation in Dynamic Networks via Random Walks (Q4909407) (← links)
- Dense Subgraphs on Dynamic Networks (Q4909408) (← links)
- Fast distributed random walks (Q5170313) (← links)
- Efficient distributed random walks with applications (Q5176199) (← links)
- Distributed Random Walks (Q5395702) (← links)
- Distributed verification and hardness of distributed approximation (Q5419106) (← links)
- Computing and Combinatorics (Q5716981) (← links)
- Brief announcement (Q5891981) (← links)
