2020 - ACM Fellow For contributions to web science modeling, analytics, and algorithms
His main research concerns World Wide Web, Theoretical computer science, Rank, Data mining and Graph. His World Wide Web research is multidisciplinary, incorporating elements of Structure, Graph and Giant component. His Theoretical computer science research is multidisciplinary, relying on both Cryptography, Directed graph, Exploit, Coding and Error detection and correction.
His research in Rank intersects with topics in Ranking, Context, Ranking and Nearest neighbor search. His Data mining study incorporates themes from Web search query, Web query classification, Information retrieval and Clustering high-dimensional data. The Graph study combines topics in areas such as Streaming algorithm and Biological network.
The scientist’s investigation covers issues in Theoretical computer science, Combinatorics, Discrete mathematics, World Wide Web and Algorithm. The concepts of his Theoretical computer science study are interwoven with issues in Graph, Data mining, Directed graph, Graph and Voltage graph. His Combinatorics study combines topics from a wide range of disciplines, such as Upper and lower bounds and Omega.
His Discrete mathematics research is multidisciplinary, incorporating perspectives in Class and Metric. His work investigates the relationship between World Wide Web and topics such as Information retrieval that intersect with problems in Set. His study in Approximation algorithm is interdisciplinary in nature, drawing from both Matrix and Cluster analysis.
Ravi Kumar mostly deals with Cluster analysis, Theoretical computer science, Combinatorics, Upper and lower bounds and Algorithm. His Cluster analysis study integrates concerns from other disciplines, such as Efficient algorithm, Point and Approximation algorithm. He combines Theoretical computer science and Baseline in his studies.
Ravi Kumar interconnects Value, Simple and Tight closure in the investigation of issues within Combinatorics. His Upper and lower bounds research incorporates themes from Omega, Data access, Treewidth, Binary number and Differential privacy. His research integrates issues of Sample, Markov process and Aggregate in his study of Algorithm.
His primary scientific interests are in Theoretical computer science, Cluster analysis, Algorithm, Combinatorics and Approximation algorithm. He integrates many fields in his works, including Theoretical computer science and Online setting. His research in the fields of CURE data clustering algorithm overlaps with other disciplines such as Line.
Ravi Kumar has included themes like Conductance, Low-rank approximation, Rank and Discrete mathematics in his Algorithm study. His study in the fields of Binary logarithm under the domain of Combinatorics overlaps with other disciplines such as AKA. His study in Approximation algorithm is interdisciplinary in nature, drawing from both Center, Value, Representation and Series.
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.
Graph structure in the Web
Andrei Broder;Ravi Kumar;Farzin Maghoul;Prabhakar Raghavan.
the web conference (2000)
Structure and evolution of online social networks
Ravi Kumar;Jasmine Novak;Andrew Tomkins.
knowledge discovery and data mining (2006)
Pig latin: a not-so-foreign language for data processing
Christopher Olston;Benjamin Reed;Utkarsh Srivastava;Ravi Kumar.
international conference on management of data (2008)
Rank aggregation methods for the Web
Cynthia Dwork;Ravi Kumar;Moni Naor;D. Sivakumar.
the web conference (2001)
Propagation of trust and distrust
R. Guha;Ravi Kumar;Prabhakar Raghavan;Andrew Tomkins.
the web conference (2004)
Trawling the Web for emerging cyber-communities
Ravi Kumar;Prabhakar Raghavan;Sridhar Rajagopalan;Andrew Tomkins.
the web conference (1999)
The web as a graph: measurements, models, and methods
Jon M. Kleinberg;Ravi Kumar;Prabhakar Raghavan;Sridhar Rajagopalan.
computing and combinatorics conference (1999)
Comparing top k lists
Ronald Fagin;Ravi Kumar;D. Sivakumar.
symposium on discrete algorithms (2003)
Geographic routing in social networks
David Liben-Nowell;Jasmine Novak;Ravi Kumar;Prabhakar Raghavan.
Proceedings of the National Academy of Sciences of the United States of America (2005)
Stochastic models for the Web graph
R. Kumar;P. Raghavan;S. Rajagopalan;D. Sivakumar.
foundations of computer science (2000)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: