[DMANET] CoA 2026 -- Call for Participation

Dear Colleagues, We are happy to announce that the 5th Workshop on Complexity and Algorithms [1] (CoA 2026) will take place in Lyon, from October 5 to 7, 2026. The program will begin after lunch on Monday and end in the mid-afternoon on Wednesday. More information can be found on the event webpage: https://indico.math.cnrs.fr/event/16397/. **Invited talks and tutorials** Lélia Blin: Memory Minimization in Self-Stabilization Arnaud Labourel: Can Like Attract Like? A Study of Homonymous Gathering in Networks Lianna Hambardzumyan: From Arithmetic Progressions to Algorithms and Lower Bounds (tutorial) Nguyễn Kim Thắng: Multiplicative Weight Update through the Lens of Algorithm Design and Machine Learning (tutorial) **Registration** Registration is free but mandatory. The registration link is at the bottom of the webpage (and on the side). The registration deadline is September 4th. **Call for presentations** We invite everyone working in Algorithms and Complexity (in the broadest sense) to submit a talk proposal on a topic of their choice. This is done via the registration form. The deadline for talk proposals is July 31st. Please share this email with anyone you think might be interested in the event. We look forward to seeing you in Lyon, Bertrand Simon, Édouard Bonnet, Sébastien Tavenas Links: ------ [1] https://www.irif.fr/en/gt-coa/index ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************