Amit Chakrabarti: Teaching

Currently teaching:
CS 39: Theory of Computation, Winter 2012.
Archived web pages of Dartmouth courses taught earlier:
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.
CS 106: Numerical Linear Algebra, Fall 2010.
CS 109: Theory of Computation (Graduate Level), Spring 2010.
CS 33: Information Systems, Spring 2010.
CS 85: Data Stream Algorithms, Fall 2009.
CS 109: Theory of Computation (Graduate Level), Spring 2009.
CS 33: Information Systems, Spring 2009.
CS 39: Theory of Computation, Winter 2009.
CS 85: Lower Bounds in Computer Science, Spring 2008.
CS 109: Theory of Computation (Graduate Level), Spring 2008.
CS 39: Theory of Computation, Fall 2007.
CS 39: Theory of Computation, Fall 2006.
CS 19: Discrete Mathematics in Computer Science, Winter 2006.
CS 85: Information, Communication and Complexity Theory, Winter 2006.
CS 39: Theory of Computation, Fall 2005.
CS 39: Theory of Computation, Winter 2005.
CS 105: Algorithms (Graduate Level), Winter 2005.
CS 39: Theory of Computation, Fall 2004.
CS 21 / Math 19 / Engg 66: Discrete Mathematics in Computer Science, Winter 2004.
CS 85: Lower Bounds in Computer Science, Fall 2003.

Acknowledgement: From Summer 2005 to Fal 2010, Amit Chakrabarti was supported in part by a CAREER Award; from the NSF. Course notes for "Lower Bounds in Computer Science" and "Data Stream Algorithms" are available at the websites for the respective courses, for the use of students and instructors worldwide. These notes were started during the period of the CAREER Award, and NSF's support is gratefully acknowledged.

Home