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

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

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

CS 39: Theory of Computation, Winter 2009
CS 109: Theory of Computation (Graduate Level), Spring 2009
CS 33: Information Systems, Spring 2009

CS 109: Theory of Computation (Graduate Level), Spring 2008
CS 85: You Can't Do That: Lower Bounds in CS, Spring 2008
CS 39: Theory of Computation, Fall 2007
CS 39: Theory of Computation, Fall 2006
Distant past

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

Supported by an NSF CAREER Award (gratefully acknowledged)

Program committee member, CCC 2008, College Park, MD
See you at the conference: we have an excellent program (link coming soon).

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: William Henderson-Frost '08 (Honors thesis), Owen Worley '09 (Presidential scholar).

Graduate: Anna Shubina, Ph.D., 2007.
Undergraduate: 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.