default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th OPODIS 2023: Tokyo, Japan
- Alysson Bessani
, Xavier Défago, Junya Nakamura, Koichi Wada, Yukiko Yamauchi:
27th International Conference on Principles of Distributed Systems, OPODIS 2023, December 6-8, 2023, Tokyo, Japan. LIPIcs 286, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-308-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Vincent Gramoli:
From Consensus Research to Redbelly Network Pty Ltd (Invited Talk). 1:1-1:2 - François Le Gall:
Quantum Distributed Computing: Potential and Limitations (Invited Talk). 2:1-2:1 - Roger Wattenhofer:
Distributed Algorithms as a Gateway To Deductive Learning (Invited Talk). 3:1-3:1 - Hagit Attiya, Antonella Del Pozzo, Alessia Milani, Ulysse Pavloff, Alexandre Rapetti:
The Synchronization Power of Auditable Registers. 4:1-4:23 - Caterina Feletti, Carlo Mereghetti, Beatrice Palano:
𝒪(log{n})-Time Uniform Circle Formation for Asynchronous Opaque Luminous Robots. 5:1-5:21 - Hagit Attiya, Jennifer L. Welch:
Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. 6:1-6:23 - Jamison W. Weber, Tishya Chhabra, Andréa W. Richa, Joshua J. Daymude:
Energy-Constrained Programmable Matter Under Unfair Adversaries. 7:1-7:21 - Andrei Constantinescu, Diana Ghinea, Lioba Heimbach, Zilin Wang, Roger Wattenhofer:
A Fair and Resilient Decentralized Clock Network for Transaction Ordering. 8:1-8:20 - Lewis Tseng, Callie Sardina:
Byzantine Consensus in Abstract MAC Layer. 9:1-9:16 - Colin Cooper, Tomasz Radzik, Takeharu Shiraga:
Discrete Incremental Voting. 10:1-10:22 - Juho Hirvonen, Laura Schmid, Krishnendu Chatterjee, Stefan Schmid:
On the Convergence Time in Graphical Games: A Locality-Sensitive Approach. 11:1-11:24 - Orestis Alpos, Ignacio Amores-Sesar, Christian Cachin, Michelle Yeo:
Eating Sandwiches: Modular and Lightweight Elimination of Transaction Reordering Attacks. 12:1-12:22 - Charlie Carlson, Daniel Frishberg, Eric Vigoda:
Improved Distributed Algorithms for Random Colorings. 13:1-13:18 - Andrew Lewis-Pye, Ittai Abraham:
Fever: Optimal Responsive View Synchronisation. 14:1-14:16 - Ramy Fakhoury, Anastasia Braginsky, Idit Keidar, Yoav Zuriel:
Nova: Safe Off-Heap Memory Allocation and Reclamation. 15:1-15:20 - Yuval Gil:
Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs. 16:1-16:20 - Shalom M. Asbell, Eric Ruppert:
A Wait-Free Deque With Polylogarithmic Step Complexity. 17:1-17:22 - Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil:
Reliable Broadcast Despite Mobile Byzantine Faults. 18:1-18:23 - Ariel Livshits, Yoram Moses:
Probable Approximate Coordination. 19:1-19:21 - Junghyun Lee, Laura Schmid, Se-Young Yun:
Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex Networks. 20:1-20:25 - Alejandro Naser-Pastoriza, Gregory V. Chockler, Alexey Gotsman:
Fault-Tolerant Computing with Unreliable Channels. 21:1-21:21 - Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran:
Local Recurrent Problems in the SUPPORTED Model. 22:1-22:19 - Jämes Ménétrey, Aeneas Grüter, Peterson Yuhala, Julius Oeftiger, Pascal Felber, Marcelo Pasin, Valerio Schiavoni:
A Holistic Approach for Trustworthy Distributed Systems with WebAssembly and TEEs. 23:1-23:23 - Tomer Lev Lehman, Hagit Attiya, Danny Hendler:
Recoverable and Detectable Self-Implementations of Swap. 24:1-24:22 - Alfredo Navarra, Francesco Piselli:
Silent Programmable Matter: Coating. 25:1-25:17 - Shay Kutten, Peter Robinson, Ming Ming Tan:
Tight Bounds on the Message Complexity of Distributed Tree Verification. 26:1-26:22 - Eden Aldema Tshuva, Rotem Oshman:
On Polynomial Time Local Decision. 27:1-27:17 - Paola Flocchini, Nicola Santoro, Yuichi Sudo, Koichi Wada:
On Asynchrony, Memory, and Communication: Separations and Landscapes. 28:1-28:23 - Ittai Abraham, Naama Ben-David, Gilad Stern, Sravya Yandamuri:
On the Round Complexity of Asynchronous Crusader Agreement. 29:1-29:21 - Avinandan Das, Pierre Fraigniaud, Adi Rosén:
Distributed Partial Coloring via Gradual Rounding. 30:1-30:22 - João Paulo Bezerra, Petr Kuznetsov:
A Tight Bound on Multiple Spending in Decentralized Cryptocurrencies. 31:1-31:19 - Hagit Attiya, Jennifer L. Welch:
Bounds on Worst-Case Responsiveness for Agreement Algorithms. 32:1-32:22 - Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Black Hole Search in Dynamic Rings: The Scattered Case. 33:1-33:18 - Rana Shahout, Roy Friedman:
Sketching the Path to Efficiency: Lightweight Learned Cache Replacement. 34:1-34:21 - Vincent Kowalski, Achour Mostéfaoui, Matthieu Perrin:
Atomic Register Abstractions for Byzantine-Prone Distributed Systems. 35:1-35:20
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 2024-10-31 20:02 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:
