LIPIcs, Volume 281, DISC 2023

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