SIROCCO Schedule: Tuesday, July 14: 16:00 - 20:00 Registration 20:30 Reception Wednesday, July 15: 09:00 - 10:00 SIROCCO Award Lecture Michel Raynal Communication patterns and input patterns in distributed computing 10:00 - 10:50 Session 1: Network Algorithms Pierre Fraigniaud, Juho Hirvonen and Jukka Suomela. Node Labels in Local Decision Joel Rybicki and Jukka Suomela. Exact bounds for distributed graph colouring 10:50 - 11:20 Coffee Break 11:20 - 13:00 Session 2: Scheduling Patrick Eugster, Alex Kesselman, Kirill Kogan, Sergey Nikolenko and Alexander Sirotkin. Essential Traffic Parameters for Shared Memory Switch Performance Lukasz Jez, Yishay Mansour and Boaz Patt-Shamir. Scheduling Multipacket Frames With Frame Deadlines Marcin Bienkowski, Artur Kraska and Pawel Schmidt. A Randomized Algorithm for Online Scheduling with Interval Conflicts Tamas Lukovszki and Stefan Schmid. Online Admission Control and Embedding of Service Chains 13:00 - 14:30 Lunch Break 14:30 - 15:20 Memorial Talk Miquel Angel Fiol On the works of José Gómez. In memoriam. 15:20 - 16:10 Session 3: Approximation Algorithms Gennaro Cordasco, Luisa Gargano, Adele Rescigno and Ugo Vaccaro. Optimizing Spread of Influence in Social Networks via Initial Partial Incentives Georgios Stamoulis. Approximation Algorithms For Multi-Budgeted Network Design Problems 16:10 - 16:30 Coffee Break 16:30 - 17:20 Session 4: Wireless Networks Fabian Fuchs and Roman Prutkin. Simple Distributed Delta + 1 Coloring in the SINR Model Leonid Barenboim and David Peleg. Nearly Optimal Local Broadcasting in the SINR Model with Feedback 17:30 - 18:30 Business meeting 19:30 - 20:30 Organ Concert 20:30 Dinner Thursday, July 16: 09:00 - 10:00 Keynote Nati Linial Random simplicial complexes and why we care 10:00 - 10:50 Session 5: Byzantine Systems Sébastien Bouchard, Yoann Dieudonné and Bertrand Ducourthial. Byzantine Gathering in Networks Achour Mostéfaoui and Michel Raynal. Signature-free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t