default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th OPODIS 2024: Lucca, Italy
- Silvia Bonomi
, Letterio Galletta, Etienne Rivière, Valerio Schiavoni:
28th International Conference on Principles of Distributed Systems, OPODIS 2024, Lucca, Italy, December 11-13, 2024. LIPIcs 324, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-360-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xvi
- Alysson Bessani:
The Power of Simplicity on Dependable Distributed Systems (Invited Talk). 1:1-1:1 - Paola Flocchini:
Distributed Computing by Mobile Robots: Expanding the Horizon (Invited Talk). 2:1-2:2 - Alberto Sonnino:
BFT Consensus: From Academic Paper to Mainnet (Invited Talk). 3:1-3:1 - Timothé Albouy, Antonio Fernández Anta, Chryssis Georgiou, Mathieu Gestin, Nicolas Nicolaou, Junlang Wang:
AMECOS: A Modular Event-Based Framework for Concurrent Object Specification. 4:1-4:29 - Sahil Dhoked, Ahmed Fahmy, Wojciech Golab, Neeraj Mittal:
RMR-Efficient Detectable Objects for Persistent Memory and Their Applications. 5:1-5:26 - Ahmed Fahmy, Wojciech Golab:
DULL: A Fast Scalable Detectable Unrolled Lock-Based Linked List. 6:1-6:25 - Ulysse Pavloff, Yackolley Amoussou-Guenou, Sara Tucci Piergiovanni:
Incentive Compatibility of Ethereum's PoS Consensus Protocol. 7:1-7:23 - Kenan Wood, Hammurabi Mendes, Jonad Pulaj:
Optimal Multilevel Slashing for Blockchains. 8:1-8:18 - Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil:
Crash-Tolerant Exploration of Trees by Energy-Sharing Mobile Agents. 9:1-9:16 - Giuseppe Antonio Di Luna, Giovanni Viglietta:
Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks. 10:1-10:17 - Younan Gao, Andrzej Pelc:
Gathering Teams of Deterministic Finite Automata on a Line. 11:1-11:17 - Fukuhito Ooshita, Naoki Kitamura, Ryota Eguchi, Michiko Inoue, Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata, Yuichi Sudo:
Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings. 12:1-12:16 - Raphael Gerlach, Sören von der Gracht, Christopher Hahn, Jonas Harbig, Peter Kling:
Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility. 13:1-13:28 - Timothé Albouy, Davide Frey, Ran Gelles, Carmit Hazay, Michel Raynal, Elad Michael Schiller, François Taïani, Vassilis Zikas:
Near-Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary. 14:1-14:29 - Mose Mizrahi Erbes, Roger Wattenhofer:
Quit-Resistant Reliable Broadcast and Efficient Terminating Gather. 15:1-15:22 - Thomas Locher:
Byzantine Reliable Broadcast with Low Communication and Time Complexity. 16:1-16:17 - Pritam Goswami, Adri Bhattacharya, Raja Das, Partha Sarathi Mandal:
Perpetual Exploration of a Ring in Presence of Byzantine Black Hole. 17:1-17:17 - Stephan Felber, Hugo Rincon Galeana:
Stabilizing Consensus Is Impossible in Lossy Iterated Immediate Snapshot Models. 18:1-18:16 - Yusong Shi, Weidong Liu:
A General Class of Reductions and Extension-Based Proofs. 19:1-19:17 - Nenad Milosevic, Daniel Cason, Zarko Milosevic, Fernando Pedone:
How Robust Are Synchronous Consensus Protocols? 20:1-20:25 - Sylvain Gay, Achour Mostéfaoui, Matthieu Perrin:
No Symmetric Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems. 21:1-21:20 - Mathieu Bacou:
FaaSLoad: Fine-Grained Performance and Resource Measurement for Function-As-a-Service. 22:1-22:21 - Diana Cohen, Roy Friedman, Rana Shahout:
Distributed Recoverable Sketches. 23:1-23:16 - Arash Pourdamghani, Chen Avin, Robert Sama, Maryam Shiran, Stefan Schmid:
Hash & Adjust: Competitive Demand-Aware Consistent Hashing. 24:1-24:23 - Rowdy Chotkan, Bart Cox, Vincent Rahli, Jérémie Decouchant:
Reliable Communication in Hybrid Authentication and Trust Models. 25:1-25:26 - Fabien Dufoulon, Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
The Singular Optimality of Distributed Computation in LOCAL. 26:1-26:17 - Anubhav Dhar, Eli Kujawa, Henrik Lievonen, Augusto Modanese, Mikail Muftuoglu, Jan Studený, Jukka Suomela:
Local Problems in Trees Across a Wide Range of Distributed Models. 27:1-27:17 - Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
How Local Constraints Influence Network Diameter and Applications to LCL Generalizations. 28:1-28:28 - Jacek Cichon, Dawid Dworzanski, Karol Gotfryd:
On Reliability of the Extrema Propagation Technique in Random Environment. 29:1-29:16 - Juho Hirvonen, Sara Ranjbaran:
Fast, Fair and Truthful Distributed Stable Matching for Common Preferences. 30:1-30:20 - João Paulo Bezerra, Veronika Anikina, Petr Kuznetsov, Liron Schiff, Stefan Schmid:
Dynamic Probabilistic Reliable Broadcast. 31:1-31:30 - Kenan Wood, Hammurabi Mendes, Jonad Pulaj:
Distributed Agreement in the Arrovian Framework. 32:1-32:18 - Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten:
Self-Stabilizing Fully Adaptive Maximal Matching. 33:1-33:21 - François Le Gall, Oran Nadler, Harumichi Nishimura, Rotem Oshman:
Quantum Simultaneous Protocols Without Public Coins Using Modified Equality Queries. 34:1-34:20 - Keren Censor-Hillel, Einav Huberman:
Near-Optimal Resilient Labeling Schemes. 35:1-35:22 - Vijeth Aradhya, Seth Gilbert, Thorsten Götte:
Distributed Branching Random Walks and Their Applications. 36:1-36:20 - Haruki Kanaya, Ryota Eguchi, Taisho Sasada, Michiko Inoue:
Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols. 37:1-37:17 - Aleksander Figiel, Janne H. Korhonen, Neil Olver, Stefan Schmid:
Efficient Algorithms for Demand-Aware Networks and a Connection to Virtual Network Embedding. 38:1-38:24
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-01-23 00:07 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
