default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID37th DISC 2023: L'Aquila, Italy
- Rotem Oshman:
37th International Symposium on Distributed Computing, DISC 2023, October 10-12, 2023, L'Aquila, Italy. LIPIcs 281, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-301-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:20
- Ittai Abraham, Danny Dolev, Ittay Eyal, Joseph Y. Halpern:
Colordag: An Incentive-Compatible Blockchain. 1:1-1:22 - Karine Altisen, Pierre Corbineau, Stéphane Devismes:
Certified Round Complexity of Self-Stabilizing Algorithms. 2:1-2:22 - Ananya Appan, Anirudh Chandramouli, Ashish Choudhury:
Network Agnostic Perfectly Secure MPC Against General Adversaries. 3:1-3:19 - Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. 4:1-4:23 - Hagit Attiya, Armando Castañeda, Thomas Nowak:
Topological Characterization of Task Solvability in General Models of Computation. 5:1-5:21 - Sarah Azouvi, Guy Goren, Lioba Heimbach
, Alexander Hicks:
Base Fee Manipulation in Ethereum's EIP-1559 Transaction Fee Mechanism. 6:1-6:22 - Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid:
On the Node-Averaged Complexity of Locally Checkable Problems on Trees. 7:1-7:21 - Evangelos Bampas, Joffroy Beauquier, Janna Burman, William Guy-Obé:
Treasure Hunt with Volatile Pheromones. 8:1-8:21 - Naama Ben-David, Gal Sela, Adriana Szekeres:
The FIDS Theorems: Tensions Between Multinode and Multicore Performance in Transactional Systems. 9:1-9:24 - Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang:
Communication Lower Bounds for Cryptographic Broadcast Protocols. 10:1-10:19 - Mélanie Cambus, Fabian Kuhn, Shreyas Pai, Jara Uitto:
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem. 11:1-11:12 - Bernadette Charron-Bost, Louis Penet de Monterno:
Self-Stabilizing Clock Synchronization in Probabilistic Networks. 12:1-12:18 - Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Matteo Monti, Manuel Vidigueira:
Every Bit Counts in Consensus. 13:1-13:26 - Romain Cosson, Laurent Massoulié, Laurent Viennot:
Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. 14:1-14:21 - Yannis Coutouly, Emmanuel Godard:
A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement. 15:1-15:20 - Mathilde Déprés, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Send/Receive Patterns Versus Read/Write Patterns in Crash-Prone Asynchronous Distributed Systems. 16:1-16:24 - Sahil Dhoked, Wojciech Golab, Neeraj Mittal:
Modular Recoverable Mutual Exclusion Under System-Wide Failures. 17:1-17:24 - Giuseppe Antonio Di Luna, Giovanni Viglietta:
Optimal Computation in Leaderless and Multi-Leader Disconnected Anonymous Dynamic Networks. 18:1-18:20 - Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin:
Fast Coloring Despite Congested Relays. 19:1-19:24 - Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Certification for Classes of Dense Graphs. 20:1-20:17 - Davide Frey, Mathieu Gestin, Michel Raynal:
The Synchronization Power (Consensus Number) of Access-Control Objects: the Case of AllowList and DenyList. 21:1-21:23 - Marc Fuchs, Fabian Kuhn:
List Defective Colorings: Distributed Algorithms and Applications. 22:1-22:23 - Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto:
Conditionally Optimal Parallel Coloring of Forests. 23:1-23:20 - Rachid Guerraoui, Anne-Marie Kermarrec, Anastasiia Kucherenko, Rafaël Pinot, Sasha Voitovych:
On the Inherent Anonymity of Gossiping. 24:1-24:19 - Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti:
Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining. 25:1-25:20 - Idit Keidar, Oded Naor, Ouri Poupko, Ehud Shapiro:
Cordial Miners: Fast and Efficient Consensus for Every Eventuality. 26:1-26:22 - Irina Kostitsyna, Tom Peters, Bettina Speckmann:
Fast Reconfiguration for Programmable Matter. 27:1-27:21 - Xiao Li, Eric Chan, Mohsen Lesani:
Quorum Subsumption for Heterogeneous Quorum Systems. 28:1-28:19 - Avery Miller, Andrzej Pelc:
Fast Deterministic Rendezvous in Labeled Lines. 29:1-29:22 - Raïssa Nataf, Guy Goren, Yoram Moses:
Null Messages, Information and Coordination. 30:1-30:21 - Youer Pu, Ali Farahbakhsh, Lorenzo Alvisi, Ittay Eyal:
Gorilla: Safe Permissionless Byzantine Consensus. 31:1-31:16 - Peter Robinson:
Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL Problems. 32:1-32:21 - Gadi Taubenfeld:
Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility Results. 33:1-33:17 - Anh Tran, Edward Talmage:
Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity Queues. 34:1-34:20 - Vitaly Aksenov, Michael Anoprenko, Alexander Fedorov, Michael F. Spear:
Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures. 35:1-35:7 - Hagit Attiya, Jennifer L. Welch:
Brief Announcement: Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. 36:1-36:7 - Michael Chen, A. Pavan, N. V. Vinodchandran:
Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations. 37:1-37:7 - Jakeb Chouinard, Kush Kansara, Xialin Liu, Nihal Potdar, Wojciech Golab:
Brief Announcement: On Implementing Wear Leveling in Persistent Synchronization Structures. 38:1-38:7 - Shir Cohen, Idit Keidar:
Brief Announcement: Subquadratic Multivalued Asynchronous Byzantine Agreement WHP. 39:1-39:6 - Sameep Dahal, Francesco D'Amore, Henrik Lievonen, Timothé Picavet, Jukka Suomela:
Brief Announcement: Distributed Derandomization Revisited. 40:1-40:5 - Eli Gafni, Giuliano Losa:
Brief Announcement: Byzantine Consensus Under Dynamic Participation with a Well-Behaved Majority. 41:1-41:7 - Yuval Gelles, Ilan Komargodski:
Brief Announcement: Scalable Agreement Protocols with Optimal Optimistic Efficiency. 42:1-42:6 - Marc Leinweber, Hannes Hartenstein:
Brief Announcement: Let It TEE: Asynchronous Byzantine Atomic Broadcast with n ≥ 2f+1. 43:1-43:7 - Tomer Lev Lehman, Hagit Attiya, Danny Hendler:
Brief Announcement: Recoverable and Detectable Self-Implementations of Swap. 44:1-44:7 - Alfredo Navarra, Francesco Piselli:
Brief Announcement: Line Formation in Silent Programmable Matter. 45:1-45:8 - Sean Ovens:
Brief Announcement: The Space Complexity of Set Agreement Using Swap. 46:1-46:6 - Ehud Shapiro:
Brief Announcement: Grassroots Distributed Systems: Concept, Examples, Implementation and Applications. 47:1-47:7
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-11-08 20:40 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:
