Structural Information and Communication Complexity

• Sebastian Forster

  Distributed Laplacian Solving with Applications
  
  

• Laurent Feuilloley

  Local certification meets model checking
  
  

10:00-10:30 Break

10:30-12:30 Session 1: Labeling Schemes

• Yoav Ben Shimon, Orr Fischer and Rotem Oshman.
  Proof Labeling Schemes for Reachability-Related Problems in Directed Graphs
  
  (Best Paper and Best Student Paper).
  
  
• Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport and Ioan Todinca.
  A Meta-Theorem for Distributed Certification.
  
  
• Benjamín Jauregui, Pedro Montealegre and Ivan Rapaport.
  Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes.
  
  
• Niels Gleinig and Torsten Hoefler.
  The Red-Blue Pebble Game on Trees and DAGs with Large Input.
  
  

• Kevin Buchin, Paola Flocchini, Irina Kostitsyna, Tom Peters, Nicola Santoro and Koichi Wada.
  On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis.
  
  
• Giuseppe F. Italiano, Debasish Pattanayak and Gokarna Sharma.
  Dispersion of Mobile Robots on Directed Anonymous Graphs.
  
  
• Francesco d'Amore and Isabella Ziccardi.
  Phase Transition of the 3-Majority Dynamics with Uniform Communication Noise.
  
  
• Toni Böhnlein, Sapir Erlich, Zvi Lotker and Dror Rawitz.
  Randomized Strategies for Non-Additive 3-Slope Ski Rental.
  
  

• Michal Dory

  Fault-Tolerant Labeling and Compact Routing Schemes
  
  

• Goran Zuzic

  Universal optimality in distributed computing and its connections to diverse areas of theoretical computer science
  
  

• Alkida Balliu, Juho Hirvonen, Darya Melnyk, Dennis Olivetti, Joel Rybicki and Jukka Suomela.
  Local Mending.
  
  
• Ozan Heydt, Sebastian Siebertz and Alexandre Vigny
  Local planar domination revisited
  
  
• Volker Turau.
  Fixed Points and 2-Cycles of Synchronous Dynamic Coloring Processes on Trees.
  
  
• Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca and Thomas Sauerwald.
  Accelerated Information Dissemination on Networks with Local and Global Edges.
  
  

• Koko Nanahji.
  Exactly Optimal Deterministic Radio Broadcasting with Collision Detection.
  
  
• Edward Talmage.
  Lower Bounds on Message Passing Implementations of Multiplicity-Relaxed Queues and Stacks.
  
  
• Damien Imbs, Michel Raynal and Gadi Taubenfeld. Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms.
  
  
• Juan Villacis-Llobet, Binh-Minh Bui-Xuan and Maria Potop-Butucaru.
  Foremost non-stop journey arrival date in linear time.