All times are in Central European Summer Time (CEST = UTC+2)
Click on time to see it in your own zone.
During the conference, the proceedings of SIROCCO 2021 will be available on Springer site in the Lecture Notes in Computer Science series (LNCS).
Tuesday, June 29
13:50-14:00 Opening
14:00-15:00 Keynote 1
Session chair: Stefan Schmid
Rotem Oshman (Tel Aviv University) | Distributed Zero-Knowledge Proofs (click for abstract) | video recording |
15:00-16:00 Session 1: Distributed Graph Algorithms
Session chair: Peter Robinson
Magnús M. Halldórsson and Alexandre Nolin | Superfast Coloring in CONGEST via Efficient Color Sampling (best paper award) | video |
Nicolas Bousquet, Louis Esperet and François Pirot | Distributed algorithms for fractional coloring | video |
Yi-Jun Chang, Jan Studený and Jukka Suomela | Distributed graph problems through an automata-theoretic lens | video |
Keren Censor-Hillel, Yannic Maus and Volodymyr Polosukhin | Near-Optimal Scheduling in the Congested Clique | video |
16:00-16:30 Break
16:30-17:30 Session 2: Concurrency, Consensus and Dynamics
Session chair: Othon Michail
Antonio Fernandez Anta, Theophanis Hadjistasi, Chryssis Georgiou, Nicolas Nicolaou, Efstathios Stavrakis and Andria Tregeorgi | Fragmented Objects: Boosting Concurrency of Shared Large Objects | video |
Evangelos Kipouridis, Paul Spirakis and Kostas Tsichlas | Threshold-based Network Structural Dynamics | video |
Dan Alistarh, Faith Ellen and Joel Rybicki | Wait-free approximate agreement on graphs | video |
Sabrina Rashid, Gadi Taubenfeld and Ziv Bar-Joseph | The Epigenetic Consensus Problem | video |
17:30 – 18:30 Business meeting
Wednesday, June 30
14:00-15:00 SIROCCO Prize for Innovation Keynote
Session chair: Magnús M. Halldórsson
Friedhelm Meyer auf der Heide (University of Paderborn) | Continuous Strategies for Swarms of Mobile Robots (click for abstract) | video recording |
15:00-16:00 Session 3: Mobile Robots and Agents
Session chair: Sándor Fekete
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti and Mirko Rossi | New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem (best student paper award) | video |
Barun Gorain, Kaushik Mondal, Himadri Nayak and Supantha Pandit | Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs | video |
Henri Devillez, Beni Egressy, Robin Fritsch and Roger Wattenhofer | Two-Agent Tree Evacuation | video |
Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Ryan Killick, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov and Sunil Shende | Graph Exploration by Energy-Sharing Mobile Agents | video |
16:00-16:30 Break
16:30-17:30 Session 4: Security and Efficiency of Network Communication
Session chair: Boaz Patt-Shamir
Volker Turau | Synchronous Concurrent Broadcasts for Intermittent Channels with Bounded Capacities | video |
Giacomo Giuliari, Marc Wyss, Markus Legner and Adrian Perrig | GMA: A Pareto Optimal Distributed Resource-Allocation Algorithm | video |
Muhammad Khan and Nitin Vaidya | Testing Equality under the Local Broadcast Model | video |
Sergio Rajsbaum | A Distributed Computing Perspective of Unconditionally Secure Information Transmission in Russian Cards Problems | video |
17:30-18:30 Keynote 2
Session chair: Andrea W. Richa
Kenneth Cheung (NASA) | Structure Structuring Structures (click for abstract) | video recording (to appear) |
Thursday, July 1
14:00-15:00 Keynote 3
Session chair: Tomasz Jurdziński
Dan Alistarh (IST Austria) | Relaxed Semantics Scalable Distributed Algorithms and Systems (click for abstract) | video recording |
15:00-16:00 Session 5: Network and Graph Structures
Session chair: Jara Uitto
Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes and Oren Weimann | Fault-Tolerant Distance Labeling for Planar Graphs | video |
Christoph Lenzen and Hossein Vahidi | Approximate Minimum Directed Spanning Trees under Congestion | video |
Bogdan-Adrian Manghiuc | Distributed Detection of Clusters of Arbitrary Size | video |
Simeon Kublenz, Sebastian Siebertz and Alexandre Vigny | Constant round distributed domination on graph classes with bounded expansion | video |