Theorietag 2021 80th Workshop on Algorithms and Complexity
The 80th Theorietag will take place online only (via Zoom™) on
- 13th of April 2021
- 09:00 am (CEST/Berlin time)
- 05:40 pm (CEST/Berlin time)
It is organized by the Algorithmics and Computational Complexity research group of the Technische Universität Berlin.
The workshop has no formal proceedings. Unpublished as well as published work can be presented.
We do not plan to record the sessions.
Invited Speaker: Thomas Erlebach (University of Leicester) gives a talk titled "Algorithms for Explorable Uncertainty: Parallel Queries and Untrusted Predictions".
The program is available here.
The details including the link for the online room are sent via email to all registered participants. If you are registered and did not receive the corresponding email, please contact us (see below).
Contact & Registration
If you would like to attend: Please register by sending an e-mail to the above address until 01st of April 2021.
If you plan to give a talk: Please include, also until 01st of April 2021, the title and abstract of your talk in the email (preferably send the latex source code). If your talk is connected to a manuscript available online, please also send the manuscript's link. Each talk should be in English and about 20 minutes long (followed by a 5-minute discussion round).
In any case attendance is free of charge.
The Theorietag on Algorithms and Complexity is a recurring event featured by Fachgruppe Algorithmen and Fachgruppe Komplexität of the Gesellschaft für Informatik.
The previous 79th Theorietag in Hannover can be found here. the 78th Theorietag in Berlin can be found here, and the 77th Theorietag in Marburg can be found here.