Curriculum Vitaé of Mayur D. Datar

Academic status:

Ph.D. (2003)
Department of Computer Science
Stanford University, USA.
Advisor:  Rajeev Motwani


Masters: Department of Computer Science, Stanford University, 2002.

Undergraduate Education (1994-98):
Bachelor of Technology, Department of Computer Science and Engg.
Indian Institute of Technology, Bombay, India.
GPA: 9.79 on a scale of 10.
Placed First in the institute.

I am interested in Theoretical Computer Science and its application to practical problems. In particular, I am interested in:

• Design and Analysis of Algorithms
• Data Stream Algorithms
• Data Bases
• Data Mining
• Information Retrieval
• Combinatorial Optimization (Operations Research)

• Ranked first in the graduating class of 1998 at IIT Bombay. Recipient of the 'President of India' Gold medal for 1998.
• Recipient of the Siebel Scholarship for the year 2002-03.
• Recipient of the Microsoft Graduate Fellowship for the years 2000-02.
• Awarded School of Engineering Fellowship by Stanford for the year 1998-99.
• Recipient of Best student paper award at European Symposium on Algorithms, 2002.
• Ranked 73rd among approximately 100,000 candidates appearing for JEE-1994, the Joint Entrance Examination for admission to the Indian Institutes of Technology (IITs).
• One of the 750 awardees (from all over India) of the National Talent Search Scholarship given by the Government of India in 1992.
• Ranked 18th among a million students who appeared for the High School Secondary Certificate Examination in the State of Maharashtra in India.

• Reviewed papers for conferences like SIGMOD, VLDB, SODA, SIGKDD, and ICDE
• Reviewed papers for journals like SICOMP and TKDE
• On the poster committee for WWW 2003

• Mayur Datar, Abhiram Ranade: Commuting with Delay Prone Buses in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000).



• Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeff Ullman, Cheng Yang: Finding Interesting Associations without Support Pruning in Proceedings of the 16th International Conference on Data Engineering (ICDE 2000).



• Surajit Chaudhuri, Mayur Datar, Rajeev Motwani, Vivek Narasayya: Overcoming Limitations of Sampling for Aggregation Queries in Proceedings of the 17th International Conference on Data Engineerring (ICDE 2001).



• Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani: Maintaining Stream Statistics Over Sliding Windows (Extended Abstract) in Proceedings of 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002).



• Brian Babcock, Mayur Datar, Rajeev Motwani: Sampling from a Moving Window over Streaming Data in Proceedings of 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002).



• Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev Motwani, Jennifer Widom: Models and Issues in Data Stream Systems in Proceedings of the 21st Symposium on Principles of Databases Systems (PODS 2002)



• Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan: Comparing Data Streams Using Hamming Norm in Proceedings of the 28th International Conference on Very Large Data Bases (VLDB 2002)



• Mayur Datar: Butterflies and Peer-to-Peer Networks in Proceedings of the 10th European Symposium on Algorithms (ESA 2002)(Won the best student paper award at the conference)



• Mayur Datar, S. Muthukrishnan: Estimating Rarity and Similarity over Data Stream Windows in Proceedings of the 10th European Symposium on Algorithms (ESA 2002)



• Rajeev Motwani, Jennifer Widom et al.: Approximation and resource management in data stream management system in Proceedings of 1st Biennial Conference on Innovative Data Systems Research (CIDR 2003)



• Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev Motwani: Chains: Operator Scheduling for Memory Minimization in Data Stream Systems, to appear in Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD 2003)



• Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan O'Callaghan: Maintaining Variance and k-Medians over Data Stream Windows, to appear in Proceedings of the 22nd Symposium on Principles of Database Systems (PODS 2003)

• Mayur Datar, Tomas Feder, Aristides Gionis, Rajeev Motwani, Rina Panigrahy : A Combinatorial Algorithm for MAX CSP accepted to Information Processing Letters (IPL)



• Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani: Maintaining Stream Statistics over Sliding Windows SIAM Journal of Computing, Vol. 31, No.6, pp. 1794-1813



• Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeff Ullman, Cheng Yang: Finding Interesting Associations without Support Pruning IEEE Transactions on Knowledge and Data Engineering, Jan 2001, Vol. 13, No. 1

• Research Intern with Theory group at IBM Almaden Research Center. (June 2002 to Sept 2002)
• Research Intern with the DMX (Data Management, Exploration and Mining) Group at Microsoft Research. (June 2001 to Sept 2001)
• Research Intern with PurpleYogi Inc. (Now Stratify Inc.). (June 2000 to Sept 2000)
• Research Intern with the Database Group at Microsoft Research. (June 1999 to Sept 1999)
• Intern with the High Performance Computing Group in C-DAC. (April 1997 to June 1997)

Teaching Experience:

• Co-Teacher for CS 361A, Advanced Algorithms for Internet Applications, Stanford University (2002-03)
• Teaching Assistant for CS 361A, Advanced Algorithms and Data Structures, Stanford University (2000-01).
• Teaching assistant for a course on Computer Programming and Utilization, IIT Bombay.

Software Experience:

I am well conversant with the following programming languages: C, VC++, Java and Pascal.   I have worked extensively with Windows and UNIX/Linux systems.   Active member of the team that is building the STREAM system at Stanford.

References: