Most aspects of Theoretical Computer Science
Especially: complexity theory, data stream algorithms, approximation algorithms
My C.V. [PDF version | PS version]

Ph.D., Princeton University, 2002
B.Tech., IIT Bombay, 1997

107 Sudikoff, HB 6211, +1-603-646-1710 (tel), -1672 (fax)
firstname.lastname@dartmouth.edu

CS 39: Theory of Computation, Winter 2012

Not teaching in Spring 2012

CS 49/149: Data Stream Algorithms, Fall 2011
CS 239: Computational Complexity, Fall 2011
CS 109: Theory of Computation (Graduate Level), Spring 2011
CS 33: Information Systems, Spring 2011
Distant past

Papers, with brief synopses and downloadable copies
Ph.D. thesis, "Limitations of Non-Uniform Computational Models"

NSF CAREER Award; NSF IIS Grant; Karen E. Wetterhahn Award; McLane Family Fellowship
I am grateful for all of this generous support of my work.

Served on the program committee (PC) of CCC 2008, FOCS 2009, COCOON 2010, FSTTCS 2010.
Serving on the PC of TAMC 2011, Tokyo.

I organized the Dartmouth Theory Seminars from Spring 2004 to Fall 2007.
I have been organizing the Theory Reading Group since Fall 2005.

Graduate: Chrisil Arackaparambil, Ranganath Kondapally.

Graduate: Anna Shubina, Ph.D., 2007; Joshua Brody, Ph.D., 2010.
Undergraduate: 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).

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.