The following pages link to Gopal Pandurangan (Q477096):
Displaying 14 items.
- Fast distributed PageRank computation (Q477098) (← links)
- Sublinear bounds for randomized leader election (Q477103) (← links)
- Efficient distributed computation of distance sketches in networks (Q748116) (← links)
- A universal online caching algorithm based on pattern matching (Q848635) (← links)
- Improved random graph isomorphism (Q954962) (← links)
- On a simple randomized algorithm for finding a 2-factor in sparse graphs (Q1041775) (← links)
- Information spreading in dynamic networks under oblivious adversaries (Q1660948) (← links)
- Fast Byzantine leader election in dynamic networks (Q1664142) (← links)
- The restriction mapping problem revisited. (Q1872722) (← links)
- A fast distributed approximation algorithm for minimum spanning trees (Q1954259) (← links)
- The complexity of leader election in diameter-two networks (Q1988528) (← links)
- (Q5090924) (← links)
- (Q6083391) (← links)
- Symmetry breaking in the Congest model: time- and message-efficient algorithms for ruling sets (Q6487514) (← links)
