Abstract is missing.
- Exploring Worst Cases of Self-stabilizing Algorithms Using SimulationsErwan Jahier, Karine Altisen, Stéphane Devismes. 1-17 [doi]
- Model Checking of Distributed Algorithms Using Synchronous ProgramsErwan Jahier, Karine Altisen, Stéphane Devismes, Gabriel B. Sant'Anna. 18-35 [doi]
- The Fence Complexity of Persistent SetsGaetano Coccimiglio, Trevor Brown 0001, Srivatsan Ravi. 36-51 [doi]
- Brief Announcement: Understanding Self-stabilizing Node-Capacitated Overlay Networks Through SimulationWinfred Afeaneku, Andrew Berns, Weston Kuchenberg, Sara Leisinger, Cedric Liu. 52-56 [doi]
- Brief Announcement: Byzantine-Tolerant Detection of Causality in Synchronous SystemsAnshuman Misra, Ajay D. Kshemkalyani. 57-61 [doi]
- Invited Paper: Time Is Not a Healer, but It Sure Makes Hindsight 20:20Eli Gafni, Giuliano Losa. 62-74 [doi]
- Adding Pull to Push Sum for Approximate Data AggregationSaptadi Nugroho, Alexander Weinmann, Christian Schindelhauer. 75-89 [doi]
- Exploring Trade-Offs in Partial Snapshot ImplementationsNikolaos D. Kallimanis, Eleni Kanellou, Charidimos Kiosterakis, Vasiliki Liagkou. 90-105 [doi]
- Brief Announcement: Non-blocking Dynamic Unbounded Graphs with Wait-Free SnapshotGaurav Bhardwaj, Sathya Peri, Pratik Shetty. 106-110 [doi]
- Byzantine Fault-Tolerant Causal Order Satisfying Strong SafetyAnshuman Misra, Ajay D. Kshemkalyani. 111-125 [doi]
- Improved Paths to Stability for the Stable Marriage ProblemVijay K. Garg, Changyong Hu. 126-140 [doi]
- Lattice Linearity of Multiplication and ModuloArya Tanmay Gupta, Sandeep S. Kulkarni. 141-156 [doi]
- The Fagnano Triangle Patrolling Problem (Extended Abstract)Konstantinos Georgiou, Somnath Kundu, Pawel Pralat. 157-171 [doi]
- Invited Paper: Monotonicity and Opportunistically-Batched Actions in DerechoKen Birman, Sagar Jha, Mae Milano, Lorenzo Rosa, Weijia Song, Edward Tremel. 172-190 [doi]
- Robust Overlays Meet Blockchains - On Handling High Churn and Catastrophic FailuresVijeth Aradhya, Seth Gilbert, Aquinas Hobor. 191-206 [doi]
- Disconnected Agreement in Networks Prone to Link FailuresBogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski, Jedrzej Olkowski. 207-222 [doi]
- Where Are the Constants? New Insights on the Role of Round Constant Addition in the SymSum DistinguisherSahiba Suryawanshi, Dhiman Saha. 223-239 [doi]
- Invited Paper: Detection of False Data Injection Attacks in Power Systems Using a Secured-Sensors and Graph-Based MethodGal Morgenstern, Lital Dabush, Jip Kim, James Anderson 0001, Gil Zussman, Tirza Routtenberg. 240-258 [doi]
- KerberSSIze Us: Providing Sovereignty to the PeopleRonald Petrlic, Christof Lange. 259-273 [doi]
- Hierarchical Identity-Based Inner Product Functional Encryption for Unbounded Hierarchical DepthAnushree Belel, Ratna Dutta, Sourav Mukhopadhyay. 274-288 [doi]
- Brief Announcement: Efficient Probabilistic Approximations for Sign and CompareDevharsh Trivedi. 289-296 [doi]
- Meeting Times of Non-atomic Random WalksRyota Eguchi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil. 297-311 [doi]
- Minimum Algorithm Sizes for Self-stabilizing Gathering and Related Problems of Autonomous Mobile Robots (Extended Abstract)Yuichi Asahiro, Masafumi Yamashita. 312-327 [doi]
- Separation of Unconscious Colored RobotsHirokazu Seike, Yukiko Yamauchi. 328-343 [doi]
- Forbidden Patterns in Temporal Graphs Resulting from Encounters in a CorridorMichel Habib, Minh-Hang Nguyen, Mikaël Rabie, Laurent Viennot. 344-358 [doi]
- Uniform k-Circle Formation by Fat RobotsBibhuti Das 0001, Krishnendu Mukhopadhyaya. 359-373 [doi]
- Brief Announcement: Rendezvous on a Known Dynamic Point in a Finite Unoriented GridPritam Goswami, Avisek Sharma, Satakshi Ghosh, Buddhadeb Sau. 374-379 [doi]
- Brief Announcement: Crash-Tolerant Exploration by Energy Sharing Mobile AgentsQuentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil. 380-384 [doi]
- Time-Optimal Geodesic Mutual Visibility of Robots on Grids Within Minimum AreaSerafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra. 385-399 [doi]
- Privacy in Population Protocols with Probabilistic SchedulingTalley Amir, James Aspnes. 400-413 [doi]
- Dispersion of Mobile Robots in Spite of FaultsDebasish Pattanayak, Gokarna Sharma, Partha Sarathi Mandal 0001. 414-429 [doi]
- Brief Announcement: Asynchronous Gathering of Finite Memory Robots on a Circle Under Limited VisibilitySatakshi Ghosh, Avisek Sharma, Pritam Goswami, Buddhadeb Sau. 430-434 [doi]
- Wait-Free Updates and Range Search Using UruvGaurav Bhardwaj, Bapi Chatterjee, Abhay Jain, Sathya Peri. 435-450 [doi]
- Stand-Up Indulgent Gathering on LinesQuentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil. 451-465 [doi]
- Offline Constrained Backward Time Travel PlanningQuentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil. 466-480 [doi]
- Machine Learning-Based Phishing Detection Using URL Features: A Comprehensive ReviewAsif Uz Zaman Asif, Hossein Shirazi, Indrakshi Ray. 481-497 [doi]
- Workflow Resilience for Mission Critical SystemsMahmoud Abdelgawad, Indrakshi Ray, Tomas Vasquez. 498-512 [doi]
- Invited Paper: How Do Humans Succeed in Tasks Like Proving Fermat's Theorem or Predicting the Higgs Boson?Leonid A. Levin. 513-517 [doi]
- Self-stabilizing Byzantine-Tolerant RecyclingChryssis Georgiou, Michel Raynal, Elad Michael Schiller. 518-535 [doi]
- Do Not Trust in Numbers: Practical Distributed Cryptography with General TrustOrestis Alpos, Christian Cachin. 536-551 [doi]
- Synergistic KnowledgeChristian Cachin, David Lehnherr, Thomas Studer. 552-567 [doi]
- Post-quantum Secure Stateful Deterministic Wallet from Code-Based Signature Featuring Uniquely Rerandomized KeysPratima Jana, Ratna Dutta. 568-582 [doi]
- Square Attacks on Reduced-Round FEA-1 and FEA-2Amit Kumar Chauhan, Abhishek Kumar 0002, Somitra Kumar Sanadhya. 583-597 [doi]
- Asynchronous Silent Programmable Matter: Line FormationAlfredo Navarra, Francesco Piselli. 598-612 [doi]