Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search Problems. - Rajeev Motwani 001; Prabhakar Raghavan (SCG, 1986)

Constructive Results from Graph Minors: Linkless Embeddings - Rajeev Motwani 001; Arvind Raghunathan; Huzur Saran (FOCS, 1988)

Deferred Data Structuring. - Richard M. Karp; Rajeev Motwani 001; Prabhakar Raghavan (SIAM J. Comput., 1988)

Expanding Graphs and the Average-case Analysis of Algorithms for Matchings and Related Problems - Rajeev Motwani 001 (STOC, 1989)

Perfect Graphs and Orthogonally Convex Covers. - Rajeev Motwani 001; Arvind Raghunathan; Huzur Saran (SIAM J. Discret. Math., 1989)

Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach. - Rajeev Motwani 001; Arvind Raghunathan; Huzur Saran (J. Comput. Syst. Sci., 1990)

Stable Husbands. - Donald E. Knuth; Rajeev Motwani 001; Boris G. Pittel (Random Struct. Algorithms, 1990)

The Robot Localization Problem in Two Dimensions. - Leonidas J. Guibas; Rajeev Motwani 001; Prabhakar Raghavan (SODA, 1992)

The Greedy Algorithm is Optimal for On-Line Edge Coloring. - Amotz Bar-Noy; Rajeev Motwani 001; Joseph Naor (Inf. Process. Lett., 1992)

A Linear Time Approach to the Set Maxima Problem. - Amotz Bar-Noy; Rajeev Motwani 001; Joseph Naor (SIAM J. Discret. Math., 1992)

On Approximating the Longest Path in a Graph (Preliminary Version). - David R. Karger; Rajeev Motwani 001; G. D. S. Ramkumar (WADS, 1993)

Probabilistic Analysis of Network Flow Algorithms. - Richard M. Karp; Rajeev Motwani 001; Noam Nisan (Math. Oper. Res., 1993)

Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism. - Waqar Hasan; Rajeev Motwani 001 (VLDB, 1994)

Computing Roots of Graphs Is Hard. - Rajeev Motwani 001; Madhu Sudan 001 (Discret. Appl. Math., 1994)

Average-Case Analysis of Algorithms for Matchings and Related Problems. - Rajeev Motwani 001 (J. ACM, 1994)

The Probabilistic Method Yields Deterministic Parallel Algorithms. - Rajeev Motwani 001; Joseph Naor; Moni Naor (J. Comput. Syst. Sci., 1994)

Non-Clairvoyant Scheduling. - Rajeev Motwani 001; Steven J. Phillips; Eric Torng (Theor. Comput. Sci., 1994)

Randomized Algorithms. - Rajeev Motwani 001; Prabhakar Raghavan (Cambridge University Press, 1995)

Scheduling Problems in Parallel Query Optimization. - Chandra Chekuri; Waqar Hasan; Rajeev Motwani 001 (PODS, 1995)

Randomized query processing in robot path planning (Extended Abstract). - Lydia E. Kavraki; Jean-Claude Latombe; Rajeev Motwani 001; Prabhakar Raghavan (STOC, 1995)

Coloring Away Communication in Parallel Query Optimization. - Waqar Hasan; Rajeev Motwani 001 (VLDB, 1995)

Clique Partitions, Graph Compression and Speeding-Up Algorithms. - Tomás Feder; Rajeev Motwani 001 (J. Comput. Syst. Sci., 1995)

Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture. - Anil Kamath; Rajeev Motwani 001; Krishna V. Palem; Paul G. Spirakis (Random Struct. Algorithms, 1995)

Randomized Algorithms. - Rajeev Motwani 001; Prabhakar Raghavan (SIGACT News, 1995)

Complexity measures for assembly sequences. - Michael H. Goldwasser; Jean-Claude Latombe; Rajeev Motwani 001 (ICRA, 1996)

Profile-driven Instruction Level Parallel Scheduling with Application to Super Blocks. - Chandra Chekuri; Richard Johnson; Rajeev Motwani 001; B. Natarajan; B. Ramakrishna Rau; Michael S. Schlansker (MICRO, 1996)

Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication). - Donald Aingworth; Chandra Chekuri; Rajeev Motwani 001 (SODA, 1996)

Towards a Syntactic Characterization of PTAS. - Sanjeev Khanna; Rajeev Motwani 001 (STOC, 1996)

Geometric Manipulation of Flexible Ligands. - Paul W. Finn; Dan Halperin; Lydia E. Kavraki; Jean-Claude Latombe; Rajeev Motwani 001; Christian R. Shelton; Suresh Venkatasubramanian (WACG, 1996)

Randomized Algorithms. - Rajeev Motwani 001; Prabhakar Raghavan (The Computer Science and Engineering Handbook, 1997)

Storage Management for Evolving Databases. - Jon M. Kleinberg; Rajeev Motwani 001; Prabhakar Raghavan; Suresh Venkatasubramanian (FOCS, 1997)

Nonholonomic path planning for pushing a disk among obstacles. - Pankaj K. Agarwal; Jean-Claude Latombe; Rajeev Motwani 001; Prabhakar Raghavan (ICRA, 1997)

Finding an unpredictable target in a workspace with obstacles. - Steven M. LaValle; David Lin; Leonidas J. Guibas; Jean-Claude Latombe; Rajeev Motwani 001 (ICRA, 1997)

Beyond Market Baskets: Generalizing Association Rules to Correlations. - Sergey Brin; Rajeev Motwani 001; Craig Silverstein (SIGMOD Conference, 1997)

Dynamic Itemset Counting and Implication Rules for Market Basket Data. - Sergey Brin; Rajeev Motwani 001; Jeffrey D. Ullman; Shalom Tsur (SIGMOD Conference, 1997)

Locality-Preserving Hashing in Multidimensional Spaces. - Piotr Indyk; Rajeev Motwani 001; Prabhakar Raghavan; Santosh S. Vempala (STOC, 1997)

Constrained TSP and Low-Power Computing. - Moses Charikar; Rajeev Motwani 001; Prabhakar Raghavan; Craig Silverstein (WADS, 1997)

Intractability of Assembly Sequencing: Unit Disks in the Plane. - Michael H. Goldwasser; Rajeev Motwani 001 (WADS, 1997)

Visibility-Based Pursuit-Evasion in a Polygonal Environment. - Leonidas J. Guibas; Jean-Claude Latombe; Steven M. LaValle; David Lin; Rajeev Motwani 001 (WADS, 1997)

On Approximating the Longest Path in a Graph. - David R. Karger; Rajeev Motwani 001; G. D. S. Ramkumar (Algorithmica, 1997)

A Random Sampling Scheme for Path Planning. - Jérôme Barraquand; Lydia E. Kavraki; Jean-Claude Latombe; Tsai-Yen Li; Rajeev Motwani 001; Prabhakar Raghavan (Int. J. Robotics Res., 1997)

The Robot Localization Problem. - Leonidas J. Guibas; Rajeev Motwani 001; Prabhakar Raghavan (SIAM J. Comput., 1997)

An NC Algorithm for Minimum Cuts. - David R. Karger; Rajeev Motwani 001 (SIAM J. Comput., 1997)

Infering Structure in Semistructured Data. - Svetlozar Nestorov; Serge Abiteboul; Rajeev Motwani 001 (SIGMOD Rec., 1997)

Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques. - David Hsu; Lydia E. Kavraki; Jean-Claude Latombe; Rajeev Motwani 001 (IPPS/SPDP Workshops, 1998)

Random Sampling for Histogram Construction: How much is enough? - Surajit Chaudhuri; Rajeev Motwani 001; Vivek R. Narasayya (SIGMOD Conference, 1998)

Extracting Schema from Semistructured Data. - Svetlozar Nestorov; Serge Abiteboul; Rajeev Motwani 001 (SIGMOD Conference, 1998)

Query Flocks: A Generalization of Association-Rule Mining. - Shalom Tsur; Jeffrey D. Ullman; Serge Abiteboul; Chris Clifton; Rajeev Motwani 001; Svetlozar Nestorov; Arnon Rosenthal (SIGMOD Conference, 1998)

The Dynamic Servers Problem. - Moses Charikar; Dan Halperin; Rajeev Motwani 001 (SODA, 1998)

Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. - Piotr Indyk; Rajeev Motwani 001 (STOC, 1998)

Computing Iceberg Queries Efficiently. - Min Fang; Narayanan Shivakumar; Hector Garcia-Molina; Rajeev Motwani 001; Jeffrey D. Ullman (VLDB, 1998)

On Certificates and Lookahead in Dynamic Graph Problems. - Sanjeev Khanna; Rajeev Motwani 001; Randall H. Wilson (Algorithmica, 1998)

Approximating Probability Distributions Using Small Sample Spaces. - Yossi Azar; Rajeev Motwani 001; Joseph Naor (Comb., 1998)

RAPID: Randomized pharmacophore identification for drug design. - Paul W. Finn; Lydia E. Kavraki; Jean-Claude Latombe; Rajeev Motwani 001; Christian R. Shelton; Suresh Venkatasubramanian; Andrew Chi-Chih Yao (Comput. Geom., 1998)

Beyond Market Baskets: Generalizing Association Rules to Dependence Rules. - Craig Silverstein; Sergey Brin; Rajeev Motwani 001 (Data Min. Knowl. Discov., 1998)

What can you do with a Web in your Pocket? - Sergey Brin; Rajeev Motwani 001; Lawrence Page; Terry Winograd (IEEE Data Eng. Bull., 1998)

Proof verification and the hardness of approximation problems. - Sanjeev Arora; Carsten Lund; Rajeev Motwani 001; Madhu Sudan 001; Mario Szegedy (Electron. Colloquium Comput. Complex., 1998)

Online Scheduling with Lookahead: Multipass Assembly Lines. - Rajeev Motwani 001; Vijay A. Saraswat; Eric Torng (INFORMS J. Comput., 1998)

Approximate Graph Coloring by Semidefinite Programming. - David R. Karger; Rajeev Motwani 001; Madhu Sudan 001 (J. ACM, 1998)

Realization of Matrices and Directed Graphs. - Rajeev Motwani 001 (J. Algorithms, 1998)

Randomized Query Processing in Robot Path Planning. - Lydia E. Kavraki; Jean-Claude Latombe; Rajeev Motwani 001; Prabhakar Raghavan (J. Comput. Syst. Sci., 1998)

On Syntactic versus Computational Views of Approximability. - Sanjeev Khanna; Rajeev Motwani 001; Madhu Sudan 001; Umesh V. Vazirani (SIAM J. Comput., 1998)

Randomized Algorithms. - Rajeev Motwani 001; Prabhakar Raghavan (Algorithms and Theory of Computation Handbook, 1999)

Geometric Pattern Matching: A Performance Study. - Martin Gavrilov; Piotr Indyk; Rajeev Motwani 001; Suresh Venkatasubramanian (SCG, 1999)

On Random Sampling over Joins. - Surajit Chaudhuri; Rajeev Motwani 001; Vivek R. Narasayya (SIGMOD Conference, 1999)

Minimizing Weighted Completion Time on a Single Machine. - Chandra Chekuri; Rajeev Motwani 001 (SODA, 1999)

Geometric Matching Under Noise: Combinatorial Bounds and Algorithms. - Piotr Indyk; Rajeev Motwani 001; Suresh Venkatasubramanian (SODA, 1999)

Complexity of Graph Partition Problems. - Tomás Feder; Pavol Hell; Sulamita Klein; Rajeev Motwani 001 (STOC, 1999)

Similarity Search in High Dimensions via Hashing. - Aristides Gionis; Piotr Indyk; Rajeev Motwani 001 (VLDB, 1999)

Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine. - Chandra Chekuri; Rajeev Motwani 001 (Discret. Appl. Math., 1999)

On Sampling and Relational Operators. - Surajit Chaudhuri; Rajeev Motwani 001 (IEEE Data Eng. Bull., 1999)

Complexity Measures for Assembly Sequences. - Michael H. Goldwasser; Rajeev Motwani 001 (Int. J. Comput. Geom. Appl., 1999)

A Visibility-Based Pursuit-Evasion Problem. - Leonidas J. Guibas; Jean-Claude Latombe; Steven M. LaValle; David Lin; Rajeev Motwani 001 (Int. J. Comput. Geom. Appl., 1999)

Path Planning in Expansive Configuration Spaces. - David Hsu; Jean-Claude Latombe; Rajeev Motwani 001 (Int. J. Comput. Geom. Appl., 1999)

The Angular-Metric Traveling Salesman Problem. - Alok Aggarwal; Don Coppersmith; Sanjeev Khanna; Rajeev Motwani 001; Baruch Schieber (SIAM J. Comput., 1999)

Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication). - Donald Aingworth; Chandra Chekuri; Piotr Indyk; Rajeev Motwani 001 (SIAM J. Comput., 1999)

Approximating Capacitated Routing and Delivery Problems. - Prasad Chalasani; Rajeev Motwani 001 (SIAM J. Comput., 1999)

Clustering Data Streams. - Sudipto Guha; Nina Mishra; Rajeev Motwani 001; Liadan O'Callaghan (FOCS, 2000)

Dynamic Miss-Counting Algorithms: Finding Implication and Similarity Rules with Confidence Pruning. - Shinji Fujiwara; Jeffrey D. Ullman; Rajeev Motwani 001 (ICDE, 2000)

Mining the stock market (extended abstract): which measure is best? - Martin Gavrilov; Dragomir Anguelov; Piotr Indyk; Rajeev Motwani 001 (KDD, 2000)

Towards Estimation Error Guarantees for Distinct Values. - Moses Charikar; Surajit Chaudhuri; Rajeev Motwani 001; Vivek R. Narasayya (PODS, 2000)

Accurate approximations for Asian options. - Donald Aingworth; Rajeev Motwani 001; Jeffrey D. Oldham (SODA, 2000)

Finding long paths and cycles in sparse Hamiltonian graphs. - Tomás Feder; Rajeev Motwani 001; Carlos S. Subi (STOC, 2000)

On the decidability of accessibility problems (extended abstract). - Rajeev Motwani 001; Rina Panigrahy; Vijay A. Saraswat; Suresh Venkatasubramanian (STOC, 2000)

Guest Editors' Foreword. - Rajeev Motwani 001; Prabhakar Raghavan (Algorithmica, 2000)

Scalable Techniques for Mining Causal Structures. - Craig Silverstein; Sergey Brin; Rajeev Motwani 001; Jeffrey D. Ullman (Data Min. Knowl. Discov., 2000)

Introduction to automata theory, languages, and computation, 2nd Edition. - John E. Hopcroft; Rajeev Motwani 001; Jeffrey D. Ullman (Addison-Wesley-Longman, 2001)

Optimizing iterative decoding of low-density parity check codes on programmable pipelined parallel architectures. - Ghazi Al-Rawi; John M. Cioffi; Rajeev Motwani 001; Mark Horowitz (GLOBECOM, 2001)

Overcoming Limitations of Sampling for Aggregation Queries. - Surajit Chaudhuri; Gautam Das 001; Mayur Datar; Rajeev Motwani 001; Vivek R. Narasayya (ICDE, 2001)

Guest Editor's Foreword. - Rajeev Motwani 001 (J. Comput. Syst. Sci., 2001)

Approximation Techniques for Average Completion Time Scheduling. - Chandra Chekuri; Rajeev Motwani 001; B. Natarajan; Clifford Stein 001 (SIAM J. Comput., 2001)

Introduction to automata theory, languages, and computation, 2nd edition. - John E. Hopcroft; Rajeev Motwani 001; Jeffrey D. Ullman (SIGACT News, 2001)

Finding Interesting Associations without Support Pruning. - Edith Cohen; Mayur Datar; Shinji Fujiwara; Aristides Gionis; Piotr Indyk; Rajeev Motwani 001; Jeffrey D. Ullman; Cheng Yang (IEEE Trans. Knowl. Data Eng., 2001)

Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (2. Aufl.). - John E. Hopcroft; Rajeev Motwani 001; Jeffrey D. Ullman (Pearson Studium, 2002)

Streaming-Data Algorithms for High-Quality Clustering. - Liadan O'Callaghan; Adam Meyerson; Rajeev Motwani 001; Nina Mishra; Sudipto Guha (ICDE, 2002)

Models and Issues in Data Stream Systems. - Brian Babcock; Shivnath Babu; Mayur Datar; Rajeev Motwani 001; Jennifer Widom (PODS, 2002)

Sampling from a moving window over streaming data. - Brian Babcock; Mayur Datar; Rajeev Motwani 001 (SODA, 2002)

Maintaining stream statistics over sliding windows (extended abstract). - Mayur Datar; Aristides Gionis; Piotr Indyk; Rajeev Motwani 001 (SODA, 2002)

Web caching with request reordering. - Tomás Feder; Rajeev Motwani 001; Rina Panigrahy; An Zhu (SODA, 2002)

Worst-case time bounds for coloring and satisfiability problems. - Tomás Feder; Rajeev Motwani 001 (J. Algorithms, 2002)

Maintaining Stream Statistics over Sliding Windows. - Mayur Datar; Aristides Gionis; Piotr Indyk; Rajeev Motwani 001 (SIAM J. Comput., 2002)

Approximating the Longest Cycle Problem in Sparse Graphs. - Tomás Feder; Rajeev Motwani 001; Carlos S. Subi (SIAM J. Comput., 2002)

Challenges in web search engines. - Monika Rauch Henzinger; Rajeev Motwani 001; Craig Silverstein (SIGIR Forum, 2002)

Introduction to automata theory, languages, and computation - international edition, 2nd Edition. - John E. Hopcroft; Rajeev Motwani 001; Jeffrey D. Ullman (Addison-Wesley, 2003)

Query Processing, Approximation, and Resource Management in a Data Stream Management System. - Rajeev Motwani 001; Jennifer Widom; Arvind Arasu; Brian Babcock; Shivnath Babu; Mayur Datar; Gurmeet Singh Manku; Chris Olston; Justin Rosenstein; Rohit Varma (CIDR, 2003)

Switch Scheduling via Randomized Edge Coloring. - Gagan Aggarwal; Rajeev Motwani 001; Devavrat Shah; An Zhu (FOCS, 2003)

Maintaining variance and k-medians over data stream windows. - Brian Babcock; Mayur Datar; Rajeev Motwani 001; Liadan O'Callaghan (PODS, 2003)

Chain : Operator Scheduling for Memory Minimization in Data Stream Systems. - Brian Babcock; Shivnath Babu; Mayur Datar; Rajeev Motwani 001 (SIGMOD Conference, 2003)

Robust and Efficient Fuzzy Match for Online Data Cleaning. - Surajit Chaudhuri; Kris Ganjam; Venkatesh Ganti; Rajeev Motwani 001 (SIGMOD Conference, 2003)

Representing Graph Metrics with Fewest Edges. - Tomás Feder; Adam Meyerson; Rajeev Motwani 001; Liadan O'Callaghan; Rina Panigrahy (STACS, 2003)

STREAM: The Stanford Stream Data Manager. - Arvind Arasu; Brian Babcock; Shivnath Babu; Mayur Datar; Keith Ito; Rajeev Motwani 001; Itaru Nishizawa; Utkarsh Srivastava; Dilys Thomas; Rohit Varma; Jennifer Widom (IEEE Data Eng. Bull., 2003)

A combinatorial algorithm for MAX CSP. - Mayur Datar; Tomás Feder; Aristides Gionis; Rajeev Motwani 001; Rina Panigrahy (Inf. Process. Lett., 2003)

Computing the Median with Uncertainty. - Tomás Feder; Rajeev Motwani 001; Rina Panigrahy; Chris Olston; Jennifer Widom (SIAM J. Comput., 2003)

List Partitions. - Tomás Feder; Pavol Hell; Sulamita Klein; Rajeev Motwani 001 (SIAM J. Discret. Math., 2003)

Clustering Data Streams: Theory and Practice. - Sudipto Guha; Adam Meyerson; Nina Mishra; Rajeev Motwani 001; Liadan O'Callaghan (IEEE Trans. Knowl. Data Eng., 2003)

Aggregating Correlated Data in Sensor Networks. - Mihaela Enachescu; Ashish Goel; Ramesh Govindan; Rajeev Motwani 001 (CAAN, 2004)

On Identifying Stable Ways to Configure Systems. - Gagan Aggarwal; Mayur Datar; Nina Mishra; Rajeev Motwani 001 (ICAC, 2004)

Algorithms for Multi-product Pricing. - Gagan Aggarwal; Tomás Feder; Rajeev Motwani 001; An Zhu (ICALP, 2004)

Load Shedding for Aggregation Queries over Data Streams. - Brian Babcock; Mayur Datar; Rajeev Motwani 001 (ICDE, 2004)

Adaptive Ordering of Pipelined Stream Filters. - Shivnath Babu; Rajeev Motwani 001; Kamesh Munagala; Itaru Nishizawa; Jennifer Widom (SIGMOD Conference, 2004)

Caching queues in memory buffers. - Rajeev Motwani 001; Dilys Thomas (SODA, 2004)

Vision Paper: Enabling Privacy for the Paranoids. - Gagan Aggarwal; Mayank Bawa; Prasanna Ganesan; Hector Garcia-Molina; Krishnaram Kenthapadi; Nina Mishra; Rajeev Motwani 001; Utkarsh Srivastava; Dilys Thomas; Jennifer Widom; Ying Xu 002 (VLDB, 2004)

Combinatorial and Experimental Methods for Approximate Point Pattern Matching. - Martin Gavrilov; Piotr Indyk; Rajeev Motwani 001; Suresh Venkatasubramanian (Algorithmica, 2004)

Modeling correlations in web traces and implications for designing replacement policies. - Konstantinos Psounis; An Zhu; Balaji Prabhakar; Rajeev Motwani 001 (Comput. Networks, 2004)

Introduction: Special Issue on Theoretical Advances in Data Clustering. - Nina Mishra; Rajeev Motwani 001 (Mach. Learn., 2004)

Incremental Clustering and Dynamic Information Retrieval. - Moses Charikar; Chandra Chekuri; Tomás Feder; Rajeev Motwani 001 (SIAM J. Comput., 2004)

Combining request scheduling with web caching. - Tomás Feder; Rajeev Motwani 001; Rina Panigrahy; Steven S. Seiden; Rob van Stee; An Zhu (Theor. Comput. Sci., 2004)

Operator scheduling in data stream systems. - Brian Babcock; Shivnath Babu; Mayur Datar; Rajeev Motwani 001; Dilys Thomas (VLDB J., 2004)

Two Can Keep A Secret: A Distributed Architecture for Secure Database Services. - Gagan Aggarwal; Mayank Bawa; Prasanna Ganesan; Hector Garcia-Molina; Krishnaram Kenthapadi; Rajeev Motwani 001; Utkarsh Srivastava; Dilys Thomas; Ying Xu 002 (CIDR, 2005)

Adaptive Caching for Continuous Queries. - Shivnath Babu; Kamesh Munagala; Jennifer Widom; Rajeev Motwani 001 (ICDE, 2005)

Robust Identification of Fuzzy Duplicates. - Surajit Chaudhuri; Venkatesh Ganti; Rajeev Motwani 001 (ICDE, 2005)

Anonymizing Tables. - Gagan Aggarwal; Tomás Feder; Krishnaram Kenthapadi; Rajeev Motwani 001; Rina Panigrahy; Dilys Thomas; An Zhu (ICDT, 2005)

Algorithms for the Database Layout Problem. - Gagan Aggarwal; Tomás Feder; Rajeev Motwani 001; Rina Panigrahy; An Zhu (ICDT, 2005)

The Pipelined Set Cover Problem. - Kamesh Munagala; Shivnath Babu; Rajeev Motwani 001; Jennifer Widom (ICDT, 2005)

Scale-free aggregation in sensor networks. - Mihaela Enachescu; Ashish Goel; Ramesh Govindan; Rajeev Motwani 001 (Theor. Comput. Sci., 2005)

Distinct Values Estimators for Power Law Distributions. - Rajeev Motwani 001; Sergei Vassilvitskii (ANALCO, 2006)

Fractional Matching Via Balls-and-Bins. - Rajeev Motwani 001; Rina Panigrahy; Ying Xu 002 (APPROX-RANDOM, 2006)

Estimating corpus size via queries. - Andrei Z. Broder; Marcus Fontoura; Vanja Josifovski; Ravi Kumar 001; Rajeev Motwani 001; Shubha U. Nabar; Rina Panigrahy; Andrew Tomkins; Ying Xu 002 (CIKM, 2006)

Keyword Generation for Search Engine Advertising. - Amruta Joshi; Rajeev Motwani 001 (ICDM Workshops, 2006)

Evolution of page popularity under random web graph models. - Rajeev Motwani 001; Ying Xu 002 (PODS, 2006)

Truthful auctions for pricing search keywords. - Gagan Aggarwal; Ashish Goel; Rajeev Motwani 001 (EC, 2006)

Towards Robustness in Query Auditing. - Shubha U. Nabar; Bhaskara Marthi; Krishnaram Kenthapadi; Nina Mishra; Rajeev Motwani 001 (VLDB, 2006)

Query Optimization over Web Services. - Utkarsh Srivastava; Kamesh Munagala; Jennifer Widom; Rajeev Motwani 001 (VLDB, 2006)

Channel assignment in wireless networks and classification of minimum graph homomorphism. - Tomás Feder; Gagan Aggarwal; Rajeev Motwani 001; An Zhu (Electron. Colloquium Comput. Complex., 2006)

k-connected spanning subgraphs of low degree. - Tomás Feder; Rajeev Motwani 001; An Zhu (Electron. Colloquium Comput. Complex., 2006)

The load rebalancing problem. - Gagan Aggarwal; Rajeev Motwani 001; An Zhu (J. Algorithms, 2006)

Introduction to automata theory, languages, and computation, 3rd Edition. - John E. Hopcroft; Rajeev Motwani 001; Jeffrey D. Ullman (Addison-Wesley, 2007)

Estimating Sum by Weighted Sampling. - Rajeev Motwani 001; Rina Panigrahy; Ying Xu 002 (ICALP, 2007)

Auditing a Batch of SQL Queries. - Rajeev Motwani 001; Shubha U. Nabar; Dilys Thomas (ICDE Workshops, 2007)

Tracing the Path: New Model and Algorithms for Collaborative Filtering. - Rajeev Motwani 001; Sergei Vassilvitskii (ICDE Workshops, 2007)

Computing shortest paths with uncertainty. - Tomás Feder; Rajeev Motwani 001; Liadan O'Callaghan; Chris Olston; Rina Panigrahy (J. Algorithms, 2007)

The price of validity in dynamic networks. - Mayank Bawa; Aristides Gionis; Hector Garcia-Molina; Rajeev Motwani 001 (J. Comput. Syst. Sci., 2007)

Lower Bounds on Locality Sensitive Hashing. - Rajeev Motwani 001; Assaf Naor; Rina Panigrahy (SIAM J. Discret. Math., 2007)

Querying priced information in databases: The conjunctive case. - Renato Carmo; Tomás Feder; Yoshiharu Kohayakawa; Eduardo Sany Laber; Rajeev Motwani 001; Liadan O'Callaghan; Rina Panigrahy; Dilys Thomas (ACM Trans. Algorithms, 2007)

Asymptotic Polynomial-Time Approximation Schemes. - An Zhu; Rajeev Motwani 001; Liadan O'Callaghan (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Load Shedding in Data Stream Systems. - Brian Babcock; Mayur Datar; Rajeev Motwani 001 (Data Streams - Models and Algorithms, 2007)

The Sliding-Window Computation Model and Results. - Mayur Datar; Rajeev Motwani 001 (Data Streams - Models and Algorithms, 2007)

Link privacy in social networks. - Aleksandra Korolova; Rajeev Motwani 001; Shubha U. Nabar; Ying Xu 002 (CIKM, 2008)

Auditing SQL Queries. - Rajeev Motwani 001; Shubha U. Nabar; Dilys Thomas (ICDE, 2008)

Anonymizing Unstructured Data - Rajeev Motwani 001; Shubha U. Nabar (CoRR, 2008)

A Survey of Query Auditing Techniques for Data Privacy. - Shubha U. Nabar; Krishnaram Kenthapadi; Nina Mishra; Rajeev Motwani 001 (Privacy-Preserving Data Mining, 2008)

Pricing Strategies for Viral Marketing on Social Networks. - David Arthur; Rajeev Motwani 001; Aneesh Sharma; Ying Xu 002 (WINE, 2009)

On the graph turnpike problem. - Tomás Feder; Rajeev Motwani 001 (Inf. Process. Lett., 2009)

A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model. - Bahman Bahmani; Aranyak Mehta; Rajeev Motwani 001 (SODA, 2010)

Finding large cycles in Hamiltonian graphs. - Tomás Feder; Rajeev Motwani 001 (Discret. Appl. Math., 2010)

Approximate Frequency Counts over Data Streams. - Gurmeet Singh Manku; Rajeev Motwani 001 (Proc. VLDB Endow., 2012)

Distributing Data for Secure Database Services. - Vignesh Ganapathy; Dilys Thomas; Tomás Feder; Hector Garcia-Molina; Rajeev Motwani 001 (Trans. Data Priv., 2012)

Online Graph Edge-Coloring in the Random-Order Arrival Model. - Bahman Bahmani; Aranyak Mehta; Rajeev Motwani 001 (Theory Comput., 2012)

Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality. - Sariel Har-Peled; Piotr Indyk; Rajeev Motwani 001 (Theory Comput., 2012)

STREAM: The Stanford Data Stream Management System. - Arvind Arasu; Brian Babcock; Shivnath Babu; John Cieslewicz; Mayur Datar; Keith Ito; Rajeev Motwani 001; Utkarsh Srivastava; Jennifer Widom (Data Stream Management, 2016)

The Sliding-Window Computation Model and Results. - Mayur Datar; Rajeev Motwani 001 (Data Stream Management, 2016)

Asymptotic Polynomial Time Approximation Schemes. - Rajeev Motwani 001; Liadan O'Callaghan; An Zhu (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)