default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th SSS 2025: Kathmandu, Nepal
- Silvia Bonomi, Partha Sarathi Mandal, Peter Robinson, Gokarna Sharma, Sébastien Tixeuil
:
Stabilization, Safety, and Security of Distributed Systems - 27th International Symposium, SSS 2025, Kathmandu, Nepal, October 9-11, 2025, Proceedings. Lecture Notes in Computer Science 16350, Springer 2026, ISBN 978-3-032-11126-5 - John Augustine:
Keynote: Resilient Distributed Computing on External Data. 1-2 - Sonia Ben Mokhtar:
Keynote: On the Safety and Security of Decentralised Machine Learning. 3 - Ramesh Adhikari, Costas Busch, Dariusz R. Kowalski:
Near-Optimal Stability for Distributed Transaction Processing in Blockchain Sharding. 4-20 - Ramesh Adhikari, Costas Busch, Pavan Poudel:
A Poly-log Approximation for Transaction Scheduling in Fog-Cloud Computing and Beyond. 21-39 - Nada Almalki, Siddharth Gupta, Othon Michail, Andreas Padalkin:
Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. 40-55 - Parwat Singh Anjana, Srivatsan Ravi:
Block Transactional Memory: A Complexity Study. 56-75 - Omer Asher, Yefim Dinitz, Shlomi Dolev, Li-on Raviv, Baruch Schieber:
Brief Announcement: The Steiner Shortest Path Tree Problem. 76-81 - François Bonnet, Quentin Bramas, Anissa Lamani:
Brief Announcement: Searching for an Eventually-Emerging Black Hole in Rings. 82-87 - Quentin Bramas:
Brief Announcement: Consensus in Systems with Eventual Quiescence. 88-92 - Mélanie Cambus, Darya Melnyk:
Centroid Approximation with Multidimensional Approximate Agreement Protocols. 93-110 - Prabhat Kumar Chand, Manish Kumar, Anisur Rahaman Molla:
Computing Tree Structures in Anonymous Graphs via Mobile Agents. 111-127 - Yung-Fu Chen, Sen Lin, Anish Arora:
Knowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing. 128-145 - Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Brief Announcement: On the Impact of Unlimited Computational Power in 풪: Consequences for Synchronous Robots on Graphs. 146-152 - Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Gathering in Non-vertex-Transitive Graphs Under Round Robin. 153-170 - Bibhuti Das, Barun Gorain, Kaushik Mondal, Krishnendu Mukhopadhyaya, Supantha Pandit:
Optimal Dispersion of Silent Robots in a Ring. 171-191 - Stéphane Devismes, Swan Dubois, François Malenfer, Franck Petit, Mouna Safir:
Self-stabilizing Mutual Exclusion in Dynamic Networks with Bounded Temporal Diameter. 192-210 - Shlomi Dolev, Avraham Yagudaev, Moti Yung:
Brief Announcement: PQ-STAR Post-Quantum Stateless Auditable Rekeying. 211-215 - Caterina Feletti, Paola Flocchini, Nicola Santoro:
On the Computational Power of Mobile Robots Under Sequential Schedulers. 216-232 - Sucharita Jayanti, Maurice Herlihy:
Brief Announcement: Cross-Chain Consensus. 233-238 - Qingyun Ji, Darya Melnyk, Arash Pourdamghani, Stefan Schmid:
Invited Paper: Towards Demand-Aware Peer Selection with XOR-Based Routing. 239-252 - Pierre Jobic, Aurélien Mayoue, Sara Tucci Piergiovanni:
Label Leakage in Regression Federated Learning Using Cryptographic Tools. 253-269 - Haruki Kanaya, Ryota Eguchi, Taisho Sasada, Fukuhito Ooshita, Michiko Inoue:
Time and Space-Optimal Silent Self-stabilizing Exact Majority in Population Protocols. 270-286 - Arivarasan Karmegam, Gabina Luz Bianchi, Margarita Capretto, Martín Ceresa, Antonio Fernández Anta, César Sánchez:
Invited Paper: Setchain Algorithms for Blockchain Scalability. 287-302 - Sanyam Kaul, Manaswini Piduguralla, Gayathri Shreeya Patnala, Sathya Peri:
Brief Announcement: Dependency-Aware Execution Mechanism in Hyperledger Fabric Architecture. 303-308 - Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal, Kaushik Mondal:
Black Hole Search by Scattered Agents on Time-Varying Dynamic Graphs. 309-324 - Irina Kostitsyna, David Liedtke, Christian Scheideler:
Invited Paper: Distributed Rhombus Formation of Sliding Squares. 325-342 - Vincent Kowalski, Achour Mostéfaoui, Matthieu Perrin, Jolan Riallo:
Invited Paper: On the Equivalence of Snapshot/Append Objects and Broadcast Abstractions under Byzantine Failures. 343-358 - Ajay D. Kshemkalyani, Manaswini Piduguralla, Sathya Peri, Anshuman Misra:
Improving the Hu-Toueg Construction of a Byzantine Linearizable SWMR Register. 359-375 - Ajay D. Kshemkalyani, Anshuman Misra:
Deterministic Causal Order Under Byzantine Sybil Tolerance: Techniques and Limitations. 376-391 - Hao Lu, Jian Liu, Kui Ren:
Byzantine Reliable Broadcast in Wireless Networks. 392-407 - Shota Naito, Tsukasa Ninomiya, Koichi Wada:
Beyond Pairwise Comparisons: Unveiling Structural Landscape of Mobile Robot Models. 408-424 - Nischay Ranjan, Rohit Kapoor, Sathya Peri:
NestedBTO: A Timestamp-Based STM Protocol for Closed Nested Transactions with Opacity Guarantees. 425-441 - Avisek Sharma, Satakshi Ghosh, Buddhadeb Sau:
Gathering of Asynchronous Robots on Circle with Limited Visibility Using Finite Communication. 442-457 - Guillermo Toyos-Marfurt, Petr Kuznetsov:
Space-Time Trade-Off in Bounded Iterated Memory. 458-474
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-09 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
