## Past, Current and Future Courses

0368-3XXX courses are intended mostly for undergraduates and 0368-4XXX are intended mostly for graduate students. Some of the links direct to the Moodle course system and require registration.

### Spring 2017

- 0368-4131 Foundations of Cryptography — Advanced Topics Iftach Haitner and Benny Applebaum
- 0366-5079 Expander Graphs and Applications Rene Ruehr

- 0368-4182 Seminar in Secure Multi-Party Computation Iftach Haitner

### Fall 2016-17

- 0368-4132 Boolean Functions and Hardness of Approximation Muli Safra
- 0368-4155 On The P vs. BPP Problem Amnon Ta-Shma
- 0368-4162 Foundations of Cryptography Iftach Haitner and Benny Applebaum
- 0368-4492 Algebraic Methods in Computer Science and Combinatorics Amir Shpilka

- 0368-4181 Seminar in Additive Combinatorics Amir Shpilka

### Spring 2016

- 0368-3170 Expanders, pseudorandomness and derandomization Amnon Ta-Shma
- 0368-4491 Communication and information complexity Rotem Oshman
- 0368-4506 The PCP theorem and its applications Muli Safra

- 0368-3337 Students seminar: Pseudorandomness Amnon Ta Shma
- 0368-4152 Students seminar: Zero-knowledge proofs Iftach Haitner
- 0368-4499 Students seminar: Cryptographic protocols Ran Canetti

### Fall 2015-16

- 0368-3171 Codes, boolean functions and hardness of approximation Muli Safra
- 0368-4162 Foundations of cryptograpy Ran Canetti
- 0368-4167 Sublinear-time algorithms Ronitt Rubinfeld
- 0368-4486 Information theory and its application to CS Iftach Haitner
- 0368-4506 Introduction to error-correcting codes Amir Shpilka

- 0368-3338 Students seminar: Arithmetic circuit complexity Amir Shpilka
- 0368-4612 Students seminar: Sublinear-time algorithms Ronitt Rubinfeld

### Spring 2015

- 0368-3257 A research project in the theory of CS Rotem Oshamn, Muli Safra, Amir Shpilka
- 0368-4491 Communication and information complexity Rotem Oshman

- 0368-4152 Students seminar: Average-case complexity Iftach Haitner
- 0368-4499 Students seminar: Cryptographic protocols Ran Canetti

### Fall 2014-15

- 0368-4159 Randomized algorithms and derandomization Amnon Ta-Shma
- 0368-4162 Foundations of cryptograpy Ran Canetti
- 0368-4167 Sublinear-time algorithms Ronitt Rubinfeld
- 0368-4359 Research pearls in theoretical CS Muli Safra
- 0368-4486 Information theory and its application to CS Iftach Haitner
- 0368-4492 Algebraic methods in computer science and combinatorics Amir Shpilka

### Spring 2014

- 0368-4162 Foundations of cryptograpy Iftach Haitner
- 0368-4360 Diamonds of research in CS Muli Safra

### Fall 2013-14

- 0368-4057 Quantum computation Amnon Ta-Shma
- 0368-4359 Research pearls in theoretical CS Muli Safra

- 0368-3330 Students seminar: Pseudorandomness Iftach Haitner
- 0368-4504 Students seminar: Special topics in theoretical CS Muli Safra

### Spring 2013

- 0368-4162 Foundations of cryptograpy Iftach Haitner
- 0368-4357 Algebraic error-correcting codes Amnon Ta-Shma

### Fall 2012-13

- 0368-4359 Research pearls in theoretical CS Muli Safra

- 0368-3391 Students seminar: Communication complexity Iftach Haitner
- 0368-4504 Students seminar: Special topics in theoretical CS Muli Safra