About The Students’ Theory Seminar
Goal
Present interesting subjects/papers in the Theory of Computing.
This usually means meeting at least one of the following criteria:
|
1. Important: |
classical and fundamental papers, recent breakthroughs,… |
|
2. Useful: |
tools and techniques that are (or should be, or might be) widely used |
|
3. Beautiful: |
clever arguments, nice proofs, elegant constructions,… |
Areas
The seminar is open for any subject in Theory of Computing and related areas.
Some specific subjects of interest are:
|
1. Complexity Theory |
complexity classes, PCP, hardness vs. randomness tradeoffs, circuit complexity, … |
|
2. Pseudorandomness |
extractors, expanders, … |
|
3. Cryptography |
one-way functions, zero-knowledge proofs, secure computation, … |
|
4. Algorithms |
approximation algorithms, learning algorithms, distributed computing, … |
|
5. Mathematics |
combinatorics, Fourier analysis, random walks and percolation, algebra, … |
Speakers
The speakers are usually PhD or MSc students from Weizmann or other institutes.
Some of the talks are given by post-docs or faculty members.
Participants
Everyone who is interested in Theory of Computing is welcome.
Schedule
Contact
Every week we send an announcement regarding the coming talk.
If you want to become a part of the mailing list, please send a mail to:
