The following pages link to Gopal Pandurangan (Q477096):
Displaying 50 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)
- Xheal: a localized self-healing algorithm using expanders (Q2251148) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Distributed computation in dynamic networks via random walks (Q2345448) (← links)
- Distributed agreement in dynamic peer-to-peer networks (Q2353391) (← links)
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms (Q2456363) (← links)
- Analysis of randomized protocols for conflict-free distributed access (Q2461541) (← links)
- On the hardness of optimization in power-law graphs (Q2481967) (← links)
- DEX: self-healing expanders (Q2629213) (← links)
- (Q2768373) (← links)
- Toward Optimal Bounds in the Congested Clique (Q2796246) (← links)
- Discovery Through Gossip (Q2811164) (← links)
- Static and dynamic evaluation of QoS properties (Q2819588) (← links)
- Efficient computation of sparse structures (Q2820273) (← links)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- Almost-Optimal Gossip-Based Aggregate Computation (Q2910849) (← links)
- A tight unconditional lower bound on distributed randomwalk computation (Q2943404) (← links)
- Xheal (Q2943407) (← links)
- Can quantum communication speed up distributed computation? (Q2943619) (← links)
- Entropy-based bounds for online algorithms (Q2944543) (← links)
- Using PageRank to Characterize Web Structure (Q3431003) (← links)
- A Fast Distributed Approximation Algorithm for Minimum Spanning Trees (Q3524318) (← links)
- On the Hardness of Optimization in Power Law Graphs (Q3608866) (← links)
- (Q4808653) (← links)
- Distributed Verification and Hardness of Distributed Approximation (Q4907581) (← links)
- Fast Distributed Computation in Dynamic Networks via Random Walks (Q4909407) (← links)
- A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees (Q4973061) (← links)
- (Q5090924) (← links)
- A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees (Q5147500) (← links)
- Fast distributed random walks (Q5170313) (← links)
- Fast byzantine agreement in dynamic networks (Q5176084) (← links)
- On the complexity of universal leader election (Q5176087) (← links)
- Efficient distributed random walks with applications (Q5176199) (← links)
- Sublinear Message Bounds for Randomized Agreement (Q5197696) (← links)
- (Q5203926) (← links)
- Efficient Computation of Balanced Structures (Q5327467) (← links)
- Distributed Computation of Large-scale Graph Problems (Q5362982) (← links)
- Brief Announcement (Q5368965) (← links)
- Distributed Random Walks (Q5395702) (← links)
- Distributed verification and hardness of distributed approximation (Q5419106) (← links)
