[1] Rajeev Motwani, Liadan O'Callaghan, and An Zhu. Asymptotic polynomial time approximation schemes. In Teofilo F. Gonzalez, editor, Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications, pages 173--187. Chapman and Hall/CRC, 2018. [ bib | DOI | http ]
[2] Mayur Datar and Rajeev Motwani. The sliding-window computation model and results. In Minos N. Garofalakis, Johannes Gehrke, and Rajeev Rastogi, editors, Data Stream Management - Processing High-Speed Data Streams, Data-Centric Systems and Applications, pages 149--165. Springer, 2016. [ bib | DOI | http ]
[3] Arvind Arasu, Brian Babcock, Shivnath Babu, John Cieslewicz, Mayur Datar, Keith Ito, Rajeev Motwani, Utkarsh Srivastava, and Jennifer Widom. STREAM: the stanford data stream management system. In Minos N. Garofalakis, Johannes Gehrke, and Rajeev Rastogi, editors, Data Stream Management - Processing High-Speed Data Streams, Data-Centric Systems and Applications, pages 317--336. Springer, 2016. [ bib | DOI | http ]
[4] Gurmeet Singh Manku and Rajeev Motwani. Approximate frequency counts over data streams. Proc. VLDB Endow., 5(12):1699, 2012. [ bib | DOI | .pdf ]
[5] Vignesh Ganapathy, Dilys Thomas, Tomás Feder, Hector Garcia-Molina, and Rajeev Motwani. Distributing data for secure database services. Trans. Data Priv., 5(1):253--272, 2012. [ bib | http ]
[6] Sariel Har-Peled, Piotr Indyk, and Rajeev Motwani. Approximate nearest neighbor: Towards removing the curse of dimensionality. Theory Comput., 8(1):321--350, 2012. [ bib | DOI | http ]
[7] Bahman Bahmani, Aranyak Mehta, and Rajeev Motwani. Online graph edge-coloring in the random-order arrival model. Theory Comput., 8(1):567--595, 2012. [ bib | DOI | http ]
[8] Vignesh Ganapathy, Dilys Thomas, Tomás Feder, Hector Garcia-Molina, and Rajeev Motwani. Distributing data for secure database services. In Traian Marius Truta, Li Xiong, Farshad Fotouhi, Kjell Orsborn, and Silvia Stefanova, editors, Proceedings of the 2011 International Workshop on Privacy and Anonymity in Information Society, PAIS 2011, Uppsala, Sweden, March 2011, page 8. ACM, 2011. [ bib | DOI | http ]
[9] Tomás Feder and Rajeev Motwani. Finding large cycles in hamiltonian graphs. Discret. Appl. Math., 158(8):882--893, 2010. [ bib | DOI | http ]
[10] Bahman Bahmani, Aranyak Mehta, and Rajeev Motwani. A 1.43-competitive online graph edge coloring algorithm in the random order arrival model. In Moses Charikar, editor, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, pages 31--39. SIAM, 2010. [ bib | DOI | http ]
[11] Tomás Feder and Rajeev Motwani. On the graph turnpike problem. Inf. Process. Lett., 109(14):774--776, 2009. [ bib | DOI | http ]
[12] David Arthur, Rajeev Motwani, Aneesh Sharma, and Ying Xu. Pricing strategies for viral marketing on social networks. In Stefano Leonardi, editor, Internet and Network Economics, 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings, volume 5929 of Lecture Notes in Computer Science, pages 101--112. Springer, 2009. [ bib | DOI | http ]
[13] David Arthur, Rajeev Motwani, Aneesh Sharma, and Ying Xu. Pricing strategies for viral marketing on social networks. CoRR, abs/0902.3485, 2009. [ bib | arXiv | http ]
[14] Aleksandra Korolova, Rajeev Motwani, Shubha U. Nabar, and Ying Xu. Link privacy in social networks. In James G. Shanahan, Sihem Amer-Yahia, Ioana Manolescu, Yi Zhang, David A. Evans, Aleksander Kolcz, Key-Sun Choi, and Abdur Chowdhury, editors, Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008, pages 289--298. ACM, 2008. [ bib | DOI | http ]
[15] Rajeev Motwani, Shubha U. Nabar, and Dilys Thomas. Auditing SQL queries. In Gustavo Alonso, José A. Blakeley, and Arbee L. P. Chen, editors, Proceedings of the 24th International Conference on Data Engineering, ICDE 2008, April 7-12, 2008, Cancún, Mexico, pages 287--296. IEEE Computer Society, 2008. [ bib | DOI | http ]
[16] Aleksandra Korolova, Rajeev Motwani, Shubha U. Nabar, and Ying Xu. Link privacy in social networks. In Gustavo Alonso, José A. Blakeley, and Arbee L. P. Chen, editors, Proceedings of the 24th International Conference on Data Engineering, ICDE 2008, April 7-12, 2008, Cancún, Mexico, pages 1355--1357. IEEE Computer Society, 2008. [ bib | DOI | http ]
[17] Shubha U. Nabar, Krishnaram Kenthapadi, Nina Mishra, and Rajeev Motwani. A survey of query auditing techniques for data privacy. In Charu C. Aggarwal and Philip S. Yu, editors, Privacy-Preserving Data Mining - Models and Algorithms, volume 34 of Advances in Database Systems, pages 415--431. Springer, 2008. [ bib | DOI | http ]
[18] Hillol Kargupta, Jiawei Han, Philip S. Yu, Rajeev Motwani, and Vipin Kumar, editors. Next Generation of Data Mining. Chapman and Hall / CRC Data Mining and Knowledge Discovery Series. CRC Press / Chapman and Hall / Taylor & Francis, 2008. [ bib | DOI | http ]
[19] Rajeev Motwani and Shubha U. Nabar. Anonymizing unstructured data. CoRR, abs/0810.5582, 2008. [ bib | arXiv | http ]
[20] John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to automata theory, languages, and computation, 3rd Edition. Pearson international edition. Addison-Wesley, 2007. [ bib ]
[21] Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, and Rina Panigrahy. Computing shortest paths with uncertainty. J. Algorithms, 62(1):1--18, 2007. [ bib | DOI | http ]
[22] Mayank Bawa, Aristides Gionis, Hector Garcia-Molina, and Rajeev Motwani. The price of validity in dynamic networks. J. Comput. Syst. Sci., 73(3):245--264, 2007. [ bib | DOI | http ]
[23] Rajeev Motwani, Assaf Naor, and Rina Panigrahy. Lower bounds on locality sensitive hashing. SIAM J. Discret. Math., 21(4):930--935, 2007. [ bib | DOI | http ]
[24] Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, and Dilys Thomas. Querying priced information in databases: The conjunctive case. ACM Trans. Algorithms, 3(1):9:1--9:22, 2007. [ bib | DOI | http ]
[25] Rajeev Motwani, Rina Panigrahy, and Ying Xu. Estimating sum by weighted sampling. In Lars Arge, Christian Cachin, Tomasz Jurdzinski, and Andrzej Tarlecki, editors, Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, volume 4596 of Lecture Notes in Computer Science, pages 53--64. Springer, 2007. [ bib | DOI | http ]
[26] Rajeev Motwani, Shubha U. Nabar, and Dilys Thomas. Auditing a batch of SQL queries. In Proceedings of the 23rd International Conference on Data Engineering Workshops, ICDE 2007, 15-20 April 2007, Istanbul, Turkey, pages 186--191. IEEE Computer Society, 2007. [ bib | DOI | http ]
[27] Rajeev Motwani and Sergei Vassilvitskii. Tracing the path: New model and algorithms for collaborative filtering. In Proceedings of the 23rd International Conference on Data Engineering Workshops, ICDE 2007, 15-20 April 2007, Istanbul, Turkey, pages 853--862. IEEE Computer Society, 2007. [ bib | DOI | http ]
[28] Brian Babcock, Mayur Datar, and Rajeev Motwani. Load shedding in data stream systems. In Charu C. Aggarwal, editor, Data Streams - Models and Algorithms, volume 31 of Advances in Database Systems, pages 127--147. Springer, 2007. [ bib | DOI | http ]
[29] Mayur Datar and Rajeev Motwani. The sliding-window computation model and results. In Charu C. Aggarwal, editor, Data Streams - Models and Algorithms, volume 31 of Advances in Database Systems, pages 149--167. Springer, 2007. [ bib | DOI | http ]
[30] An Zhu, Rajeev Motwani, and Liadan O'Callaghan. Asymptotic polynomial-time approximation schemes. In Teofilo F. Gonzalez, editor, Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall/CRC, 2007. [ bib | DOI | http ]
[31] Gagan Aggarwal, Rajeev Motwani, and An Zhu. The load rebalancing problem. J. Algorithms, 60(1):42--59, 2006. [ bib | DOI | http ]
[32] Rajeev Motwani and Sergei Vassilvitskii. Distinct values estimators for power law distributions. In Daniel Panario and Robert Sedgewick, editors, Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2006, Miami, Florida, USA, January 21, 2006, pages 230--237. SIAM, 2006. [ bib | DOI | http ]
[33] Rajeev Motwani, Rina Panigrahy, and Ying Xu. Fractional matching via balls-and-bins. In Josep Díaz, Klaus Jansen, José D. P. Rolim, and Uri Zwick, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, volume 4110 of Lecture Notes in Computer Science, pages 487--498. Springer, 2006. [ bib | DOI | http ]
[34] Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Rajeev Motwani, Shubha U. Nabar, Rina Panigrahy, Andrew Tomkins, and Ying Xu. Estimating corpus size via queries. In Philip S. Yu, Vassilis J. Tsotras, Edward A. Fox, and Bing Liu, editors, Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, Arlington, Virginia, USA, November 6-11, 2006, pages 594--603. ACM, 2006. [ bib | DOI | http ]
[35] Rajeev Motwani, Assaf Naor, and Rina Panigrahy. Lower bounds on locality sensitive hashing. In Nina Amenta and Otfried Cheong, editors, Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pages 154--157. ACM, 2006. [ bib | DOI | http ]
[36] Amruta Joshi and Rajeev Motwani. Keyword generation for search engine advertising. In Workshops Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 18-22 December 2006, Hong Kong, China, pages 490--496. IEEE Computer Society, 2006. [ bib | DOI | http ]
[37] Rajeev Motwani and Ying Xu. Evolution of page popularity under random web graph models. In Stijn Vansummeren, editor, Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA, pages 134--142. ACM, 2006. [ bib | DOI | http ]
[38] Gagan Aggarwal, Ashish Goel, and Rajeev Motwani. Truthful auctions for pricing search keywords. In Joan Feigenbaum, John C.-I. Chuang, and David M. Pennock, editors, Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), Ann Arbor, Michigan, USA, June 11-15, 2006, pages 1--7. ACM, 2006. [ bib | DOI | http ]
[39] Shubha U. Nabar, Bhaskara Marthi, Krishnaram Kenthapadi, Nina Mishra, and Rajeev Motwani. Towards robustness in query auditing. In Umeshwar Dayal, Kyu-Young Whang, David B. Lomet, Gustavo Alonso, Guy M. Lohman, Martin L. Kersten, Sang Kyun Cha, and Young-Kuk Kim, editors, Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, September 12-15, 2006, pages 151--162. ACM, 2006. [ bib | http ]
[40] Utkarsh Srivastava, Kamesh Munagala, Jennifer Widom, and Rajeev Motwani. Query optimization over web services. In Umeshwar Dayal, Kyu-Young Whang, David B. Lomet, Gustavo Alonso, Guy M. Lohman, Martin L. Kersten, Sang Kyun Cha, and Young-Kuk Kim, editors, Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, September 12-15, 2006, pages 355--366. ACM, 2006. [ bib | http ]
[41] Tomás Feder, Gagan Aggarwal, Rajeev Motwani, and An Zhu. Channel assignment in wireless networks and classification of minimum graph homomorphism. Electron. Colloquium Comput. Complex., (040), 2006. [ bib | .html ]
[42] Tomás Feder, Rajeev Motwani, and An Zhu. k-connected spanning subgraphs of low degree. Electron. Colloquium Comput. Complex., (041), 2006. [ bib | .html ]
[43] Tomás Feder and Rajeev Motwani. Finding large cycles in hamiltonian graphs. Electron. Colloquium Comput. Complex., (156), 2006. [ bib | .html ]
[44] Mihaela Enachescu, Ashish Goel, Ramesh Govindan, and Rajeev Motwani. Scale-free aggregation in sensor networks. Theor. Comput. Sci., 344(1):15--29, 2005. [ bib | DOI | http ]
[45] Gagan Aggarwal, Mayank Bawa, Prasanna Ganesan, Hector Garcia-Molina, Krishnaram Kenthapadi, Rajeev Motwani, Utkarsh Srivastava, Dilys Thomas, and Ying Xu. Two can keep A secret: A distributed architecture for secure database services. In Second Biennial Conference on Innovative Data Systems Research, CIDR 2005, Asilomar, CA, USA, January 4-7, 2005, Online Proceedings, pages 186--199. www.cidrdb.org, 2005. [ bib | .pdf ]
[46] Shivnath Babu, Kamesh Munagala, Jennifer Widom, and Rajeev Motwani. Adaptive caching for continuous queries. In Karl Aberer, Michael J. Franklin, and Shojiro Nishio, editors, Proceedings of the 21st International Conference on Data Engineering, ICDE 2005, 5-8 April 2005, Tokyo, Japan, pages 118--129. IEEE Computer Society, 2005. [ bib | DOI | http ]
[47] Surajit Chaudhuri, Venkatesh Ganti, and Rajeev Motwani. Robust identification of fuzzy duplicates. In Karl Aberer, Michael J. Franklin, and Shojiro Nishio, editors, Proceedings of the 21st International Conference on Data Engineering, ICDE 2005, 5-8 April 2005, Tokyo, Japan, pages 865--876. IEEE Computer Society, 2005. [ bib | DOI | http ]
[48] Kamesh Munagala, Shivnath Babu, Rajeev Motwani, and Jennifer Widom. The pipelined set cover problem. In Thomas Eiter and Leonid Libkin, editors, Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, Proceedings, volume 3363 of Lecture Notes in Computer Science, pages 83--98. Springer, 2005. [ bib | DOI | http ]
[49] Gagan Aggarwal, Tomás Feder, Rajeev Motwani, Rina Panigrahy, and An Zhu. Algorithms for the database layout problem. In Thomas Eiter and Leonid Libkin, editors, Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, Proceedings, volume 3363 of Lecture Notes in Computer Science, pages 189--203. Springer, 2005. [ bib | DOI | http ]
[50] Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, and An Zhu. Anonymizing tables. In Thomas Eiter and Leonid Libkin, editors, Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, Proceedings, volume 3363 of Lecture Notes in Computer Science, pages 246--258. Springer, 2005. [ bib | DOI | http ]
[51] Tomás Feder and Rajeev Motwani. Finding large cycles in hamiltonian graphs. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pages 166--175. SIAM, 2005. [ bib | http ]
[52] Rajeev Motwani, Assaf Naor, and Rina Panigrahy. Lower bounds on locality sensitive hashing. CoRR, abs/cs/0510088, 2005. [ bib | arXiv | http ]
[53] Martin Gavrilov, Piotr Indyk, Rajeev Motwani, and Suresh Venkatasubramanian. Combinatorial and experimental methods for approximate point pattern matching. Algorithmica, 38(1):59--90, 2004. [ bib | DOI | http ]
[54] Konstantinos Psounis, An Zhu, Balaji Prabhakar, and Rajeev Motwani. Modeling correlations in web traces and implications for designing replacement policies. Comput. Networks, 45(4):379--398, 2004. [ bib | DOI | http ]
[55] Nina Mishra and Rajeev Motwani. Introduction: Special issue on theoretical advances in data clustering. Mach. Learn., 56(1-3):5--7, 2004. [ bib | DOI | http ]
[56] Moses Charikar, Chandra Chekuri, Tomás Feder, and Rajeev Motwani. Incremental clustering and dynamic information retrieval. SIAM J. Comput., 33(6):1417--1440, 2004. [ bib | DOI | http ]
[57] Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, and An Zhu. Combining request scheduling with web caching. Theor. Comput. Sci., 324(2-3):201--218, 2004. [ bib | DOI | http ]
[58] Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev Motwani, and Dilys Thomas. Operator scheduling in data stream systems. VLDB J., 13(4):333--353, 2004. [ bib | DOI | http ]
[59] Mihaela Enachescu, Ashish Goel, Ramesh Govindan, and Rajeev Motwani. Scale free aggregation in sensor networks. In Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, ALGOSENSORS 2004, Turku, Finland, July 16, 2004. Proceedings, volume 3121 of Lecture Notes in Computer Science, pages 71--84. Springer, 2004. [ bib | DOI | http ]
[60] Mihaela Enachescu, Ashish Goel, Ramesh Govindan, and Rajeev Motwani. Aggregating correlated data in sensor networks. In Alejandro López-Ortiz and Angèle M. Hamel, editors, Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers, volume 3405 of Lecture Notes in Computer Science, pages 1--2. Springer, 2004. [ bib | DOI | http ]
[61] Gagan Aggarwal, Mayur Datar, Nina Mishra, and Rajeev Motwani. On identifying stable ways to configure systems. In 1st International Conference on Autonomic Computing (ICAC 2004), 17-19 May 2004, New York, NY, USA, pages 148--153. IEEE Computer Society, 2004. [ bib | DOI | http ]
[62] Gagan Aggarwal, Tomás Feder, Rajeev Motwani, and An Zhu. Algorithms for multi-product pricing. In Josep Díaz, Juhani Karhumäki, Arto Lepistö, and Donald Sannella, editors, Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, volume 3142 of Lecture Notes in Computer Science, pages 72--83. Springer, 2004. [ bib | DOI | http ]
[63] Brian Babcock, Mayur Datar, and Rajeev Motwani. Load shedding for aggregation queries over data streams. In Z. Meral Özsoyoglu and Stanley B. Zdonik, editors, Proceedings of the 20th International Conference on Data Engineering, ICDE 2004, 30 March - 2 April 2004, Boston, MA, USA, pages 350--361. IEEE Computer Society, 2004. [ bib | DOI | http ]
[64] Shivnath Babu, Rajeev Motwani, Kamesh Munagala, Itaru Nishizawa, and Jennifer Widom. Adaptive ordering of pipelined stream filters. In Gerhard Weikum, Arnd Christian König, and Stefan Deßloch, editors, Proceedings of the ACM SIGMOD International Conference on Management of Data, Paris, France, June 13-18, 2004, pages 407--418. ACM, 2004. [ bib | DOI | http ]
[65] Mayank Bawa, Aristides Gionis, Hector Garcia-Molina, and Rajeev Motwani. The price of validity in dynamic networks. In Gerhard Weikum, Arnd Christian König, and Stefan Deßloch, editors, Proceedings of the ACM SIGMOD International Conference on Management of Data, Paris, France, June 13-18, 2004, pages 515--526. ACM, 2004. [ bib | DOI | http ]
[66] Rajeev Motwani and Dilys Thomas. Caching queues in memory buffers. In J. Ian Munro, editor, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pages 541--549. SIAM, 2004. [ bib | http ]
[67] Gagan Aggarwal, Mayank Bawa, Prasanna Ganesan, Hector Garcia-Molina, Krishnaram Kenthapadi, Nina Mishra, Rajeev Motwani, Utkarsh Srivastava, Dilys Thomas, Jennifer Widom, and Ying Xu. Vision paper: Enabling privacy for the paranoids. In Mario A. Nascimento, M. Tamer Özsu, Donald Kossmann, Renée J. Miller, José A. Blakeley, and K. Bernhard Schiefer, editors, (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, August 31 - September 3 2004, pages 708--719. Morgan Kaufmann, 2004. [ bib | DOI | .PDF ]
[68] John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to automata theory, languages, and computation - international edition, 2nd Edition. Addison-Wesley, 2003. [ bib ]
[69] Arvind Arasu, Brian Babcock, Shivnath Babu, Mayur Datar, Keith Ito, Rajeev Motwani, Itaru Nishizawa, Utkarsh Srivastava, Dilys Thomas, Rohit Varma, and Jennifer Widom. STREAM: the stanford stream data manager. IEEE Data Eng. Bull., 26(1):19--26, 2003. [ bib | .ps ]
[70] Mayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani, and Rina Panigrahy. A combinatorial algorithm for MAX CSP. Inf. Process. Lett., 85(6):307--315, 2003. [ bib | DOI | http ]
[71] Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, and Jennifer Widom. Computing the median with uncertainty. SIAM J. Comput., 32(2):538--547, 2003. [ bib | DOI | http ]
[72] Tomás Feder, Pavol Hell, Sulamita Klein, and Rajeev Motwani. List partitions. SIAM J. Discret. Math., 16(3):449--478, 2003. [ bib | DOI | http ]
[73] Sudipto Guha, Adam Meyerson, Nina Mishra, Rajeev Motwani, and Liadan O'Callaghan. Clustering data streams: Theory and practice. IEEE Trans. Knowl. Data Eng., 15(3):515--528, 2003. [ bib | DOI | http ]
[74] Rajeev Motwani, Jennifer Widom, Arvind Arasu, Brian Babcock, Shivnath Babu, Mayur Datar, Gurmeet Singh Manku, Chris Olston, Justin Rosenstein, and Rohit Varma. Query processing, approximation, and resource management in a data stream management system. In First Biennial Conference on Innovative Data Systems Research, CIDR 2003, Asilomar, CA, USA, January 5-8, 2003, Online Proceedings. www.cidrdb.org, 2003. [ bib | .pdf ]
[75] Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, and An Zhu. Switch scheduling via randomized edge coloring. In 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pages 502--512. IEEE Computer Society, 2003. [ bib | DOI | http ]
[76] Monika Rauch Henzinger, Rajeev Motwani, and Craig Silverstein. Challenges in web search engines. In Georg Gottlob and Toby Walsh, editors, IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9-15, 2003, pages 1573--1579. Morgan Kaufmann, 2003. [ bib | .pdf ]
[77] Brian Babcock, Mayur Datar, Rajeev Motwani, and Liadan O'Callaghan. Maintaining variance and k-medians over data stream windows. In Frank Neven, Catriel Beeri, and Tova Milo, editors, Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA, pages 234--243. ACM, 2003. [ bib | DOI | http ]
[78] Brian Babcock, Shivnath Babu, Mayur Datar, and Rajeev Motwani. Chain : Operator scheduling for memory minimization in data stream systems. In Alon Y. Halevy, Zachary G. Ives, and AnHai Doan, editors, Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, San Diego, California, USA, June 9-12, 2003, pages 253--264. ACM, 2003. [ bib | DOI | http ]
[79] Surajit Chaudhuri, Kris Ganjam, Venkatesh Ganti, and Rajeev Motwani. Robust and efficient fuzzy match for online data cleaning. In Alon Y. Halevy, Zachary G. Ives, and AnHai Doan, editors, Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, San Diego, California, USA, June 9-12, 2003, pages 313--324. ACM, 2003. [ bib | DOI | http ]
[80] Gagan Aggarwal, Rajeev Motwani, and An Zhu. The load rebalancing problem. In Arnold L. Rosenberg and Friedhelm Meyer auf der Heide, editors, SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pages 258--265. ACM, 2003. [ bib | DOI | http ]
[81] Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, and Rina Panigrahy. Representing graph metrics with fewest edges. In Helmut Alt and Michel Habib, editors, STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, volume 2607 of Lecture Notes in Computer Science, pages 355--366. Springer, 2003. [ bib | DOI | http ]
[82] Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, and Rina Panigrahy. Computing shortest paths with uncertainty. In Helmut Alt and Michel Habib, editors, STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, volume 2607 of Lecture Notes in Computer Science, pages 367--378. Springer, 2003. [ bib | DOI | http ]
[83] John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (2. Aufl.). Pearson Studium, 2002. [ bib ]
[84] Tomás Feder and Rajeev Motwani. Worst-case time bounds for coloring and satisfiability problems. J. Algorithms, 45(2):192--201, 2002. [ bib | DOI | http ]
[85] Tomás Feder, Rajeev Motwani, and Carlos S. Subi. Approximating the longest cycle problem in sparse graphs. SIAM J. Comput., 31(5):1596--1607, 2002. [ bib | DOI | http ]
[86] Mayur Datar, Aristides Gionis, Piotr Indyk, and Rajeev Motwani. Maintaining stream statistics over sliding windows. SIAM J. Comput., 31(6):1794--1813, 2002. [ bib | DOI | http ]
[87] Monika Rauch Henzinger, Rajeev Motwani, and Craig Silverstein. Challenges in web search engines. SIGIR Forum, 36(2):11--22, 2002. [ bib | DOI | http ]
[88] Liadan O'Callaghan, Adam Meyerson, Rajeev Motwani, Nina Mishra, and Sudipto Guha. Streaming-data algorithms for high-quality clustering. In Rakesh Agrawal and Klaus R. Dittrich, editors, Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26 - March 1, 2002, pages 685--694. IEEE Computer Society, 2002. [ bib | DOI | http ]
[89] Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev Motwani, and Jennifer Widom. Models and issues in data stream systems. In Lucian Popa, Serge Abiteboul, and Phokion G. Kolaitis, editors, Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 3-5, Madison, Wisconsin, USA, pages 1--16. ACM, 2002. [ bib | DOI | http ]
[90] Tomás Feder, Rajeev Motwani, Rina Panigrahy, and An Zhu. Web caching with request reordering. In David Eppstein, editor, Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA, pages 104--105. ACM/SIAM, 2002. [ bib | http ]
[91] Brian Babcock, Mayur Datar, and Rajeev Motwani. Sampling from a moving window over streaming data. In David Eppstein, editor, Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA, pages 633--634. ACM/SIAM, 2002. [ bib | http ]
[92] Mayur Datar, Aristides Gionis, Piotr Indyk, and Rajeev Motwani. Maintaining stream statistics over sliding windows (extended abstract). In David Eppstein, editor, Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA, pages 635--644. ACM/SIAM, 2002. [ bib | http ]
[93] Gurmeet Singh Manku and Rajeev Motwani. Approximate frequency counts over data streams. In Proceedings of 28th International Conference on Very Large Data Bases, VLDB 2002, Hong Kong, August 20-23, 2002, pages 346--357. Morgan Kaufmann, 2002. [ bib | DOI | .pdf ]
[94] Diego Calvanese, Maurizio Lenzerini, and Rajeev Motwani, editors. Database Theory - ICDT 2003, 9th International Conference, Siena, Italy, January 8-10, 2003, Proceedings, volume 2572 of Lecture Notes in Computer Science. Springer, 2002. [ bib | DOI | http ]
[95] Robert L. Grossman, Jiawei Han, Vipin Kumar, Heikki Mannila, and Rajeev Motwani, editors. Proceedings of the Second SIAM International Conference on Data Mining, Arlington, VA, USA, April 11-13, 2002. SIAM, 2002. [ bib | DOI | http ]
[96] John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to automata theory, languages, and computation, 2nd Edition. Addison-Wesley series in computer science. Addison-Wesley-Longman, 2001. [ bib ]
[97] Rajeev Motwani. Guest editor's foreword. J. Comput. Syst. Sci., 63(4):511, 2001. [ bib | DOI | http ]
[98] Chandra Chekuri, Rajeev Motwani, B. Natarajan, and Clifford Stein. Approximation techniques for average completion time scheduling. SIAM J. Comput., 31(1):146--166, 2001. [ bib | DOI | http ]
[99] John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to automata theory, languages, and computation, 2nd edition. SIGACT News, 32(1):60--65, 2001. [ bib | DOI | http ]
[100] Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, and Cheng Yang. Finding interesting associations without support pruning. IEEE Trans. Knowl. Data Eng., 13(1):64--78, 2001. [ bib | DOI | http ]
[101] Ghazi Al-Rawi, John M. Cioffi, Rajeev Motwani, and Mark Horowitz. Optimizing iterative decoding of low-density parity check codes on programmable pipelined parallel architectures. In Proceedings of the Global Telecommunications Conference, 2001. GLOBECOM '01, San Antonio, TX, USA, 25-29 November, 2001, pages 3012--3018. IEEE, 2001. [ bib | DOI | http ]
[102] Surajit Chaudhuri, Gautam Das, Mayur Datar, Rajeev Motwani, and Vivek R. Narasayya. Overcoming limitations of sampling for aggregation queries. In Dimitrios Georgakopoulos and Alexander Buchmann, editors, Proceedings of the 17th International Conference on Data Engineering, April 2-6, 2001, Heidelberg, Germany, pages 534--542. IEEE Computer Society, 2001. [ bib | DOI | http ]
[103] Rajeev Motwani and Prabhakar Raghavan. Guest editors' foreword. Algorithmica, 26(3-4):311--312, 2000. [ bib | DOI | http ]
[104] Craig Silverstein, Sergey Brin, Rajeev Motwani, and Jeffrey D. Ullman. Scalable techniques for mining causal structures. Data Min. Knowl. Discov., 4(2/3):163--192, 2000. [ bib | DOI | http ]
[105] Sudipto Guha, Nina Mishra, Rajeev Motwani, and Liadan O'Callaghan. Clustering data streams. In 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pages 359--366. IEEE Computer Society, 2000. [ bib | DOI | http ]
[106] Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, and Cheng Yang. Finding interesting associations without support pruning. In David B. Lomet and Gerhard Weikum, editors, Proceedings of the 16th International Conference on Data Engineering, San Diego, California, USA, February 28 - March 3, 2000, pages 489--500. IEEE Computer Society, 2000. [ bib | DOI | http ]
[107] Shinji Fujiwara, Jeffrey D. Ullman, and Rajeev Motwani. Dynamic miss-counting algorithms: Finding implication and similarity rules with confidence pruning. In David B. Lomet and Gerhard Weikum, editors, Proceedings of the 16th International Conference on Data Engineering, San Diego, California, USA, February 28 - March 3, 2000, pages 501--511. IEEE Computer Society, 2000. [ bib | DOI | http ]
[108] Martin Gavrilov, Dragomir Anguelov, Piotr Indyk, and Rajeev Motwani. Mining the stock market (extended abstract): which measure is best? In Raghu Ramakrishnan, Salvatore J. Stolfo, Roberto J. Bayardo, and Ismail Parsa, editors, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, Boston, MA, USA, August 20-23, 2000, pages 487--496. ACM, 2000. [ bib | DOI | http ]
[109] Moses Charikar, Surajit Chaudhuri, Rajeev Motwani, and Vivek R. Narasayya. Towards estimation error guarantees for distinct values. In Victor Vianu and Georg Gottlob, editors, Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, May 15-17, 2000, Dallas, Texas, USA, pages 268--279. ACM, 2000. [ bib | DOI | http ]
[110] Donald Aingworth, Rajeev Motwani, and Jeffrey D. Oldham. Accurate approximations for asian options. In David B. Shmoys, editor, Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA, pages 891--900. ACM/SIAM, 2000. [ bib | http ]
[111] Rajeev Motwani, Rina Panigrahy, Vijay A. Saraswat, and Suresh Venkatasubramanian. On the decidability of accessibility problems (extended abstract). In F. Frances Yao and Eugene M. Luks, editors, Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, pages 306--315. ACM, 2000. [ bib | DOI | http ]
[112] Tomás Feder, Rajeev Motwani, and Carlos S. Subi. Finding long paths and cycles in sparse hamiltonian graphs. In F. Frances Yao and Eugene M. Luks, editors, Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, pages 524--529. ACM, 2000. [ bib | DOI | http ]
[113] Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, and Jennifer Widom. Computing the median with uncertainty. In F. Frances Yao and Eugene M. Luks, editors, Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, pages 602--607. ACM, 2000. [ bib | DOI | http ]
[114] Chandra Chekuri and Rajeev Motwani. Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discret. Appl. Math., 98(1-2):29--38, 1999. [ bib | DOI | http ]
[115] Surajit Chaudhuri and Rajeev Motwani. On sampling and relational operators. IEEE Data Eng. Bull., 22(4):41--46, 1999. [ bib | .ps ]
[116] Michael H. Goldwasser and Rajeev Motwani. Complexity measures for assembly sequences. Int. J. Comput. Geom. Appl., 9(4/5):371--418, 1999. [ bib | DOI | http ]
[117] Leonidas J. Guibas, Jean-Claude Latombe, Steven M. LaValle, David Lin, and Rajeev Motwani. A visibility-based pursuit-evasion problem. Int. J. Comput. Geom. Appl., 9(4/5):471--494, 1999. [ bib | DOI | http ]
[118] David Hsu, Jean-Claude Latombe, and Rajeev Motwani. Path planning in expansive configuration spaces. Int. J. Comput. Geom. Appl., 9(4/5):495--512, 1999. [ bib | DOI | http ]
[119] Donald Aingworth, Chandra Chekuri, Piotr Indyk, and Rajeev Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput., 28(4):1167--1181, 1999. [ bib | DOI | http ]
[120] Prasad Chalasani and Rajeev Motwani. Approximating capacitated routing and delivery problems. SIAM J. Comput., 28(6):2133--2149, 1999. [ bib | DOI | http ]
[121] Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, and Baruch Schieber. The angular-metric traveling salesman problem. SIAM J. Comput., 29(3):697--711, 1999. [ bib | DOI | http ]
[122] Martin Gavrilov, Piotr Indyk, Rajeev Motwani, and Suresh Venkatasubramanian. Geometric pattern matching: A performance study. In Victor Milenkovic, editor, Proceedings of the Fifteenth Annual Symposium on Computational Geometry, Miami Beach, Florida, USA, June 13-16, 1999, pages 79--85. ACM, 1999. [ bib | DOI | http ]
[123] Surajit Chaudhuri, Rajeev Motwani, and Vivek R. Narasayya. On random sampling over joins. In Alex Delis, Christos Faloutsos, and Shahram Ghandeharizadeh, editors, SIGMOD 1999, Proceedings ACM SIGMOD International Conference on Management of Data, June 1-3, 1999, Philadelphia, Pennsylvania, USA, pages 263--274. ACM Press, 1999. [ bib | DOI | http ]
[124] Piotr Indyk, Rajeev Motwani, and Suresh Venkatasubramanian. Geometric matching under noise: Combinatorial bounds and algorithms. In Robert Endre Tarjan and Tandy J. Warnow, editors, Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, USA, pages 457--465. ACM/SIAM, 1999. [ bib | http ]
[125] Chandra Chekuri and Rajeev Motwani. Minimizing weighted completion time on a single machine. In Robert Endre Tarjan and Tandy J. Warnow, editors, Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, USA, pages 873--874. ACM/SIAM, 1999. [ bib | http ]
[126] Tomás Feder, Pavol Hell, Sulamita Klein, and Rajeev Motwani. Complexity of graph partition problems. In Jeffrey Scott Vitter, Lawrence L. Larmore, and Frank Thomson Leighton, editors, Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, USA, pages 464--472. ACM, 1999. [ bib | DOI | http ]
[127] Aristides Gionis, Piotr Indyk, and Rajeev Motwani. Similarity search in high dimensions via hashing. In Malcolm P. Atkinson, Maria E. Orlowska, Patrick Valduriez, Stanley B. Zdonik, and Michael L. Brodie, editors, VLDB'99, Proceedings of 25th International Conference on Very Large Data Bases, September 7-10, 1999, Edinburgh, Scotland, UK, pages 518--529. Morgan Kaufmann, 1999. [ bib | .pdf ]
[128] Rajeev Motwani and Prabhakar Raghavan. Randomized algorithms. In Mikhail J. Atallah, editor, Algorithms and Theory of Computation Handbook, Chapman & Hall/CRC Applied Algorithms and Data Structures series. CRC Press, 1999. [ bib | DOI | http ]
[129] Sanjeev Khanna, Rajeev Motwani, and Randall H. Wilson. On certificates and lookahead in dynamic graph problems. Algorithmica, 21(4):377--394, 1998. [ bib | DOI | http ]
[130] Yossi Azar, Rajeev Motwani, and Joseph Naor. Approximating probability distributions using small sample spaces. Comb., 18(2):151--171, 1998. [ bib | DOI | http ]
[131] Paul W. Finn, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Christian R. Shelton, Suresh Venkatasubramanian, and Andrew Chi-Chih Yao. RAPID: randomized pharmacophore identification for drug design. Comput. Geom., 10(4):263--272, 1998. [ bib | DOI | http ]
[132] Craig Silverstein, Sergey Brin, and Rajeev Motwani. Beyond market baskets: Generalizing association rules to dependence rules. Data Min. Knowl. Discov., 2(1):39--68, 1998. [ bib | DOI | http ]
[133] Sergey Brin, Rajeev Motwani, Lawrence Page, and Terry Winograd. What can you do with a web in your pocket? IEEE Data Eng. Bull., 21(2):37--47, 1998. [ bib | .ps ]
[134] Rajeev Motwani, Vijay A. Saraswat, and Eric Torng. Online scheduling with lookahead: Multipass assembly lines. INFORMS J. Comput., 10(3):331--340, 1998. [ bib | DOI | http ]
[135] David R. Karger, Rajeev Motwani, and Madhu Sudan. Approximate graph coloring by semidefinite programming. J. ACM, 45(2):246--265, 1998. [ bib | DOI | http ]
[136] Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501--555, 1998. [ bib | DOI | http ]
[137] Rajeev Motwani. Realization of matrices and directed graphs. J. Algorithms, 27(1):61--74, 1998. [ bib | DOI | http ]
[138] Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, and Prabhakar Raghavan. Randomized query processing in robot path planning. J. Comput. Syst. Sci., 57(1):50--66, 1998. [ bib | DOI | http ]
[139] Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, and Umesh V. Vazirani. On syntactic versus computational views of approximability. SIAM J. Comput., 28(1):164--191, 1998. [ bib | DOI | http ]
[140] David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, and Rajeev Motwani. Capturing the connectivity of high-dimensional geometric spaces by parallelizable random sampling techniques. In José D. P. Rolim, editor, Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30 - April 3, 1998, Proceedings, volume 1388 of Lecture Notes in Computer Science, pages 330--340. Springer, 1998. [ bib | DOI | http ]
[141] Shalom Tsur, Jeffrey D. Ullman, Serge Abiteboul, Chris Clifton, Rajeev Motwani, Svetlozar Nestorov, and Arnon Rosenthal. Query flocks: A generalization of association-rule mining. In Laura M. Haas and Ashutosh Tiwary, editors, SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, June 2-4, 1998, Seattle, Washington, USA, pages 1--12. ACM Press, 1998. [ bib | DOI | http ]
[142] Svetlozar Nestorov, Serge Abiteboul, and Rajeev Motwani. Extracting schema from semistructured data. In Laura M. Haas and Ashutosh Tiwary, editors, SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, June 2-4, 1998, Seattle, Washington, USA, pages 295--306. ACM Press, 1998. [ bib | DOI | http ]
[143] Surajit Chaudhuri, Rajeev Motwani, and Vivek R. Narasayya. Random sampling for histogram construction: How much is enough? In Laura M. Haas and Ashutosh Tiwary, editors, SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, June 2-4, 1998, Seattle, Washington, USA, pages 436--447. ACM Press, 1998. [ bib | DOI | http ]
[144] Moses Charikar, Dan Halperin, and Rajeev Motwani. The dynamic servers problem. In Howard J. Karloff, editor, Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25-27 January 1998, San Francisco, California, USA, pages 410--419. ACM/SIAM, 1998. [ bib | http ]
[145] Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Jeffrey Scott Vitter, editor, Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998, pages 604--613. ACM, 1998. [ bib | DOI | http ]
[146] Min Fang, Narayanan Shivakumar, Hector Garcia-Molina, Rajeev Motwani, and Jeffrey D. Ullman. Computing iceberg queries efficiently. In Ashish Gupta, Oded Shmueli, and Jennifer Widom, editors, VLDB'98, Proceedings of 24rd International Conference on Very Large Data Bases, August 24-27, 1998, New York City, New York, USA, pages 299--310. Morgan Kaufmann, 1998. [ bib | .pdf ]
[147] Craig Silverstein, Sergey Brin, Rajeev Motwani, and Jeffrey D. Ullman. Scalable techniques for mining causal structures. In Ashish Gupta, Oded Shmueli, and Jennifer Widom, editors, VLDB'98, Proceedings of 24rd International Conference on Very Large Data Bases, August 24-27, 1998, New York City, New York, USA, pages 594--605. Morgan Kaufmann, 1998. [ bib | .pdf ]
[148] David R. Karger, Rajeev Motwani, and Madhu Sudan. Approximate graph coloring by semidefinite programming. CoRR, cs.DS/9812008, 1998. [ bib | http ]
[149] Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and the hardness of approximation problems. Electron. Colloquium Comput. Complex., (8), 1998. [ bib | .html ]
[150] David R. Karger, Rajeev Motwani, and G. D. S. Ramkumar. On approximating the longest path in a graph. Algorithmica, 18(1):82--98, 1997. [ bib | DOI | http ]
[151] Jérôme Barraquand, Lydia E. Kavraki, Jean-Claude Latombe, Tsai-Yen Li, Rajeev Motwani, and Prabhakar Raghavan. A random sampling scheme for path planning. Int. J. Robotics Res., 16(6):759--774, 1997. [ bib | DOI | http ]
[152] David R. Karger and Rajeev Motwani. An NC algorithm for minimum cuts. SIAM J. Comput., 26(1):255--272, 1997. [ bib | DOI | http ]
[153] Leonidas J. Guibas, Rajeev Motwani, and Prabhakar Raghavan. The robot localization problem. SIAM J. Comput., 26(4):1120--1138, 1997. [ bib | DOI | http ]
[154] Svetlozar Nestorov, Serge Abiteboul, and Rajeev Motwani. Infering structure in semistructured data. SIGMOD Rec., 26(4):39--43, 1997. [ bib | DOI | http ]
[155] Paul W. Finn, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Christian R. Shelton, Suresh Venkatasubramanian, and Andrew Chi-Chih Yao. RAPID: randomized pharmacophore identification for drug design. In Jean-Daniel Boissonnat, editor, Proceedings of the Thirteenth Annual Symposium on Computational Geometry, Nice, France, June 4-6, 1997, pages 324--333. ACM, 1997. [ bib | DOI | http ]
[156] Jon M. Kleinberg, Rajeev Motwani, Prabhakar Raghavan, and Suresh Venkatasubramanian. Storage management for evolving databases. In 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pages 353--362. IEEE Computer Society, 1997. [ bib | DOI | http ]
[157] Steven M. LaValle, David Lin, Leonidas J. Guibas, Jean-Claude Latombe, and Rajeev Motwani. Finding an unpredictable target in a workspace with obstacles. In Proceedings of the 1997 IEEE International Conference on Robotics and Automation, Albuquerque, New Mexico, USA, April 20-25, 1997, pages 737--742. IEEE, 1997. [ bib | DOI | http ]
[158] David Hsu, Jean-Claude Latombe, and Rajeev Motwani. Path planning in expansive configuration spaces. In Proceedings of the 1997 IEEE International Conference on Robotics and Automation, Albuquerque, New Mexico, USA, April 20-25, 1997, pages 2719--2726. IEEE, 1997. [ bib | DOI | http ]
[159] Pankaj K. Agarwal, Jean-Claude Latombe, Rajeev Motwani, and Prabhakar Raghavan. Nonholonomic path planning for pushing a disk among obstacles. In Proceedings of the 1997 IEEE International Conference on Robotics and Automation, Albuquerque, New Mexico, USA, April 20-25, 1997, pages 3124--3129. IEEE, 1997. [ bib | DOI | http ]
[160] Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, and Shalom Tsur. Dynamic itemset counting and implication rules for market basket data. In Joan Peckham, editor, SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA, pages 255--264. ACM Press, 1997. [ bib | DOI | http ]
[161] Sergey Brin, Rajeev Motwani, and Craig Silverstein. Beyond market baskets: Generalizing association rules to correlations. In Joan Peckham, editor, SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA, pages 265--276. ACM Press, 1997. [ bib | DOI | http ]
[162] Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, and Baruch Schieber. The angular-metric traveling salesman problem. In Michael E. Saks, editor, Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana, USA, pages 221--229. ACM/SIAM, 1997. [ bib | http ]
[163] Chandra Chekuri, Rajeev Motwani, B. Natarajan, and Clifford Stein. Approximation techniques for average completion time scheduling. In Michael E. Saks, editor, Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana, USA, pages 609--618. ACM/SIAM, 1997. [ bib | http ]
[164] Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, and Santosh S. Vempala. Locality-preserving hashing in multidimensional spaces. In Frank Thomson Leighton and Peter W. Shor, editors, Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997, pages 618--625. ACM, 1997. [ bib | DOI | http ]
[165] Moses Charikar, Chandra Chekuri, Tomás Feder, and Rajeev Motwani. Incremental clustering and dynamic information retrieval. In Frank Thomson Leighton and Peter W. Shor, editors, Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997, pages 626--635. ACM, 1997. [ bib | DOI | http ]
[166] Leonidas J. Guibas, Jean-Claude Latombe, Steven M. LaValle, David Lin, and Rajeev Motwani. Visibility-based pursuit-evasion in a polygonal environment. In Frank K. H. A. Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, and Roberto Tamassia, editors, Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings, volume 1272 of Lecture Notes in Computer Science, pages 17--30. Springer, 1997. [ bib | DOI | http ]
[167] Moses Charikar, Rajeev Motwani, Prabhakar Raghavan, and Craig Silverstein. Constrained TSP and low-power computing. In Frank K. H. A. Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, and Roberto Tamassia, editors, Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings, volume 1272 of Lecture Notes in Computer Science, pages 104--115. Springer, 1997. [ bib | DOI | http ]
[168] Michael H. Goldwasser and Rajeev Motwani. Intractability of assembly sequencing: Unit disks in the plane. In Frank K. H. A. Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, and Roberto Tamassia, editors, Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings, volume 1272 of Lecture Notes in Computer Science, pages 307--320. Springer, 1997. [ bib | DOI | http ]
[169] Rajeev Motwani and Prabhakar Raghavan. Randomized algorithms. In Allen B. Tucker, editor, The Computer Science and Engineering Handbook, pages 141--161. CRC Press, 1997. [ bib ]
[170] Rajeev Motwani and Prabhakar Raghavan. Randomized algorithms. ACM Comput. Surv., 28(1):33--37, 1996. [ bib | DOI | http ]
[171] Michael H. Goldwasser, Jean-Claude Latombe, and Rajeev Motwani. Complexity measures for assembly sequences. In Proceedings of the 1996 IEEE International Conference on Robotics and Automation, Minneapolis, Minnesota, USA, April 22-28, 1996, pages 1851--1857. IEEE, 1996. [ bib | DOI | http ]
[172] Chandra Chekuri, Richard Johnson, Rajeev Motwani, B. Natarajan, B. Ramakrishna Rau, and Michael S. Schlansker. Profile-driven instruction level parallel scheduling with application to super blocks. In Stephen W. Melvin and Steve Beaty, editors, Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture, MICRO 29, Paris, France, December 2-4, 1996, pages 58--67. ACM/IEEE Computer Society, 1996. [ bib | DOI | http ]
[173] Sanjeev Khanna, Rajeev Motwani, and Randall H. Wilson. On certificates and lookahead in dynamic graph problems. In Éva Tardos, editor, Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia, USA, pages 222--231. ACM/SIAM, 1996. [ bib | http ]
[174] Donald Aingworth, Chandra Chekuri, and Rajeev Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). In Éva Tardos, editor, Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia, USA, pages 547--553. ACM/SIAM, 1996. [ bib | http ]
[175] Sanjeev Khanna and Rajeev Motwani. Towards a syntactic characterization of PTAS. In Gary L. Miller, editor, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996, pages 329--337. ACM, 1996. [ bib | DOI | http ]
[176] Paul W. Finn, Dan Halperin, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Christian R. Shelton, and Suresh Venkatasubramanian. Geometric manipulation of flexible ligands. In Ming C. Lin and Dinesh Manocha, editors, Applied Computational Geormetry, Towards Geometric Engineering, FCRC'96 Workshop, WACG'96, Philadelphia, PA, USA, May 27-28, 1996, Selected Papers, volume 1148 of Lecture Notes in Computer Science, pages 67--78. Springer, 1996. [ bib | DOI | http ]
[177] Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995. [ bib | DOI | http ]
[178] Tomás Feder and Rajeev Motwani. Clique partitions, graph compression and speeding-up algorithms. J. Comput. Syst. Sci., 51(2):261--272, 1995. [ bib | DOI | http ]
[179] Anil Kamath, Rajeev Motwani, Krishna V. Palem, and Paul G. Spirakis. Tail bounds for occupancy and the satisfiability threshold conjecture. Random Struct. Algorithms, 7(1):59--80, 1995. [ bib | DOI | http ]
[180] Rajeev Motwani and Prabhakar Raghavan. Randomized algorithms. SIGACT News, 26(3):48--50, 1995. [ bib | DOI | http ]
[181] Chandra Chekuri, Waqar Hasan, and Rajeev Motwani. Scheduling problems in parallel query optimization. In Mihalis Yannakakis and Serge Abiteboul, editors, Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 22-25, 1995, San Jose, California, USA, pages 255--265. ACM Press, 1995. [ bib | DOI | http ]
[182] Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, and Prabhakar Raghavan. Randomized query processing in robot path planning (extended abstract). In Frank Thomson Leighton and Allan Borodin, editors, Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA, pages 353--362. ACM, 1995. [ bib | DOI | http ]
[183] Waqar Hasan and Rajeev Motwani. Coloring away communication in parallel query optimization. In Umeshwar Dayal, Peter M. D. Gray, and Shojiro Nishio, editors, VLDB'95, Proceedings of 21th International Conference on Very Large Data Bases, September 11-15, 1995, Zurich, Switzerland, pages 239--250. Morgan Kaufmann, 1995. [ bib | .PDF ]
[184] Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, and Umesh V. Vazirani. On syntactic versus computational views of approximability. Electron. Colloquium Comput. Complex., (23), 1995. [ bib | .html ]
[185] Rajeev Motwani and Madhu Sudan. Computing roots of graphs is hard. Discret. Appl. Math., 54(1):81--88, 1994. [ bib | DOI | http ]
[186] Rajeev Motwani. Average-case analysis of algorithms for matchings and related problems. J. ACM, 41(6):1329--1356, 1994. [ bib | DOI | http ]
[187] Rajeev Motwani, Joseph Naor, and Moni Naor. The probabilistic method yields deterministic parallel algorithms. J. Comput. Syst. Sci., 49(3):478--516, 1994. [ bib | DOI | http ]
[188] Rajeev Motwani, Steven J. Phillips, and Eric Torng. Non-clairvoyant scheduling. Theor. Comput. Sci., 130(1):17--47, 1994. [ bib | DOI | http ]
[189] David R. Karger, Rajeev Motwani, and Madhu Sudan. Approximate graph coloring by semidefinite programming. In 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pages 2--13. IEEE Computer Society, 1994. [ bib | DOI | http ]
[190] Anil Kamath, Rajeev Motwani, Krishna V. Palem, and Paul G. Spirakis. Tail bounds for occupancy and the satisfiability threshold conjecture. In 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pages 592--603. IEEE Computer Society, 1994. [ bib | DOI | http ]
[191] Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, and Umesh V. Vazirani. On syntactic versus computational views of approximability. In 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pages 819--830. IEEE Computer Society, 1994. [ bib | DOI | http ]
[192] Waqar Hasan and Rajeev Motwani. Optimization algorithms for exploiting the parallelism-communication tradeoff in pipelined parallelism. In Jorge B. Bocca, Matthias Jarke, and Carlo Zaniolo, editors, VLDB'94, Proceedings of 20th International Conference on Very Large Data Bases, September 12-15, 1994, Santiago de Chile, Chile, pages 36--47. Morgan Kaufmann, 1994. [ bib | .PDF ]
[193] Richard M. Karp, Rajeev Motwani, and Noam Nisan. Probabilistic analysis of network flow algorithms. Math. Oper. Res., 18(1):71--97, 1993. [ bib | DOI | http ]
[194] Rajeev Motwani, Steven J. Phillips, and Eric Torng. Non-clairvoyant scheduling. In Vijaya Ramachandran, editor, Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 25-27 January 1993, Austin, Texas, USA, pages 422--431. ACM/SIAM, 1993. [ bib | http ]
[195] David R. Karger, Rajeev Motwani, and G. D. S. Ramkumar. On approximating the longest path in a graph (preliminary version). In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, and Sue Whitesides, editors, Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings, volume 709 of Lecture Notes in Computer Science, pages 421--432. Springer, 1993. [ bib | DOI | http ]
[196] Amotz Bar-Noy, Rajeev Motwani, and Joseph Naor. The greedy algorithm is optimal for on-line edge coloring. Inf. Process. Lett., 44(5):251--253, 1992. [ bib | DOI | http ]
[197] Amotz Bar-Noy, Rajeev Motwani, and Joseph Naor. A linear time approach to the set maxima problem. SIAM J. Discret. Math., 5(1):1--9, 1992. [ bib | DOI | http ]
[198] Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and hardness of approximation problems. In 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pages 14--23. IEEE Computer Society, 1992. [ bib | DOI | http ]
[199] Leonidas J. Guibas, Rajeev Motwani, and Prabhakar Raghavan. The robot localization problem in two dimensions. In Greg N. Frederickson, editor, Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA, pages 259--268. ACM/SIAM, 1992. [ bib | http ]
[200] Tomás Feder and Rajeev Motwani. Clique partitions, graph compression, and speeding-up algorithms. In Cris Koutsougeras and Jeffrey Scott Vitter, editors, Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5-8, 1991, New Orleans, Louisiana, USA, pages 123--133. ACM, 1991. [ bib | DOI | http ]
[201] Rajeev Motwani, Arvind Raghunathan, and Huzur Saran. Covering orthogonal polygons with star polygons: The perfect graph approach. J. Comput. Syst. Sci., 40(1):19--48, 1990. [ bib | DOI | http ]
[202] Donald E. Knuth, Rajeev Motwani, and Boris G. Pittel. Stable husbands. Random Struct. Algorithms, 1(1):1--14, 1990. [ bib | DOI | http ]
[203] Donald E. Knuth, Rajeev Motwani, and Boris G. Pittel. Stable husbands. In David S. Johnson, editor, Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 22-24 January 1990, San Francisco, California, USA, pages 397--404. SIAM, 1990. [ bib | http ]
[204] Rajeev Motwani, Arvind Raghunathan, and Huzur Saran. Perfect graphs and orthogonally convex covers. SIAM J. Discret. Math., 2(3):371--392, 1989. [ bib | DOI | http ]
[205] Rajeev Motwani, Joseph Naor, and Moni Naor. The probabilistic method yields deterministic parallel algorithms. In 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pages 8--13. IEEE Computer Society, 1989. [ bib | DOI | http ]
[206] Rajeev Motwani. Expanding graphs and the average-case analysis of algorithms for matchings and related problems. In David S. Johnson, editor, Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washington, USA, pages 550--561. ACM, 1989. [ bib | DOI | http ]
[207] Richard M. Karp, Rajeev Motwani, and Prabhakar Raghavan. Deferred data structuring. SIAM J. Comput., 17(5):883--902, 1988. [ bib | DOI | http ]
[208] Rajeev Motwani, Arvind Raghunathan, and Huzur Saran. Covering orthogonal polygons with star polygons: The perfect graph approach. In Herbert Edelsbrunner, editor, Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, IL, USA, June 6-8, 1988, pages 211--223. ACM, 1988. [ bib | DOI | http ]
[209] Rajeev Motwani, Arvind Raghunathan, and Huzur Saran. Constructive results from graph minors: Linkless embeddings. In 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pages 398--409. IEEE Computer Society, 1988. [ bib | DOI | http ]
[210] Rajeev Motwani and Prabhakar Raghavan. Deferred data structuring: Query-driven preprocessing for geometric search problems. In Alok Aggarwal, editor, Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, Yorktown Heights, NY, USA, June 2-4, 1986, pages 303--312. ACM, 1986. [ bib | DOI | http ]

This file was generated by bibtex2html 1.99.