35th International Symposium on Distributed Computing (DISC 2021)
October 5 - 7, 2021. Hybrid event (Freiburg, Germany and online).
DISC 2021 will be held as a hybrid conference with a lightweight
in-person component in Freiburg, Germany and with the possibility to
fully participate online through zoom. For details on the hybrid format
of DISC 2021, see
Registration for the conference is open at
Online participation is free of charge. The prices for physical
participation in Freiburg are
regular registration, EATCS member: 150 EUR
regular registration, non-EATCS member: 190 EUR
student registration, EATCS member: 120 EUR
student registration, non-EATCS member: 160 EUR
workshop-only registration: 60 EUR
Note that the deadline for booking a hotel room at a reduced conference
rate is September 25.
The main conference takes place from Tuesday, Oct. 5 - Thursday, Oct. 7
and there are associated workshops on Monday, Oct 4. and Friday, Oct. 8.
A detailed program will soon be available on
Highlights of the conference include:
- Keynote talks by Dahlia Malkhi and Bernhard Haeupler
- Technical paper sessions, as well as other events meant to encourage
community interaction and professional development such as junior-senior
Four workshops are organized in cooperation with DISC 2021:
- ADGA: Workshop on Advances in Distributed Graph Algorithms (October 4)
- FRIDA: Workshop on Formal Reasoning in Distributed Algorithms (October
4 & 8)
- CELLS: Computing among Cells (October 8)
- TLA+ (October 8)
For the latest updates, you can follow us on Twitter:
See you soon online or in Freiburg!
DISC 2021 general chair
[log in to unmask]
If you don't already have a password for the LISTSERV.ACM.ORG server, we recommend
that you create one now. A LISTSERV password is linked to your email
address and can be used to access the web interface and all the lists to
which you are subscribed on the LISTSERV.ACM.ORG server.
To create a password, visit:
Once you have created a password, you can log in and view or change your
subscription settings at: