Amit Chakrabarti

Professor
Department of Computer Science, Dartmouth College, Hanover, NH 03755, USA.
Photo of Amit

Areas of Interest
Most aspects of Theoretical Computer Science
Especially: complexity theory, data stream algorithms, approximation algorithms
My curriculum vitae as of April 2014
Education
Ph.D., Princeton University, 2002
B.Tech., IIT Bombay, 1997
Contact
107 Sudikoff, HB 6211, +1-603-646-1710 (tel), -1672 (fax)
firstname.lastname@dartmouth.edu
 
Currently Teaching
Not teaching in Summer 2015
Upcoming Courses
Past Courses

Publications
Papers, with brief synopses and downloadable copies
Ph.D. thesis, "Limitations of Non-Uniform Computational Models"
Funding & Awards
NSF CAREER Award; NSF IIS Grant; NSF CCF Grant;
Karen E. Wetterhahn Award; McLane Family Fellowship.
I am grateful for all of this generous support of my work.
Program Committees
Other
I have served as the Publicity Chair for ACM SIGACT since 2010.
From Spring 2004 to Fall 2007, I organized the Dartmouth Theory Seminars.
Since Fall 2005, I have been organizing the Theory Reading Group.
 
Current
Graduate: Sagar Kale, Suman Bera, Pei Wu.
Undergraduate: (positions open)
Former
Graduate: Anna Shubina, Ph.D., 2007; Joshua Brody, Ph.D., 2010;
  Chrisil Arackaparambil, Ph.D., 2011; Ranganath Kondapally, Ph.D., 2012. Zhenghui Wang, M.S., 2013.
Undergraduate: Ajay Kannan '15 (Presidential scholar), Matthew Harding '13 (High Honors: thesis),
  Melissa Queen '13 (Honors: thesis), Edward Talmage '12 (Honors: thesis), Karn Seth '10 (High Honors: thesis),
  William Henderson-Frost '08 (High Honors: thesis), Owen Worley '09 (Presidential scholar),
  David Blinn '06 (High Honors: thesis), Marco Adelfio '05, (High Honors: thesis),
  Khanh Do Ba '06, (summer project).
Prospective Students
Are you interested in theoretical topics (either algorithms or complexity)?
Are you a CS Major with solid mathematical foundations, looking for a thesis topic?
Please stop by for a chat.

©2008-2015 Amit Chakrabarti      Last modified: Mon Jun 9 09:26:06 EDT 2014