What is he best known for?
The fields of study he is best known for:
- Computer network
- Algorithm
- Graph theory
Gopal Pandurangan mainly focuses on Distributed algorithm, Distributed computing, Theoretical computer science, Randomized algorithm and Graph.
His Distributed algorithm study combines topics in areas such as Dynamic network analysis, Hardness of approximation and Algorithm, Communication complexity, Minimum spanning tree.
His biological study deals with issues like Exact algorithm, which deal with fields such as Discrete mathematics.
The various areas that Gopal Pandurangan examines in his Minimum spanning tree study include Upper and lower bounds, Approximation algorithm and Spanning tree.
His Distributed computing study incorporates themes from Network topology, Wireless sensor network, Computer network and Brooks–Iyengar algorithm.
His Theoretical computer science study combines topics from a wide range of disciplines, such as Complement graph, Computation, Null graph and Factor-critical graph.
His most cited work include:
- Building low-diameter P2P networks (189 citations)
- Distributed Verification and Hardness of Distributed Approximation (186 citations)
- Using PageRank to Characterize Web Structure (154 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Distributed algorithm, Upper and lower bounds, Discrete mathematics, Theoretical computer science and Combinatorics.
His Distributed algorithm study incorporates themes from Graph, Algorithm, Randomized algorithm, Computation and Spanning tree.
His Computation research includes elements of Graph, Distributed computing and Enumeration.
The Upper and lower bounds study combines topics in areas such as Time complexity, Sublinear function, Matching, Communication complexity and Speedup.
His work carried out in the field of Theoretical computer science brings together such families of science as Telecommunications network, Network topology, Node, Load balancing and Online algorithm.
His research in the fields of Binary logarithm, Random graph and Distributed approximation overlaps with other disciplines such as Maximal independent set and High probability.
He most often published in these fields:
- Distributed algorithm (55.43%)
- Upper and lower bounds (31.52%)
- Discrete mathematics (28.80%)
What were the highlights of his more recent work (between 2017-2021)?
- Distributed algorithm (55.43%)
- Randomized algorithm (24.46%)
- Upper and lower bounds (31.52%)
In recent papers he was focusing on the following fields of study:
Gopal Pandurangan spends much of his time researching Distributed algorithm, Randomized algorithm, Upper and lower bounds, Leader election and Discrete mathematics.
His Distributed algorithm study combines topics in areas such as Time complexity, Binary logarithm, Combinatorics, Graph and Computation.
Gopal Pandurangan combines subjects such as Enumeration, Theoretical computer science and Random graph with his study of Computation.
Gopal Pandurangan has researched Randomized algorithm in several fields, including Power graph analysis, Deterministic algorithm and k-nearest neighbors algorithm.
His research investigates the link between Upper and lower bounds and topics such as Node that cross with problems in Flooding algorithm, Security token, Unicast and Wireless network.
His study in the field of Sublinear function and Communication complexity also crosses realms of Generalization.
Between 2017 and 2021, his most popular works were:
- On the Distributed Complexity of Large-Scale Graph Computations (30 citations)
- Time-Message Trade-Offs in Distributed Algorithms (10 citations)
- Fast Distributed Algorithms for Connectivity and MST in Large Graphs (8 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- Algorithm
- Graph theory
Distributed algorithm, Upper and lower bounds, Graph, Binary logarithm and Discrete mathematics are his primary areas of study.
The various areas that Gopal Pandurangan examines in his Distributed algorithm study include Time complexity, Minimum spanning tree, Randomized algorithm, Combinatorics and Computation.
His Randomized algorithm research integrates issues from Leader election and Spanning tree.
His Computation research includes themes of Theoretical computer science and Random graph.
His study in Graph is interdisciplinary in nature, drawing from both Computer network, Message passing and Distributed minimum spanning tree.
His study on Communication complexity is often connected to Node as part of broader study in Discrete mathematics.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
