Amit Chakrabarti: Teaching

Currently teaching:
CS 31: Algorithms, Spring 2017.
Archived web pages of Dartmouth courses taught earlier:
CS 30: Discrete Mathematics in Computer Science, Winter 2017.
CS 49/149: Lower Bounds in Computer Science, Winter 2017.
CS 231: Advanced Algorithms, Spring 2016.
CS 30: Discrete Mathematics in Computer Science, Fall 2015.
CS 35/135: Data Stream Algorithms, Fall 2015.
CS 39: Theory of Computation, Winter 2015.
CS 30: Discrete Mathematics in Computer Science, Fall 2014.
CS 49/149: Communication Protocols and Complexity, Fall 2014.
CS 30: Discrete Mathematics in Computer Science, Fall 2014.
CS 49/149: Communication Protocols and Complexity, Fall 2014.
CS 39: Theory of Computation, Spring 2014.
CS 31: Algorithms, Spring 2013.
CS 239: Computational Complexity, Spring 2013.
CS 39: Theory of Computation, Winter 2013.
CS 39: Theory of Computation, Winter 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.
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: 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 and developed while Professor Chakrabarti was supported (in part) by various awards from the NSF. This support from the NSF is gratefully acknowledged.


Home