Daniele Micciancio's Courses

Current courses (Spring 2008):

• CSE105: Intro. to Theory of Computation

Graduate courses:

• Lattices Algorithms and Applications (CSE206A, formerly "Lattices in Cryptography and Cryptanalysis" CSE207C, CSE291). Topics: lattice approximation algorithms and their applications to cryptography. [Fall 1999, Winter 2002, Winter 2004, Spring 2007].
• CSE208 Advanced Cryptography: specific topic changes every year. Past topics:
  1. Secure multiparty computation [Fall 2002]
  2. Zero knowledge proof systems [Spring 2004]
  3. Symbolic methods for security analysis [Spring 2005]
• Foundation of cryptography (CSE207B, formerly CSE291). Course about foundational aspects of cryptography, with emphasis on topics related to complexity theory, e.g., hardness amplification, pseudorandomness, etc. [Winter 2001]
• Computational complexity (CSE200): Introductory graduate course on computational complexity [Winter 2005, Winter 2006, Fall 2007]
• Theory/Crypto seminar (CSE209A/B) [..., Spring 2007, Fall 2007, Winter 2008]
• Algorithms Design and Analysis (CSE202). Introductory graduate course on algorithms. [Spring 2002]
• Advanced Algorithms (CSE203A): Advaced graduate course on algorithms. Topic: randomized and approximation algorithms. [Winter 2003]

Undergraduate courses:

• Introduction to the theory of compuation (CSE105). Topics: automata, regular expressions, context free grammars, Turing machines, undecidability. [Winter 2000, Winter 2001, Winter 2002, Winter 2003, Spring 2003, Winter 2004, Winter 2005, Winter 2006, Winter 2007, Winter 2008, Spring 2008]
• Programming Lanugages: Principles and Paradigms (CSE130). [Fall 2000]