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 31: Algorithms, Spring 2013
CS 239: Computational Complexity, Spring 2013

Not teaching in Summer 2013, Fall 2013, and Winter 2014.

CS 39: Theory of Computation, Winter 2013
CS 39: Theory of Computation, Winter 2012
Distant past

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

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.

Serving on the program committee (PC) of
  RANDOM 2013, Berkeley, and STOC 2013, Palo Alto.
Served on the PC of CCC 2008, FOCS 2009, COCOON 2010,
  FSTTCS 2010, TAMC 2011, CATS 2013.

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.

Graduate: Keith Carlson, Sagar Kale, Zhenghui Wang.
Undergraduate: Matthew Harding, Melissa Queen.

Graduate: Anna Shubina, Ph.D., 2007; Joshua Brody, Ph.D., 2010;
  Chrisil Arackaparambil, Ph.D., 2011; Ranganath Kondapally, Ph.D., 2012.
Undergraduate: 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).

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.