BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//DISC 2025//DISC//EN

BEGIN:VEVENT
UID:DISC202515@
DTSTAMP:20251030T000000Z
DTSTART;TZID=Europe/Berlin:20251030T084500
DTEND;TZID=Europe/Berlin:20251030T100000
SUMMARY:Session 10: Nature-inspired computation and dynamic networks
DESCRIPTION:Robust predicate and function computation in continuous chemical reaction networks\nKim Calabrese, David Doty, and Mina Latifi\n\nOn the h-Majority Dynamics with Many Opinions\nFrancesco d’Amore, Niccolò D’Archivio, George Giakkoupis, and Emanuele Natale\n\nTowards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders\nEmilio Cruciani, Sebastian Forster, and Tijn de Vos\n\nBrief Announcement: Maintaining a Bounded Degree Expander in Dynamic Peer-to-Peer Networks\nAntonio Cruciani\n\nBrief Announcement: Congested Clique Counting for Local Gibbs Distributions\nJoshua Z. Sobel
END:VEVENT

BEGIN:VEVENT
UID:DISC202516@
DTSTAMP:20251030T000000Z
DTSTART;TZID=Europe/Berlin:20251030T100000
DTEND;TZID=Europe/Berlin:20251030T110000
SUMMARY:Keynote 3: Ittai Abraham
DESCRIPTION:Open Questions and Future Challenges in Fault Tolerant Distributed Computing
END:VEVENT

BEGIN:VEVENT
UID:DISC202517@
DTSTAMP:20251030T000000Z
DTSTART;TZID=Europe/Berlin:20251030T112500
DTEND;TZID=Europe/Berlin:20251030T123000
SUMMARY:Session 11: Highlighted presentations in distributed graph algorithms
DESCRIPTION:Towards Optimal Distributed Edge Coloring with Fewer Colors\nManuel Jakob, Yannic Maus, and Florian Schager\n\nOn the Randomized Locality of Matching Problems in Regular Graphs\nSeri Khoury, Manish Purohit, Aaron Schild, and Joshua R. Wang\n\nDistributed Computation with Local Advice\nAlkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, and Jukka Suomela
END:VEVENT

BEGIN:VEVENT
UID:DISC202518@
DTSTAMP:20251030T000000Z
DTSTART;TZID=Europe/Berlin:20251030T134500
DTEND;TZID=Europe/Berlin:20251030T150000
SUMMARY:Session 12: Fault-tolerance and consensus
DESCRIPTION:Byzantine Consensus in the Random Asynchronous Model\nGeorge Danezis, Jovan Komatovic, Lefteris Kokoris-Kogias, Alberto Sonnino, and Igor Zablotchi\n\nLower Bounds for k-Set Agreement in Fault-Prone Networks\nPierre Fraigniaud, Minh Hang Nguyen, Ami Paz, Ulrich Schmid, and Hugo Rincon-Galeana\n\nKudzu: Fast and Simple High-Throughput BFT\nVictor Shoup, Jakub Sliwinski, and Yann Vonlanthen\n\nWeight reduction in distributed protocols: new algorithms and analysis\nAnatoliy Zinovyev
END:VEVENT

BEGIN:VEVENT
UID:DISC202519@
DTSTAMP:20251030T000000Z
DTSTART;TZID=Europe/Berlin:20251030T152000
DTEND;TZID=Europe/Berlin:20251030T170000
SUMMARY:Session 13: Communication
DESCRIPTION:Deterministic Synchronous Self-Stabilizing BFS Construction with Constant Space Complexity\nLélia Blin, Franck Petit, and Sébastien Tixeuil\n\nAmnesiac Flooding: Easy to Break, Hard to Escape\nHenry Austin, Maximillien Gadouleau, George B. Mertzios, and Amitabh Trehan\n\nCoordination Through Stochastic Channels\nPierre Fraigniaud, Boaz Patt-Shamir, and Sergio Rajsbaum\n\nCompact routing schemes in undirected and directed graphs\nAvi Kadria and Liam Roditty\n\nEnergy-Efficient Maximal Independent Sets in Radio Networks\nDominick Banasik, Varsha Dani, Fabien Dufoulon, Aayush Gupta, Thomas P. Hayes, and Gopal Pandurangan\n\nBrief Announcement: Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks\nAdam Ganczorz, Tomasz Jurdzinski, and Andrzej Pelc
END:VEVENT

BEGIN:VEVENT
UID:DISC202520@
DTSTAMP:20251030T000000Z
DTSTART;TZID=Europe/Berlin:20251030T170500
DTEND;TZID=Europe/Berlin:20251030T174500
SUMMARY:Session 14: Fault-tolerance and consensus continued
DESCRIPTION:Brief Announcement: From Few to Many Faults: Adaptive Byzantine Agreement with Optimal Communication\nAndrei Constantinescu, Marc Dufay, Anton Paramonov, and Roger Wattenhofer\n\nBrief Announcement: Asynchronous Approximate Agreement with Quadratic Communication\nMose Mizrahi Erbes and Roger Wattenhofer\n\nBrief Announcement: Single-Round Broadcast: Impossibility, Feasibility, and More\nZhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou, and Kui Ren\n\nBrief Announcement: Communication Patterns for Optimal Resilience\nHagit Attiya, Itay Flam, and Jennifer L. Welch\n\nBrief Announcement: Proximal Byzantine Agreement: Improved accuracy for fault-tolerant replicated datastreams\nRoy Shadmon and Owen Arden
END:VEVENT

END:VCALENDAR