Rajeev Motwani | Academic Influence

Rajeev Motwani's AcademicInfluence.com Rankings

Rajeev Motwani

Computer Science

#268

World Rank

#280

Historical Rank

Theoretical Computer Science

#9

World Rank

#9

Historical Rank

Database

#353

World Rank

#369

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Rajeev Motwani's Degrees

PhD Computer Science University of California, Berkeley
Masters Computer Science University of California, Berkeley

Similar Degrees You Can Earn

Why Is Rajeev Motwani Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Rajeev Motwani was an Indian American professor of Computer Science at Stanford University whose research focused on theoretical computer science. He was a special advisor to Sequoia Capital. He was a winner of the Gödel Prize in 2001.

(See a Problem?)

Rajeev Motwani's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The PageRank Citation Ranking : Bringing Order to the Web (1999) (14947)
Approximate nearest neighbors: towards removing the curse of dimensionality (1998) (4755)
Similarity Search in High Dimensions via Hashing (1999) (3638)
Models and issues in data stream systems (2002) (2991)
Randomized Algorithms (1995) (2490)
Dynamic itemset counting and implication rules for market basket data (1997) (2245)
Proof verification and hardness of approximation problems (1992) (2163)
Beyond market baskets: generalizing association rules to correlations (1997) (1634)
Approximate Frequency Counts over Data Streams (2012) (1348)
Clustering Data Streams: Theory and Practice (2003) (940)
Maintaining Stream Statistics over Sliding Windows (2002) (862)
Path planning in expansive configuration spaces (1997) (775)
Streaming-data algorithms for high-quality clustering (2002) (678)
STREAM: The Stanford Stream Data Manager (2003) (675)
Chapter 31 – Approximate Frequency Counts over Data Streams (2002) (662)
Incremental clustering and dynamic information retrieval (1997) (630)
Approximate graph coloring by semidefinite programming (1994) (557)
Robust and efficient fuzzy match for online data cleaning (2003) (554)
Query Processing, Approximation, and Resource Management in a Data Stream Management System (2003) (552)
Finding interesting associations without support pruning (2000) (481)
Computing Iceberg Queries Efficiently (1998) (434)
On finding narrow passages with probabilistic roadmap planners (1998) (389)
Query Processing, Resource Management, and Approximation ina Data Stream Management System (2002) (384)
Beyond Market Baskets: Generalizing Association Rules to Dependence Rules (1998) (384)
Sampling from a moving window over streaming data (2002) (382)
Load shedding for aggregation queries over data streams (2004) (377)
Challenges in web search engines (2002) (368)
On random sampling over joins (1999) (366)
Truthful auctions for pricing search keywords (2006) (352)
Anonymizing Tables (2005) (344)
Maintaining variance and k-medians over data stream windows (2003) (333)
Two Can Keep A Secret: A Distributed Architecture for Secure Database Services (2005) (329)
A Random Sampling Scheme for Path Planning (1997) (314)
Chain: operator scheduling for memory minimization in data stream systems (2003) (313)
Fast estimation of diameter and shortest paths (without matrix multiplication) (1996) (307)
Scalable Techniques for Mining Causal Structures (1998) (307)
On syntactic versus computational views of approximability (1994) (304)
Extracting schema from semistructured data (1998) (285)
Approximation Algorithms for k-Anonymity (2005) (281)
Random sampling for histogram construction: how much is enough? (1998) (280)
Maintaining stream statistics over sliding windows: (extended abstract) (2002) (277)
STREAM: The Stanford Data Stream Management System (2016) (272)
A Visibility-Based Pursuit-Evasion Problem (1999) (266)
Clique partitions, graph compression and speeding-up algorithms (1991) (262)
Towards estimation error guarantees for distinct values (2000) (246)
Adaptive ordering of pipelined stream filters (2004) (246)
Non-clairvoyant scheduling (1994) (235)
Robust identification of fuzzy duplicates (2005) (231)
Visibility-Based Pursuit-Evasion in a Polygonal Environment (1997) (228)
Approximation techniques for average completion time scheduling (1997) (221)
Query optimization over web services (2006) (219)
Query flocks: a generalization of association-rule mining (1998) (214)
Link Privacy in Social Networks (2008) (212)
On approximating the longest path in a graph (1993) (212)
Finding an unpredictable target in a workspace with obstacles (1997) (193)
Randomized query processing in robot path planning (1995) (187)
Operator scheduling in data stream systems (2004) (184)
Tail bounds for occupancy and the satisfiability threshold conjecture (1994) (178)
Locality-preserving hashing in multidimensional spaces (1997) (173)
Mining the stock market (extended abstract): which measure is best? (2000) (173)
What can you do with a Web in your Pocket? (1998) (167)
Overcoming limitations of sampling for aggregation queries (2001) (166)
Mining The Stock Market : Which Measure Is Best ? (2000) (154)
Inferring structure in semistructured data (1997) (150)
List Partitions (2003) (140)
The Robot Localization Problem (1995) (134)
Approximating Capacitated Routing and Delivery Problems (1999) (131)
Towards robustness in query auditing (2006) (127)
The probabilistic method yields deterministic parallel algorithms (1989) (127)
Lower bounds on locality sensitive hashing (2005) (126)
Complexity of graph partition problems (1999) (122)
The price of validity in dynamic networks (2004) (121)
Keyword Generation for Search Engine Advertising (2006) (121)
Pricing Strategies for Viral Marketing on Social Networks (2009) (118)
Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine (1999) (110)
Adaptive caching for continuous queries (2005) (105)
Towards a syntactic characterization of PTAS (1996) (103)
Load Shedding Techniques for Data Stream Systems (2003) (100)
The load rebalancing problem (2003) (88)
Algorithms for Multi-product Pricing (2004) (87)
The angular-metric traveling salesman problem (1997) (86)
Stable husbands (1990) (86)
Computing Roots of Graphs Is Hard (1994) (86)
The Pipelined Set Cover Problem (2005) (85)
Introduction to automata theory, languages, and computation - international edition, 2nd Edition (2003) (78)
Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism (1994) (78)
Complexity measures for assembly sequences (1996) (77)
Covering orthogonal polygons with star polygons: the perfect graph approach (1988) (76)
Scale Free Aggregation in Sensor Networks (2004) (74)
Geometric matching under noise: combinatorial bounds and algorithms (1999) (72)
Next Generation of Data Mining (2008) (71)
Scheduling problems in parallel query optimization (1995) (71)
Vision Paper: Enabling Privacy for the Paranoids (2004) (68)
Distributing data for secure database services (2011) (67)
Estimating corpus size via queries (2006) (66)
The Greedy Algorithm is Optimal for On-Line Edge Coloring (1992) (65)
Profile-driven instruction level parallel scheduling with application to super blocks (1996) (62)
RAPID: randomized pharmacophore identification for drug design (1997) (62)
Constructive results from graph minors: linkless embeddings (1988) (62)
Efficient Algorithms for Masking and Finding Quasi-Identifiers (2007) (61)
Lecture notes on approximation algorithms: Volume I (1993) (58)
Combining Register Allocation and Instruction Scheduling (1995) (58)
The robot localization problem in two dimensions (1992) (57)
Computing the median with uncertainty (2000) (56)
Coloring Away Communication in Parallel Query Optimization (1995) (55)
Approximating Probability Distributions Using Small Sample Spaces (1998) (54)
Average-case analysis of algorithms for matchings and related problems (1994) (53)
A simple approach for pricing equity options with Markov switching state variables (2006) (51)
Auditing SQL Queries (2008) (50)
Nonholonomic path planning for pushing a disk among obstacles (1997) (49)
Estimating Aggregates on a Peer-to-Peer Network (2003) (47)
Computing shortest paths with uncertainty (2003) (45)
Switch scheduling via randomized edge coloring (2003) (44)
Modeling correlations in web traces and implications for designing replacement policies (2004) (42)
The Sliding-Window Computation Model and Results (2007) (39)
A Survey of Query Auditing Techniques for Data Privacy (2008) (39)
Geometric Manipulation of Flexible Ligands (1996) (39)
On Certificates and Lookahead in Dynamic Graph Problems (1996) (39)
Perfect Graphs and Orthogonally Convex Covers (1989) (39)
, “Introduction to Automata Theory, Languages and Computations”, second Edition, Pearson Education, 2007 (2015) (38)
Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques (1998) (37)
Worst-case time bounds for coloring and satisfiability problems (2002) (35)
Algorithms for Robot Grasp and Delivery (1996) (34)
Combinatorial and Experimental Methods for Approximate Point Pattern Matching (2003) (30)
Anonymizing Unstructured Data (2008) (29)
Storage management for evolving databases (1997) (29)
Approximating the Longest Cycle Problem in Sparse Graphs (2002) (29)
Load Shedding in Data Stream Systems (2007) (29)
On the decidability of accessibility problems (extended abstract) (2000) (28)
Finding large cycles in Hamiltonian graphs (2005) (28)
Motion Planning with Visibility Constraints: Building Autonomous Observers (1998) (28)
An NC Algorithm for Minimum Cuts (1997) (27)
Scale-free aggregation in sensor networks (2005) (27)
Randomized Algorithms: Number Theory and Algebra (1995) (26)
On Diameter Verification and Boolean Matrix Multiplication. (1995) (25)
Intractability of Assembly Sequencing: Unit Disks in the Plane (1996) (24)
Deferred Data Structuring (1988) (24)
“Introduction to Automata Theory, Languages and Computations”, Second Edition, Pearson Education, 2008. (UNIT 1,2,3) 2 (2015) (24)
Constrained TSP and Low-Power Computing (1997) (23)
Derandomization through approximation: an NC algorithm for minimum cuts (1994) (23)
Computing Iceberg Queries E ciently (1998) (22)
Geometric shape matching and drug design (1999) (22)
Accurate approximations for Asian options (2000) (22)
Dynamic Maintenance of Kinematic Structures (1995) (21)
Approximate Graph Coloring by Semide nite (1994) (21)
Approximation Algorithms for the Largest Common Subtree Problem. (1995) (21)
Geometric pattern matching: a performance study (1999) (20)
Expanding graphs and the average-case analysis of algorithms for matchings and related problems (1989) (20)
Estimating Sum by Weighted Sampling (2007) (20)
On Exact and Approximate Cut Covers of Graphs (1994) (18)
Web caching with request reordering (2002) (17)
Precedence Constrained Scheduling to Minimize Weighted Completion Time on a Single Machine (1998) (16)
K-connected Spanning Subgraphs of Low Degree (2006) (16)
The dynamic servers problem (1998) (16)
Online Graph Edge-Coloring in the Random-Order Arrival Model (2012) (15)
On Sampling and Relational Operators (1999) (15)
Online Scheduling with Lookahead: Multipass Assembly Lines (1998) (15)
Evolution of page popularity under random web graph models (2006) (15)
Finding long paths and cycles in sparse Hamiltonian graphs (2000) (15)
Fractional Matching Via Balls-and-Bins (2006) (14)
A combinatorial algorithm for MAX CSP (2003) (14)
Caching queues in memory buffers (2004) (14)
Combining request scheduling with web caching (2004) (13)
Representing Graph Metrics with Fewest Edges (2003) (13)
Distinct Values Estimators for Power Law Distributions (2006) (12)
Enabling Privacy for the Paranoids (2004) (12)
Dynamic miss-counting algorithms: finding implication and similarity rules with confidence pruning (2000) (11)
Probabilistic Analysis of Network Flow Algorithms (1993) (11)
Channel assignment in wireless networks and classification of minimum graph homomorphism (2006) (11)
Sliding Window Computations over Data Streams (2002) (10)
A Linear Time Approach to the Set Maxima Problem (1992) (10)
Randomized Algorithms: Online Algorithms (1995) (10)
Multiple access point grid based password scheme for enhanced online security (2013) (9)
Combining Register Allocation and Instruction Scheduling ( Technical Summary ) (1995) (9)
Deferred data structuring: Query-driven preprocessing for geometric search problems (1986) (9)
A 1.43-competitive online graph edge coloring algorithm in the random order arrival model (2010) (8)
Tracing the Path: New Model and Algorithms for Collaborative Filtering (2007) (8)
Profile-Driven Instruction Level Parallel Scheduling (1996) (7)
Online Distributed Predicate Evaluation (2003) (7)
Randomized query processing in robot path planning (Extended Abstract). (1995) (7)
Auditing a Batch of SQL Queries (2007) (6)
Approximation Algorithms for k-Anonymity 1 (2005) (6)
Minimizing weighted completion time on a single machine (1999) (6)
On identifying stable ways to configure systems (2004) (6)
Randomized Algorithms: Tail Inequalities (1995) (5)
Sublinear Projective Clustering with Outliers (2005) (5)
Optimization Algorithms for Pipelined Parallelism (1994) (5)
Introduction: Special Issue on Theoretical Advances in Data Clustering (2004) (4)
Probabilistic analysis of matching and network flow algorithms (1988) (4)
Graph certificates, lookahead in dynamic graph problems, and assembly planning in robotics (1994) (4)
Proceedings of the 2002 SIAM International Conference on Data Mining (2002) (4)
Randomized Algorithms: Markov Chains and Random Walks (1995) (3)
On the graph turnpike problem (2009) (3)
Proceedings of the 9th International Conference on Database Theory (2003) (3)
Algorithms for the Database Layout Problem (2005) (3)
Database Theory — ICDT 2003 (2002) (2)
or Assembly Sequences (1996) (2)
Proceedings of the Second SIAM International Conference on Data Mining, SIAM 2002 (2002) (2)
A Novel Method of Spam Mail Detection using Text Based Clustering Approach (2016) (2)
Asymptotic Polynomial-Time Approximation Schemes (2007) (2)
Random Sampling Based Algorithms for Efficient Semi-Key Discovery (2006) (2)
‫טכנים‬ ‫וענינים‬ ‫הקדמה‬ :‫הבא‬ ‫הספר‬ ‫לפי‬ ‫בד"כ‬ ‫יהיו‬ ‫אחרים‬ ‫אלגוריתמים‬ ‫חלקים‬ M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Prob- Abilistic Analysis. :‫אותנו‬ ‫שישמש‬ ‫האנטרופיה‬ ‫לתורת‬ ‫בסיסי‬ ‫מבוא‬ ‫מכיל‬ ‫הבא‬ ‫הספר‬ (1)
The Proba,bilistic Met hod Yields Deterministic Parallel Algori thins (1989) (1)
Studying the Potential of Multi-Target Classification on Patient Screening Data to Predict Dropout Cases (2018) (1)
Asymptotic Polynomial-Time Approximation Schemes. Handbook of Approximation Algorithms and Metaheuristics. (2007) (1)
Generation of Data Mining and Cyber-Enabled Discovery for Innovation ( NGDM ’ 07 ) : Final Report Report Committee : (2007) (1)
Randomized Algorithms: Parallel and Distributed Algorithms (1995) (1)
Randomized Algorithms: Introduction (1995) (1)
Approximation Algorithms for $k$-Delivery TSP (1995) (1)
KOMOS – A Keyword Occurrence Method for Ordering Search Results (2010) (1)
Randomized Algorithms: Game-Theoretic Techniques (1995) (0)
of Flexible Ligands (1996) (0)
NOTATIONAL INDEX: (2012) (0)
Link Privacyin SocialNetworks (2008) (0)
Randomized Algorithms: Preface (1995) (0)
Realization of Matrices and Directed Graphs (1998) (0)
Randomized Algorithms: Geometric Algorithms and Linear Programming (1995) (0)
Moments and Deviations (2013) (0)
Randomized Algorithms: Basic Probability Theory (1995) (0)
Geometric Manipulation of F Lexible Ligands ? (1996) (0)
A Novel Progressive Sampling based Approach for Effective Mining of Association Rules (2016) (0)
Algorithms for similarity search and clustering in large data sets (2003) (0)
An Overview of Randomized Algorithms (1998) (0)
Eco-Friendly Horn Using Radio Frequencies (2013) (0)
The Probabilistic Method (2013) (0)
Chapter 7 LOAD SHEDDING IN DATA STREAM SYSTEMS (2013) (0)
Aggregating Correlated Data in Sensor Networks (2004) (0)
Distributed Streams-Based Data-Mining for Application Intrusion Detection (2004) (0)
Guest Editors' Foreword (2000) (0)
SPECIAL ISSUE IN HONOR OF RAJEEV MOTWANI (2012) (0)
Computing Iceberg Queries Eeciently Paper Number 234 (1998) (0)
On the Graph Turnpike Problem Tomás Feder (2008) (0)
Chapter 8 THE SLIDING-WINDOW COMPUTATION MODEL AND RESULTS * (2007) (0)
2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology - Title (2007) (0)
Randomized Algorithms: References (1995) (0)
Detecting Similar Contents Using FNNS-LSH Model in E-Learning Environment (2016) (0)
Database theory - ICDT 2003 : 9th International Conference, Siena, Italy, January 8-10, 2003 : proceedings (2003) (0)
Proceedings of the Second SIAM International Conference on Data Mining, Arlington, VA, USA, April 11-13, 2002 (2002) (0)
Elementary complexity theory November 17 , 2018 1 Languages , automata (2018) (0)

This paper list is powered by the following services:

Other Resources About Rajeev Motwani

What Schools Are Affiliated With Rajeev Motwani?

Rajeev Motwani is affiliated with the following schools:

What Are Rajeev Motwani's Academic Contributions?

Rajeev Motwani is most known for their academic work in the field of computer science. They are also known for their academic work in the fields of

Rajeev Motwani has made the following academic contributions:

Introduction to Automata Theory, Languages, and Computation

Image Attributions

Image Source for Rajeev Motwani