Abstract is missing.
- Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal GraphsArnaud Casteigts, Timothée Corsini, Writika Sarkar. 3-18 [doi]
- Invited Paper: One Bit Agent Memory is Enough for Snap-Stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable CyclesKohei Shimoyama, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa. 19-34 [doi]
- Invited Paper: Towards Practical Atomic Distributed Shared Memory: An Experimental EvaluationAndria Trigeorgi, Nicolas Nicolaou, Chryssis Georgiou, Theophanis Hadjistasi, Efstathios Stavrakis, Viveck R. Cadambe, Bhuvan Urgaonkar. 35-50 [doi]
- Invited Paper: Cross-Chain State Machine ReplicationYingjie Xue, Maurice Herlihy. 51-65 [doi]
- Plateau: A Secure and Scalable Overlay Network for Large Distributed Trust ApplicationsJohn Augustine, Wahid Gulzar Bhat, Sandip Nair. 69-83 [doi]
- The Limits of Helping in Non-volatile Memory Data StructuresOhad Ben-Baruch, Srivatsan Ravi. 84-98 [doi]
- Treasure Hunt in Graph Using PebblesAdri Bhattacharya, Barun Gorain, Partha Sarathi Mandal 0001. 99-113 [doi]
- Blockchain in Dynamic NetworksRachel Bricker, Mikhail Nesterenko, Gokarna Sharma. 114-129 [doi]
- Improving the Efficiency of Report and Trace Ring SignaturesXavier Bultel, Ashley Fraser, Elizabeth A. Quaglia. 130-145 [doi]
- Flexible Scheduling of Transactional Memory on TreesCostas Busch, Bogdan S. Chlebus, Maurice Herlihy, Miroslav Popovic, Pavan Poudel, Gokarna Sharma. 146-163 [doi]
- Perpetual Torus Exploration by Myopic Luminous RobotsOmar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas, Anissa Lamani, Anaïs Durand, Pascal Lafourcade 0001. 164-177 [doi]
- Optimal Algorithms for Synchronous Byzantine k-Set AgreementCarole Delporte-Gallet, Hugues Fauconnier, Michel Raynal, Mouna Safir. 178-192 [doi]
- Reaching Consensus in the Presence of Contention-Related Crash FailuresAnaïs Durand, Michel Raynal, Gadi Taubenfeld. 193-205 [doi]
- Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable BroadcastRomaric Duvignau, Michel Raynal, Elad Michael Schiller. 206-221 [doi]
- Capacity Planning for Dependable ServicesRasha Faqeh, André Martin, Valerio Schiavoni, Pramod Bhatotia, Pascal Felber, Christof Fetzer. 222-238 [doi]
- Lower Bound for Constant-Size Local CertificationVirgina Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond. 239-253 [doi]
- Collaborative Dispersion by Silent RobotsBarun Gorain, Partha Sarathi Mandal 0001, Kaushik Mondal 0001, Supantha Pandit. 254-269 [doi]
- Time Optimal Gathering of Myopic Robots on an Infinite Triangular GridPritam Goswami, Avisek Sharma, Satakshi Ghosh, Buddhadeb Sau. 270-284 [doi]
- Card-Based ZKP Protocol for NurimisakiLéo Robert, Daiki Miyahara, Pascal Lafourcade 0001, Takaaki Mizuki. 285-298 [doi]
- Consensus on DemandJakub Sliwinski, Yann Vonlanthen, Roger Wattenhofer. 299-313 [doi]
- Better Incentives for Proof-of-WorkJakub Sliwinski, Roger Wattenhofer. 314-328 [doi]
- Brief Announcement: Self Masking for Hardening InversionsPawel Cyprys, Shlomi Dolev, Shlomo Moran. 331-334 [doi]
- Brief Announcement: Dynamic Graph Models for the Bitcoin P2P Network: Simulation Analysis for Expansion and Flooding TimeAntonio Cruciani, Francesco Pasquale. 335-340 [doi]
- Brief Announcement: Fully Lattice Linear AlgorithmsArya Tanmay Gupta, Sandeep S. Kulkarni. 341-345 [doi]
- Brief Announcement: Distributed Reconfiguration of Spanning TreesSiddharth Gupta, Manish Kumar 0011, Shreyas Pai. 346-351 [doi]
- Brief Announcement: Mutually-Visible Uniform Circle Formation by Asynchronous Mobile Robots on Grid PlaneYoshiaki Ito, Yonghwan Kim 0001, Yoshiaki Katayama. 352-357 [doi]
- Brief Announcement: Self-stabilizing Total-Order BroadcastOskar Lundström, Michel Raynal, Elad Michael Schiller. 358-363 [doi]
- Brief Announcement: Secure and Efficient Participant Authentication - Application to Mobile E-VotingKun Peng. 364-369 [doi]