Scientific Programme The main themes of the
Workshop will be circuit complexity, proof complexity, cryptography,
communication complexity and bounded arithmetic.
- The intended format is
- hour-long keynote lectures on the major themes
- selected contributed talks
- informal discussion sessions
The timetable is available here.
ParticipantsList Updated 25 September
2001
| Name |
Institution |
| Alekhnovitch, Mikhail |
Massachusetts Institute of Technology |
| Atserias, Albert |
Universitat Politecnica de Catalunya |
| Beame, Paul |
University of Washington |
| Beckmann, Arnold |
Technical University of Vienna |
| Ben-Sasson, Eli |
Hebrew University |
| Bonet, Maria Luisa |
Universidad Politecnica de Catalunya |
| Buss, Sam |
Unviersity of California at San Diego |
| Cook, Stephen |
University of Toronto |
| Dantchev, Stefan |
BRICS, University of Aarhus and Queen Mary |
| Dunne, Paul |
University of Liverpool |
| Galesi, Nicola |
Universitat Politecnica de Catalunya |
| Grohe, Martin |
University of Edinburgh |
| Hanika, Jiri |
Charles University |
| Hastad, Johan |
Royal Institute of Technology in Stockholm |
| Jerabek, Emil |
Mathematical Institute of the Academy of Sciences |
| Jerrum, Mark |
University of Edinburgh |
| Krajicek, Jan |
Academy of Sciences at Prague |
| Morika, Tsuyoshi |
University of Toronto |
| Pitassi, Toniann |
University of Toronto |
| Pudlak, Pavel |
Academy of Sciences at Prague |
| Raz, Ran |
Weizmann Institute |
| Riis, Soren |
Queen Mary College |
| Segerlind, Nathan |
University of California San Diego |
| Takeuti, Gaisi |
University of Pennsylvania |
| Thapen, Neil |
University of Oxford |
| Wilkie, Alex |
University of Oxford |
| Woods, Alan |
University of Western Australia |
| Xirotiri, Olga |
University of Crete |
|
