Dear community,

The 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems is planned for November 17-20, 2021 (via Zoom).

The list of accepted papers for SSS 2021 is available below, as well as online:
http://www.cse.chalmers.se/~elad/SSS2021/Papers.html

The technical program can be found at:
http://www.cse.chalmers.se/~elad/SSS2021/Program.pdf

The list of keynote talks is given below as well as via the following link:
http://www.cse.chalmers.se/~elad/SSS2021/Keynote.html

The registration server is also up:
http://www.cse.chalmers.se/~elad/SSS2021/Registration.html

There are no registration fees to SSS 2021. It would be great if you can register already today. Please register no later than Nov. 7th, 2021

Best regards,
Elad Michael Schiller
Colette Johnen
Stefan Schmid

===================

Keynote Talks:

Byzantine Agreement with Less Communication by Idit Keidar, Technion - Israel Institute of Technology, Israel

A Liquid Networking Approach to Delivering the Metaverse by Michael Luby, CEO, BitRIpple, Inc., USA

Ant Colony House-Hunting Algorithms by Nancy Lynch, Massachusetts Institute of Technology, USA

Locality in Computation by Ronitt Rubinfeld, Massachusetts Institute of Technology, USA

Actively Dynamic Networks by Paul Spirakis, University of Liverpool ,UK and University of Patras , Greece

Computational Complexity Theory for MapReduce by Jeffrey Ullman, Stanford University, USA



Invited papers:

Jiajia Zhao, Lili Su and Nancy Lynch. Lack of Quorum Sensing Leads to Failure of Consensus in Temnothorax Ant Emigration

Joshua Daymude, Noble Harasha, Andréa Richa and Ryan Yiu. Deadlock and Noise in Self-Organized Aggregation Without Computation

Manfred Schwarz and Ulrich Schmid. Round-Oblivious Stabilizing Consensus in Dynamic Networks

Burcu Canakci, Lorenzo Alvisi and Robbert Van Renesse. Building Systems of Systems with Escher

Yehuda Afek, Gal Giladi and Boaz Patt-Shamir. Distributed Computing With the Cloud

Timothé Albouy, Davide Frey, Michel Raynal and Francois Taiani. Byzantine-tolerant reliable broadcast in the presence of silent churn

Vijay Garg. A Lattice Linear Predicate Parallel Algorithm for the Housing Market Problem

Pierre Fraigniaud. How Do Mobile Agents Benefit From Randomness?

Michael Fischer, Jonathan Hochman and Daniel Boffa. Privacy-Preserving Sharing of Medical Data for Research

Teruo Higashino, Akira Uchiyama, Hirozumi Yamaguchi, Shunsuke Saruwatari, Takashi Watanabe and Toshimitsu Masuzawa. A New Problem Setting for Mobile Robots based on
Backscatter-based Communication and Sensing

Ivan Geffner and Joseph Halpern. Security in Asynchronous Interactive Systems

Jakub Sliwinski and Roger Wattenhofer. Asynchronous Proof-of-Stake

Daniel Engel, Maurice Herlihy and Yingjie Xue. Failure is (literally) an Option: Atomic Commitment vs Optionality in Decentralized Finance

Alexander Schwarzmann. Towards a Robust Distributed Framework for Election-Day Voter Check-in



Regular papers:

Masahiro Shibata, Yuichi Sudo, Junya Nakamura and Yonghwan Kim. Partial gathering of mobile agents in dynamic rings

Zoe Leyva-Acosta, Eduardo Pascual-Aseff and Sergio Rajsbaum. Information Exchange in the Russian Cards Problem

Archak Das, Kaustav Bose and Buddhadeb Sau. Exploring a Dynamic Ring without Landmark

Louis Penet de Monterno, Bernadette Charron-Bost and Stephan Merz. Synchronization modulo k in Dynamic Networks

Rikuo Nakai, Yuichi Sudo and Koichi Wada. Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights

Rongcheng Dong, Yuichi Sudo, Taisuke Izumi and Toshimitsu Masuzawa. Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications

Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita and Koichi Wada. Location Functions for Self-Stabilizing Byzantine Tolerant Swarms

Quentin Bramas, Anissa Lamani and Sebastien Tixeuil. The agreement power of disagreement

Andrew Berns. Network Scaffolding for Efficient Stabilization of the Chord Overlay Network

Andrew Berns. Applications and Implications of a General Framework for Self-Stabilizing Overlay Networks

Dingyu Wang. Optimal Protocols for 2-Party Contention Resolution

Karim Eldefrawy, Nicholas Genise, Rutuja Kshirsagar and Moti Yung. On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications

Arya Gupta and Sandeep Kulkarni. Extending Lattice linearity for Self-Stabilizing Algorithms

Pedro Montealegre, Diego Ramírez-Romero and Ivan Rapaport. Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs

Jannik Castenow, Thorsten Götte, Till Knollmann and Friedhelm Meyer Auf der Heide. The Max-Line-Formation Problem and new Insights for Gathering and Chain-Formation

Jared Coleman, Evangelos Kranakis, Oscar Morales Ponce and Danny Krizanc. Message Delivery in the plane by Robots with Different Speeds


Brief Announcements:

Michael Feldmann, Andreas Padalkin, Christian Scheideler and Shlomi Dolev. Coordinating Amoebots via Reconfigurable Circuits

Rory Hector, Ramachandran Vaidyanathan, Gokarna Sharma and Jerry Trahan. On Optimal Doorway Egress by Autonomous Robots

Amos Brocco. Delta-State JSON CRDT: Putting Collaboration on Solid Ground

Yukiko Yamauchi, Naoyuki Kamiyama and Yota Otachi. Transitivity in Distributed Systems by Exchange Property of Matroid Bases

Matan Rusanovsky, Hagit Attiya, Danny Hendler, Tom Gerby, Ohad Ben-Baruch and Pedro Ramalhete. Flat-Combining-Based Persistent Data Structures for Non-Volatile Memory

Kaile Huang, Hengfeng Wei, Yu Huang, Haixiang Li and Anqun Pan. Byz-GentleRain: An Efficient Byzantine-tolerant Causal Consistency Protocol

Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sebastien Tixeuil and Xavier Urbain. Computer Aided Formal Design of Swarm Robotics Algorithms

Shlomi Dolev and Ziyu Wang. SodsBC/SodsBC++ \& SodsMPC: Post-quantum Asynchronous Blockchain Suit for Consensus and Smart Contracts

Amr Osman, Jeannine Born and Thorsten Strufe. Mitigating Internal, Stealthy Denial of Service Attacks in Microservice Networks

Johanne Cohen, Laurence Pilard and Jonas Sénizergues. Self-Stabilization and Byzantine Tolerance for Maximal Independant Set

############################


You can unsubscribe at any time through this link:

https://optout.acm.org/unsubscribe.cfm?rl=PODC&RE=&UEMAIL;