Skip to Main Content
You are now in the main content area
SIROCCO 2025

SIROCCO 2025

Program & Accepted Papers

Program 

 

Sunday, June 1, 2025

Monday, June 2, 2025

  • 8-8:50am Registration
  • 8:50-9am Opening remarks
  • 9-10am Keynote Presentation
    • Hagit Attiya. A Gold Standard, but Not a Silver Bullet
  • 10-10:20am Coffee break
  • 10:20-11:25am Session 1 (Distributed Algorithms and Security) 
    • #2 Trisha Chakraborty, Abir Islam, Valerie King, Daniel Rayborn, Jared Saia and Maxwell Young. Bankrupting DoS Attackers
    • #60 Yackolley Amoussou-Guenou, Maurice Herlihy and Maria Potop-Butucaru. Asynchronous Byzantine Consensus with Trusted Monotonic Counters
    • #33 Mohamed Bakr, Samuel Baldwin, Cole Hausman and Edward Talmage (Brief Announcement): Relaxation for Efficient Asynchronous Queues
  • 11:25-11:45am Coffee break
  • 11:45am-12:50pm Session 2 (Distributed Graph Algorithms) 
    • #47 Ravi Boppana and Magnús M. Halldórsson. Approximating Independent Sets in a Single Round
    • #45 Keren Censor-Hillel, Tomer Even, Maxime Flin and Magnús Halldórsson. When MIS and Maximal Matching are Easy in the Congested Clique
    • #10 Yuki Kawashima, Naoki Kitamura, Taisuke Izumi and Toshimitsu Masuzawa. (Brief Announcement): Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model
  • 12:50-2:30pm Lunch
  • 2:30-3:20pm Session 3 (Topology and Epistemic Modeling) 
    • #39 Hagit Attiya, Pierre Fraigniaud, Ami Paz and Sergio Rajsbaum. On the Existence of Extension-Based Proofs of Impossibility for Set-Agreement
    • #27 Christian Cachin, David Lehnherr and Thomas. Studer Simplicial Belief
  • 3:20-3:40pm Coffee break
  • 3:40-4:20pm Session 4 (Epistemic logic and topology) 
    • #26 Mirko Tagliaferri, Alessandro Aldini, Agata Ciabattoni and Dominik Pichler. Support + Belief = Decision Trust
    • #48 Stephan Felber, Bernardo Hummes Flores and Hugo Rincon-Galeana. (Brief announcement): A Sheaf-Theoretic Characterization of Tasks in Distributed Systems
  • 5-7:30pm Excursion (Delphi archeological site)

 

Tuesday, June 3, 2025

  • 9-10am Keynote Presentation
    • Joseph Halpern. Actual Causality: A Survey
  • 10-10:20am Coffee break
  • 10:20-11:25am Session 5 (Distributed Graph Algorithms)
    • #51 Yi-Jun Chang, Varsha Dani and Thomas Hayes. Low-Distortion Clustering in Bounded Growth Graphs
    • #49 Vignesh Manoharan and Vijaya Ramachandran. Distributed Distance Sensitivity Oracles
    • #32 Hugo Mirault, Peter Robinson, Ming Ming Tan and Xianbin Zhu. (Brief Announcement): Perfect Matching with Few Link Activations
  • 11:25-11:45am Coffee break
  • 11:45am-13:00pm Session 6 (Mobile Agents)
    • #13 James Conley and Konstantinos Georgiou. Multi-Agent Disk Inspection
    • #14 Mohamed Anouar Baaziz and Andrzej Pelc. Exploration of Convex Terrains by a Deterministic Automaton with Pebbles
    • #50 Jared Coleman, Dmitry Ivanov, Evangelos Kranakis, Danny Krizanc and Oscar Morales Ponce. Multimodal Search on a Line
  • 1:00-2:30pm Lunch
  • 2:30-3:45pm Session 7 (Communication and Circuit Complexity)
    • #25 Toni Böhnlein, Pál András Papp and Albert-Jan N. Yzelman. Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
    • #52 Orr Fischer, Rotem Oshman, Adi Rosen and Tal Roth. Pointer Chasing with Unlimited Interaction
    • #58 Nikos Leonardos. Lower bounds for uniform read-once threshold formulae in the randomized decision tree model
  • 3:45-4:05pm Coffee break
  • 4:05-4:55pm Award talk
    • Sergio Rajsbaum. Title TBA
  • 4:55-5:45pm Business meeting
  • 7-9pm banquet (Epikouros Restaurant (external link, opens in new window) )

 

Wednesday, June 4, 2025

  • 9-10am Keynote Presentation
    • Christos Papadimitriou. Computing with Dynamical Systems: Game Theory and the Brain
  • 10-10:20am Coffee break
  • 10:20-11:35am Session 8 (Mobile Agents)
    • #54 François Bonnet, Quentin Bramas, Pierre Courtieu, Xavier Défago, Lionel Rieg, Sebastien Tixeuil and Xavier Urbain. Deterministic Color-optimal Self-stabilizing Semi-synchronous Gathering: a Certified Algorithm
    • #5 Raphael Gerlach, Sören von der Gracht and Michael Dellnitz. On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies
    • #16 Yuichi Sudo, Fukuhito Ooshita and Sayaka Kamei. Self-stabilizing Graph Exploration by a Single Agent
  • 11:35-11:55am Coffee break
  • 11:55am-12:45pm Session 9 (Graph Problems and Algorithms) 
    • #59 Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela and Hossein Vahidi. Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity
    • #65 Borna Šimić and Roger Wattenhofer. Labeling Embeddings of Planar Graphs for Face-Adjacency
  • 12:45-2:30pm Lunch
  • 2:30-3:20pm Session 10 (Mobile Agents) 
    • #9 Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Masahiro Shibata and Sebastien Tixeuil. A Visibility vs. Memory Trade-off for Stand-Up Indulgent Gathering on Lines
    • #36 Paola Flocchini, Alfredo Navarra, Debasish Pattanayak, Francesco Piselli and Nicola Santoro. Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation
  • 3:20-3:40pm Coffee break
  • 3:40-4:30pm Session 11 (Mobile Agents)
    • #53 Balasingham Balamohan, Stefan Dobrev, Paola Flocchini and Nicola Santoro. Explicit Token-Based Communication for Mobile Entities
    • #17 Takumi Araya and Yuichi Sudo. Sublinear-time Collision Detection with a Polynomial Number of States in Population Protocols
  • 4:30-4:40pm Closing remarks

 

 

Accepted Papers

 

List of accepted full papers

List of accepted brief announcements (short papers)

  • Mohamed Bakr, Samuel Baldwin, Cole Hausman and Edward Talmage. Relaxation for Efficient Asynchronous Queues
  • Hugo Mirault, Peter Robinson, Ming Ming Tan and Xianbin Zhu. Perfect Matching with Few Link Activations
  • Yuki Kawashima, Naoki Kitamura, Taisuke Izumi and Toshimitsu Masuzawa. Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model
  • Stephan Felber, Bernardo Hummes Flores and Hugo Rincon-Galeana. A Sheaf-Theoretic Characterization of Tasks in Distributed Systems

Co-Organizer

Our Supporters