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 85: Data Stream Algorithms, Fall 2009

CS 109: Theory of Computation (Graduate Level), Spring 2010
CS 33: Information Systems, Spring 2010

CS 109: Theory of Computation (Graduate Level), Spring 2009
CS 33: Information Systems, Spring 2009
CS 39: Theory of Computation, Winter 2009
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 of CCC 2008.
Serving on the program committee of FOCS 2009, Atlanta, GA and COCOON 2010, Nha Trang, Vietnam.

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

Graduate: Joshua Brody, Chrisil Arackaparambil, Ranganath Kondapally.
Undergraduate: (Your name here?)

Graduate: Anna Shubina, Ph.D., 2007.
Undergraduate: William Henderson-Frost '08 (High Honors), 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.