28th International Colloquium on Structural Information and Communication Complexity
 
SIROCCO 2021

Conference Program

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 NolinSuperfast Coloring in CONGEST via Efficient Color Sampling
(best paper award)
video
Nicolas Bousquet, Louis Esperet and François PirotDistributed algorithms for fractional coloringvideo
Yi-Jun Chang, Jan Studený and Jukka SuomelaDistributed graph problems through an automata-theoretic lensvideo
Keren Censor-Hillel, Yannic Maus and Volodymyr PolosukhinNear-Optimal Scheduling in the Congested Cliquevideo
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 Objectsvideo
Evangelos Kipouridis, Paul Spirakis and Kostas TsichlasThreshold-based Network Structural Dynamicsvideo
Dan Alistarh, Faith Ellen and Joel RybickiWait-free approximate agreement on graphsvideo
Sabrina Rashid, Gadi Taubenfeld and Ziv Bar-JosephThe Epigenetic Consensus Problemvideo
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 RossiNew Approximation Algorithms for the Heterogeneous Weighted Delivery Problem
(best student paper award)
video
Barun Gorain, Kaushik Mondal, Himadri Nayak and Supantha PanditPebble Guided Near Optimal Treasure Hunt in Anonymous Graphsvideo
Henri Devillez, Beni Egressy, Robin Fritsch and Roger WattenhoferTwo-Agent Tree Evacuationvideo
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 Agentsvideo
16:00-16:30 Break

16:30-17:30 Session 4: Security and Efficiency of Network Communication

Session chair: Boaz Patt-Shamir

Volker TurauSynchronous 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 Algorithmvideo
Muhammad Khan and Nitin VaidyaTesting Equality under the Local Broadcast Modelvideo
Sergio RajsbaumA 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 Graphsvideo
Christoph Lenzen and Hossein VahidiApproximate Minimum Directed Spanning Trees under Congestionvideo
Bogdan-Adrian ManghiucDistributed Detection of Clusters of Arbitrary Sizevideo
Simeon Kublenz, Sebastian Siebertz and Alexandre VignyConstant round distributed domination on graph classes
with bounded expansion
video
16:00-16:30 Closing of the conference