Lower Bounds in Computational Complexity Reunion
Organizers:
This reunion workshop is for long-term participants in the program "Lower Bounds in Computational Complexity" held in the Fall 2018 semester. It will provide an opportunity to meet old and new friends. Moreover, we hope that it will give everyone a chance to reflect on the progress made during the semester and since, and sketch which directions the field should go in the future. In an effort to keep things informal and to encourage open discussion, none of the activities will be recorded. Participation in the workshop is by invitation only.
Eric Allender (Rutgers University), Mark Bun (Princeton University), Peter Bürgisser (Institute of Mathematics, TU Berlin), Igor Carboni Oliveira (University of Oxford), Marco Carmosino (UC San Diego), Lijie Chen (MIT), Anna Gál (University of Texas at Austin), Lianna Hambardzumyan (McGill University), Hamed Hatami (McGill University), Shuichi Hirahara (National Institute of Informatics, Tokyo), Christian Ikenmeyer (University of Livermore), Valentine Kabanets (Simon Fraser University), Pascal Koiran (Ecole Normale Supérieure de Lyon), Antonina Kolokolova (Memorial University of Newfoundland), Sajin Koroth (Simon Fraser University), Or Meir (University of Haifa), Rafael Mendes de Oliveira (University of Toronto), Karl Jakob Nordström (University of Copenhagen), Greta Panova (University of Southern California), Aaron Potechin (University of Chicago), Anup Rao (University of Washington), Robert Robere (University of Toronto), Greg Rosenthal (University of Toronto), Rahul Santhanam (University of Oxford), Avishay Tal (UC Berkeley), Michael Walter (University of Amsterdam), Richard Williams (MIT), Susanna de Rezende (KTH Royal Institute of Technology)
