2007 - ACM Fellow For contributions to algorithms and complexity theory.
1995 - Fellow of Alfred P. Sloan Foundation
His scientific interests lie mostly in Data stream mining, Data mining, Theoretical computer science, Cluster analysis and Data stream. The Data stream mining study combines topics in areas such as Data stream clustering, Algorithm, Approximation algorithm and Sliding window protocol. His research in Data mining tackles topics such as Synthetic data which are related to areas like Apriori algorithm, Association rule learning and Market basket.
In general Theoretical computer science, his work in Computability is often linked to Nested word and Automata theory linking many areas of study. His work carried out in the field of Theory of computation brings together such families of science as Model of computation and Formal language. His Information retrieval research incorporates elements of Webgraph and Web page.
Combinatorics, Discrete mathematics, Algorithm, Data mining and Theoretical computer science are his primary areas of study. His Combinatorics and Approximation algorithm, Graph coloring, Randomized algorithm, Binary logarithm and Time complexity investigations all form part of his Combinatorics research activities. His work carried out in the field of Randomized algorithm brings together such families of science as Upper and lower bounds and Probabilistic analysis of algorithms.
Rajeev Motwani mostly deals with Data stream mining in his studies of Data mining. His Data stream mining research is multidisciplinary, relying on both Real-time computing and Distributed computing. Many of his studies on Theoretical computer science involve topics that are commonly interrelated, such as Graph.
His primary areas of investigation include Algorithm, Data mining, Theoretical computer science, Combinatorics and Distributed computing. His study on Approximation algorithm, Local search and Model of computation is often connected to Data element as part of broader study in Algorithm. His study in Data mining is interdisciplinary in nature, drawing from both Tuple, Information retrieval and Outlier.
His work deals with themes such as Database and Audit, which intersect with Information retrieval. The Theoretical computer science study combines topics in areas such as Randomized algorithm and Graph. Rajeev Motwani interconnects Discrete mathematics, Metric space, Distribution, k-nearest neighbors algorithm and Nearest neighbor search in the investigation of issues within Combinatorics.
The scientist’s investigation covers issues in Data stream mining, Data mining, Algorithm, Distributed computing and Data stream management system. His Data stream mining study frequently intersects with other fields, such as Data stream. His Data mining research is multidisciplinary, incorporating perspectives in Construct, Sample, Ranking and Degree.
His Algorithm research integrates issues from Discrete mathematics, Production, Probability distribution and k-anonymity. Rajeev Motwani has included themes like Server, Encryption and Service in his Distributed computing study. His studies deal with areas such as Query plan, Real-time computing, Tuple and Focus as well as Data stream management system.
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.
The PageRank Citation Ranking : Bringing Order to the Web
Lawrence Page;Sergey Brin;Rajeev Motwani;Terry Winograd.
the web conference (1999)
Introduction to Automata Theory, Languages, and Computation
John E. Hopcroft;Rajeev Motwani;Rotwani;Jeffrey D. Ullman.
(1979)
Randomized Algorithms
Rajeev Motwani;Prabhakar Raghavan.
(1995)
Approximate nearest neighbors: towards removing the curse of dimensionality
Piotr Indyk;Rajeev Motwani.
symposium on the theory of computing (1998)
Similarity Search in High Dimensions via Hashing
Aristides Gionis;Piotr Indyk;Rajeev Motwani.
very large data bases (1999)
Models and issues in data stream systems
Brian Babcock;Shivnath Babu;Mayur Datar;Rajeev Motwani.
symposium on principles of database systems (2002)
Dynamic itemset counting and implication rules for market basket data
Sergey Brin;Rajeev Motwani;Jeffrey D. Ullman;Shalom Tsur.
international conference on management of data (1997)
Proof verification and the hardness of approximation problems.
Sanjeev Arora;Carsten Lund;Rajeev Motwani;Madhu Sudan.
Electronic Colloquium on Computational Complexity (1998)
Beyond market baskets: generalizing association rules to correlations
Sergey Brin;Rajeev Motwani;Craig Silverstein.
international conference on management of data (1997)
Approximate frequency counts over data streams
Gurmeet Singh Manku;Rajeev Motwani.
very large data bases (2012)
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:
Stanford University
Google (United States)
Stanford University
Google (United States)
Microsoft (United States)
MIT
Stanford University
University of Illinois at Urbana-Champaign
Stanford University
Rice University
University of California, Santa Barbara
Reichman University
InterDigital (United States)
Federal Institute For Materials Research and Testing
University of California, San Diego
Indiana University
KIIT University
Cornell University
University of California, Santa Barbara
Lund University
Montana State University
Leiden University
Catholic University of America
Harvard University
University of Colorado Anschutz Medical Campus
Brown University