Sunday, May 13, 2018

[DMANET] Call for Participation: SIROCCO 2018, June 18-21, 2018, Ma'ale HaHamisha, Israel

Call for Participation and Registration: 25th International Colloquium on
Information and Communication Complexity
(SIROCCO 2018)

June 18-21, 2018, Ma'ale HaHamisha, Israel


* Claire Mathieu, CNRS & ENS, Paris,
* Kurt Mehlhorn, MPI, Saarbrucken,
* David Peleg, WIS, Rehovot, and
* Seth Pettie, University of Michigan.


Early registration (regular 250 EUR, student 150 EUR) is until May 20.
Late registration (regular 350 EUR, student 250 EUR) is froml May 21.

Registration is made via the following link


* Ryan Killick, Jurek Czyzowicz, Konstantinos Georgiou, Evangelos
Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny and Sunil Shende
Priority Evacuation from a Disk Using Mobile Robots

* Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum and
Nayuta Yanagisawa
A Characterization of t-Resilient Solvable Colorless Tasks in
Anonymous Shared-Memory Model

* Marcin Bienkowski, Artur Kraska and Paweł Schmidt
Online service with delay on a line

* Tal Navon and David Peleg
Mixed Fault Tolerance in Server Assignment: Combining Reinforcement
and Backup

* Ravi B. Boppana, Magnus M. Halldorsson and Dror Rawitz
Simple and Local Independent Set Approximation

* Ulrich Schmid and Manfred Schwarz
On the Strongest Message Adversary for Consensus in Directed Dynamic

* Konstantinos Georgiou, Jay Griffiths and Yuval Yakubov
Symmetric Rendezvous With Advice: How to Rendezvous in a Disk

* Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport and Ioan
Two Rounds are Enough for Reconstructing any Graph (Class) in the
Congested Clique Model

* Masahiro Shibata, Hirotsugu Kakugawa and Toshimitsu Masuzawa
Space-efficient Uniform Deployment of Mobile Agents in Asynchronous
Unidirectional Rings

* Andrzej Pelc
Explorable Families of Graphs

* Fabian Kuhn, Yannic Maus and Simon Weidner
Deterministic Distributed Ruling Sets of Line Graphs

* Ran Ben Basat, Guy Even, Ken-Ichi Kawarabayashi and Gregory
A Deterministic Distributed $2$-Approximation for Weighted Vertex
Cover in $O(\log n\log\Delta / \log^2\log\Delta)$ Rounds

* Tomasz Jurdzinski, Krzysztof Loryś and Krzysztof Nowicki
Communication Complexity in Vertex Partition Whiteboard Model

* Krzysztof Nowicki and Tomasz Jurdzinski
Connectivity and Minimum Cut Approximation in the Broadcast
Congested Clique

* Ryan Killick, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc and
Oscar Morales Ponce
Gathering in the Plane of Location-Aware Robots in the Presence of

* Jurek Czyzowicz, Krzysztof Diks, Jean Moussi and Wojciech Rytter
Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree

* Volker Turau
A Distributed Algorithm for Finding Hamiltonian Cycles in Random
Graphs in O(log n) Time

* Gennaro Cordasco, Luisa Gargano, Joseph Peters, Adele Rescigno and
Ugo Vaccaro
Time-Bounded Influence Diffusion with Incentives

* Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi and
Pratik Sarkar
Crash-tolerant Consensus in Directed Graph Revisited

* Yves Mocquard, Bruno Sericola and Emmanuelle Anceaume
Balanced allocations and global clock in population protocols: An
accurate analysis

* Vidhya Tekken Valapil and Sandeep Kulkarni
Biased Clocks: A Novel Approach to Improve the Ability to Perform
Predicate Detection with O(1) Clocks

* Daniel Pfleger and Ulrich Schmid
On Knowledge and Communication Complexity in Distributed Systems

* Pavel Chuprikov, Alex Davydow, Kirill Kogan, Sergey Nikolenko and
Alexander Sirotkin
Formalizing Compute-Aggregate Problems in Cloud Computing

+ Othon Michail, Paul Spirakis and Michail Theofilatos
Fast Approximate Counting and Leader Election in Populations

+ Yefim Dinitz, Shlomi Dolev and Daniel Khankin
Make&Activate-Before-Break: Policy Preserving Seamless Routes
Replacement in SDN

+ Mark Korenblit
One-Max Constant-Probability Networks: Results and Future Work

+ George Manoussakis, Johanne Cohen, Laurence Pilard and Devan Sohier
A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model

+ Yuichi Sudo, Ajoy K. Datta, Lawrence Larmore and Toshimitsu Masuzawa
Constant-Space Self-Stabilizing Token Distribution in Trees

+ Vitalii Demianiuk, Sergey Gorinsky, Sergey Nikolenko and Kirill Kogan
Distributed Counting along Lossy Paths without Feedback

+ Anaïs Durand and Shay Kutten
Snap-stabilizing Quiescence Detection of Diffusing Computations

+ Dor Bank, Moshe Sulamy and Eyal Waserman
Reaching Distributed Equilibrium with Limited ID Space

* Contributions to be spread via DMANET are submitted to
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.