@Proceedings{oshman:LIPIcs.DISC.2023,
title = {{LIPIcs, Volume 281, DISC 2023, Complete Volume}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {1--836},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023},
URN = {urn:nbn:de:0030-drops-191258},
doi = {10.4230/LIPIcs.DISC.2023},
annote = {Keywords: LIPIcs, Volume 281, DISC 2023, Complete Volume}
}
@InProceedings{oshman:LIPIcs.DISC.2023.0,
author = {Oshman, Rotem},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {0:i--0:xx},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.0},
URN = {urn:nbn:de:0030-drops-191265},
doi = {10.4230/LIPIcs.DISC.2023.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{abraham_et_al:LIPIcs.DISC.2023.1,
author = {Abraham, Ittai and Dolev, Danny and Eyal, Ittay and Halpern, Joseph Y.},
title = {{Colordag: An Incentive-Compatible Blockchain}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {1:1--1:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.1},
URN = {urn:nbn:de:0030-drops-191272},
doi = {10.4230/LIPIcs.DISC.2023.1},
annote = {Keywords: Game theory, incentives, blockchain}
}
@InProceedings{altisen_et_al:LIPIcs.DISC.2023.2,
author = {Altisen, Karine and Corbineau, Pierre and Devismes, St\'{e}phane},
title = {{Certified Round Complexity of Self-Stabilizing Algorithms}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {2:1--2:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.2},
URN = {urn:nbn:de:0030-drops-191284},
doi = {10.4230/LIPIcs.DISC.2023.2},
annote = {Keywords: Certification, proof assistant, Coq, self-stabilization, round complexity}
}
@InProceedings{appan_et_al:LIPIcs.DISC.2023.3,
author = {Appan, Ananya and Chandramouli, Anirudh and Choudhury, Ashish},
title = {{Network Agnostic Perfectly Secure MPC Against General Adversaries}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {3:1--3:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.3},
URN = {urn:nbn:de:0030-drops-191294},
doi = {10.4230/LIPIcs.DISC.2023.3},
annote = {Keywords: Verifiable Secret Sharing, Byzantine Agreement, Perfect Security}
}
@InProceedings{attiya_et_al:LIPIcs.DISC.2023.4,
author = {Attiya, Hagit and Fraigniaud, Pierre and Paz, Ami and Rajsbaum, Sergio},
title = {{One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {4:1--4:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.4},
URN = {urn:nbn:de:0030-drops-191304},
doi = {10.4230/LIPIcs.DISC.2023.4},
annote = {Keywords: Wait-free computing, lower bounds}
}
@InProceedings{attiya_et_al:LIPIcs.DISC.2023.5,
author = {Attiya, Hagit and Casta\~{n}eda, Armando and Nowak, Thomas},
title = {{Topological Characterization of Task Solvability in General Models of Computation}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {5:1--5:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.5},
URN = {urn:nbn:de:0030-drops-191315},
doi = {10.4230/LIPIcs.DISC.2023.5},
annote = {Keywords: task solvability, combinatorial topology, point-set topology}
}
@InProceedings{azouvi_et_al:LIPIcs.DISC.2023.6,
author = {Azouvi, Sarah and Goren, Guy and Heimbach, Lioba and Hicks, Alexander},
title = {{Base Fee Manipulation in Ethereum’s EIP-1559 Transaction Fee Mechanism}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {6:1--6:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.6},
URN = {urn:nbn:de:0030-drops-191325},
doi = {10.4230/LIPIcs.DISC.2023.6},
annote = {Keywords: blockchain, Ethereum, transaction fee mechanism, EIP-1559}
}
@InProceedings{balliu_et_al:LIPIcs.DISC.2023.7,
author = {Balliu, Alkida and Brandt, Sebastian and Kuhn, Fabian and Olivetti, Dennis and Schmid, Gustav},
title = {{On the Node-Averaged Complexity of Locally Checkable Problems on Trees}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {7:1--7:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.7},
URN = {urn:nbn:de:0030-drops-191330},
doi = {10.4230/LIPIcs.DISC.2023.7},
annote = {Keywords: distributed graph algorithms, locally checkable labelings, node-averaged complexity, trees}
}
@InProceedings{bampas_et_al:LIPIcs.DISC.2023.8,
author = {Bampas, Evangelos and Beauquier, Joffroy and Burman, Janna and Guy--Ob\'{e}, William},
title = {{Treasure Hunt with Volatile Pheromones}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {8:1--8:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.8},
URN = {urn:nbn:de:0030-drops-191343},
doi = {10.4230/LIPIcs.DISC.2023.8},
annote = {Keywords: Mobile Agents, Exploration, Search, Treasure Hunt, Pheromone, Evaporation}
}
@InProceedings{bendavid_et_al:LIPIcs.DISC.2023.9,
author = {Ben-David, Naama and Sela, Gal and Szekeres, Adriana},
title = {{The FIDS Theorems: Tensions Between Multinode and Multicore Performance in Transactional Systems}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {9:1--9:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.9},
URN = {urn:nbn:de:0030-drops-191355},
doi = {10.4230/LIPIcs.DISC.2023.9},
annote = {Keywords: transactions, distributed systems, parallel systems, impossibility results}
}
@InProceedings{blum_et_al:LIPIcs.DISC.2023.10,
author = {Blum, Erica and Boyle, Elette and Cohen, Ran and Liu-Zhang, Chen-Da},
title = {{Communication Lower Bounds for Cryptographic Broadcast Protocols}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {10:1--10:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.10},
URN = {urn:nbn:de:0030-drops-191361},
doi = {10.4230/LIPIcs.DISC.2023.10},
annote = {Keywords: broadcast, communication complexity, lower bounds, dishonest majority}
}
@InProceedings{cambus_et_al:LIPIcs.DISC.2023.11,
author = {Cambus, M\'{e}lanie and Kuhn, Fabian and Pai, Shreyas and Uitto, Jara},
title = {{Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {11:1--11:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.11},
URN = {urn:nbn:de:0030-drops-191378},
doi = {10.4230/LIPIcs.DISC.2023.11},
annote = {Keywords: Ruling Sets, Parallel Algorithms, Congested Clique, Massively Parallel Computing, Semi-Streaming}
}
@InProceedings{charronbost_et_al:LIPIcs.DISC.2023.12,
author = {Charron-Bost, Bernadette and Penet de Monterno, Louis},
title = {{Self-Stabilizing Clock Synchronization in Probabilistic Networks}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {12:1--12:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.12},
URN = {urn:nbn:de:0030-drops-191389},
doi = {10.4230/LIPIcs.DISC.2023.12},
annote = {Keywords: Self-stabilization, Clock synchronization, Probabilistic networks}
}
@InProceedings{civit_et_al:LIPIcs.DISC.2023.13,
author = {Civit, Pierre and Gilbert, Seth and Guerraoui, Rachid and Komatovic, Jovan and Monti, Matteo and Vidigueira, Manuel},
title = {{Every Bit Counts in Consensus}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {13:1--13:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.13},
URN = {urn:nbn:de:0030-drops-191399},
doi = {10.4230/LIPIcs.DISC.2023.13},
annote = {Keywords: Byzantine consensus, Bit complexity, Latency}
}
@InProceedings{cosson_et_al:LIPIcs.DISC.2023.14,
author = {Cosson, Romain and Massouli\'{e}, Laurent and Viennot, Laurent},
title = {{Efficient Collaborative Tree Exploration with Breadth-First Depth-Next}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {14:1--14:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.14},
URN = {urn:nbn:de:0030-drops-191409},
doi = {10.4230/LIPIcs.DISC.2023.14},
annote = {Keywords: collaborative exploration, online algorithms, trees, adversarial game, competitive analysis, robot swarms}
}
@InProceedings{coutouly_et_al:LIPIcs.DISC.2023.15,
author = {Coutouly, Yannis and Godard, Emmanuel},
title = {{A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {15:1--15:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.15},
URN = {urn:nbn:de:0030-drops-191417},
doi = {10.4230/LIPIcs.DISC.2023.15},
annote = {Keywords: topological methods, geometric simplicial complex, set-agreement}
}
@InProceedings{depres_et_al:LIPIcs.DISC.2023.16,
author = {D\'{e}pr\'{e}s, Mathilde and Most\'{e}faoui, Achour and Perrin, Matthieu and Raynal, Michel},
title = {{Send/Receive Patterns Versus Read/Write Patterns in Crash-Prone Asynchronous Distributed Systems}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {16:1--16:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.16},
URN = {urn:nbn:de:0030-drops-191420},
doi = {10.4230/LIPIcs.DISC.2023.16},
annote = {Keywords: Asynchrony, Atomicity, Broadcast abstraction, Characterization, Consensus, Crash failure, Distributed Computability, Distributed software engineering, Computability, Lattice agreement, Message-passing, Message pattern, Mutual exclusion, Quorum, Read/write pattern, Read/Write register, Test\&Set, Simplicity, Two-process communication}
}
@InProceedings{dhoked_et_al:LIPIcs.DISC.2023.17,
author = {Dhoked, Sahil and Golab, Wojciech and Mittal, Neeraj},
title = {{Modular Recoverable Mutual Exclusion Under System-Wide Failures}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {17:1--17:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.17},
URN = {urn:nbn:de:0030-drops-191431},
doi = {10.4230/LIPIcs.DISC.2023.17},
annote = {Keywords: mutual exclusion, shared memory, persistent memory, fault tolerance, system-wide failure, RMR complexity, dynamic joining, dynamic leaving}
}
@InProceedings{diluna_et_al:LIPIcs.DISC.2023.18,
author = {Di Luna, Giuseppe A. and Viglietta, Giovanni},
title = {{Optimal Computation in Leaderless and Multi-Leader Disconnected Anonymous Dynamic Networks}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {18:1--18:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.18},
URN = {urn:nbn:de:0030-drops-191442},
doi = {10.4230/LIPIcs.DISC.2023.18},
annote = {Keywords: anonymous dynamic network, leaderless network, disconnected network, history tree}
}
@InProceedings{flin_et_al:LIPIcs.DISC.2023.19,
author = {Flin, Maxime and Halld\'{o}rsson, Magn\'{u}s M. and Nolin, Alexandre},
title = {{Fast Coloring Despite Congested Relays}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {19:1--19:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.19},
URN = {urn:nbn:de:0030-drops-191453},
doi = {10.4230/LIPIcs.DISC.2023.19},
annote = {Keywords: CONGEST model, distributed graph coloring, power graphs}
}
@InProceedings{fraigniaud_et_al:LIPIcs.DISC.2023.20,
author = {Fraigniaud, Pierre and Mazoit, Fr\'{e}d\'{e}ric and Montealegre, Pedro and Rapaport, Ivan and Todinca, Ioan},
title = {{Distributed Certification for Classes of Dense Graphs}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {20:1--20:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.20},
URN = {urn:nbn:de:0030-drops-191467},
doi = {10.4230/LIPIcs.DISC.2023.20},
annote = {Keywords: CONGEST, Proof Labelling Schemes, clique-width, MSO}
}
@InProceedings{frey_et_al:LIPIcs.DISC.2023.21,
author = {Frey, Davide and Gestin, Mathieu and Raynal, Michel},
title = {{The Synchronization Power (Consensus Number) of Access-Control Objects: the Case of AllowList and DenyList}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {21:1--21:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.21},
URN = {urn:nbn:de:0030-drops-191473},
doi = {10.4230/LIPIcs.DISC.2023.21},
annote = {Keywords: Access control, AllowList/DenyList, Blockchain, Consensus number, Distributed objects, Modularity, Privacy, Synchronization power}
}
@InProceedings{fuchs_et_al:LIPIcs.DISC.2023.22,
author = {Fuchs, Marc and Kuhn, Fabian},
title = {{List Defective Colorings: Distributed Algorithms and Applications}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {22:1--22:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.22},
URN = {urn:nbn:de:0030-drops-191484},
doi = {10.4230/LIPIcs.DISC.2023.22},
annote = {Keywords: distributed coloring, list coloring, defective coloring}
}
@InProceedings{grunau_et_al:LIPIcs.DISC.2023.23,
author = {Grunau, Christoph and Latypov, Rustam and Maus, Yannic and Pai, Shreyas and Uitto, Jara},
title = {{Conditionally Optimal Parallel Coloring of Forests}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {23:1--23:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.23},
URN = {urn:nbn:de:0030-drops-191494},
doi = {10.4230/LIPIcs.DISC.2023.23},
annote = {Keywords: massively parallel computation, coloring, forests, optimal}
}
@InProceedings{guerraoui_et_al:LIPIcs.DISC.2023.24,
author = {Guerraoui, Rachid and Kermarrec, Anne-Marie and Kucherenko, Anastasiia and Pinot, Rafael and Voitovych, Sasha},
title = {{On the Inherent Anonymity of Gossiping}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {24:1--24:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.24},
URN = {urn:nbn:de:0030-drops-191504},
doi = {10.4230/LIPIcs.DISC.2023.24},
annote = {Keywords: Gossip protocol, Source anonymity, Differential privacy}
}
@InProceedings{jayanti_et_al:LIPIcs.DISC.2023.25,
author = {Jayanti, Prasad and Jayanti, Siddhartha and Jayanti, Sucharita},
title = {{Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {25:1--25:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.25},
URN = {urn:nbn:de:0030-drops-191510},
doi = {10.4230/LIPIcs.DISC.2023.25},
annote = {Keywords: durable, recoverable, detectable, persistent memory, dynamic joining, LL/SC, CAS}
}
@InProceedings{keidar_et_al:LIPIcs.DISC.2023.26,
author = {Keidar, Idit and Naor, Oded and Poupko, Ouri and Shapiro, Ehud},
title = {{Cordial Miners: Fast and Efficient Consensus for Every Eventuality}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {26:1--26:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.26},
URN = {urn:nbn:de:0030-drops-191525},
doi = {10.4230/LIPIcs.DISC.2023.26},
annote = {Keywords: Byzantine Fault Tolerance, State Machine Replication, DAG, Consensus, Blockchain, Blocklace, Cordial Dissemination}
}
@InProceedings{kostitsyna_et_al:LIPIcs.DISC.2023.27,
author = {Kostitsyna, Irina and Peters, Tom and Speckmann, Bettina},
title = {{Fast Reconfiguration for Programmable Matter}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {27:1--27:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.27},
URN = {urn:nbn:de:0030-drops-191533},
doi = {10.4230/LIPIcs.DISC.2023.27},
annote = {Keywords: Programmable matter, amoebot model, shape reconfiguration}
}
@InProceedings{li_et_al:LIPIcs.DISC.2023.28,
author = {Li, Xiao and Chan, Eric and Lesani, Mohsen},
title = {{Quorum Subsumption for Heterogeneous Quorum Systems}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {28:1--28:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.28},
URN = {urn:nbn:de:0030-drops-191541},
doi = {10.4230/LIPIcs.DISC.2023.28},
annote = {Keywords: Distributed Systems, Impossibility Results, Byzantine fault tolerance}
}
@InProceedings{miller_et_al:LIPIcs.DISC.2023.29,
author = {Miller, Avery and Pelc, Andrzej},
title = {{Fast Deterministic Rendezvous in Labeled Lines}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {29:1--29:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.29},
URN = {urn:nbn:de:0030-drops-191550},
doi = {10.4230/LIPIcs.DISC.2023.29},
annote = {Keywords: rendezvous, deterministic algorithm, mobile agent, labeled line, graph colouring}
}
@InProceedings{nataf_et_al:LIPIcs.DISC.2023.30,
author = {Nataf, Ra\"{i}ssa and Goren, Guy and Moses, Yoram},
title = {{Null Messages, Information and Coordination}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {30:1--30:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.30},
URN = {urn:nbn:de:0030-drops-191564},
doi = {10.4230/LIPIcs.DISC.2023.30},
annote = {Keywords: null messages, fault tolerance, coordination, information flow, knowledge analysis}
}
@InProceedings{pu_et_al:LIPIcs.DISC.2023.31,
author = {Pu, Youer and Farahbakhsh, Ali and Alvisi, Lorenzo and Eyal, Ittay},
title = {{Gorilla: Safe Permissionless Byzantine Consensus}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {31:1--31:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.31},
URN = {urn:nbn:de:0030-drops-191579},
doi = {10.4230/LIPIcs.DISC.2023.31},
annote = {Keywords: Consensus, Permissionless, Blockchains, Byzantine fault tolerance, Deterministic Safety}
}
@InProceedings{robinson:LIPIcs.DISC.2023.32,
author = {Robinson, Peter},
title = {{Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL Problems}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {32:1--32:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.32},
URN = {urn:nbn:de:0030-drops-191589},
doi = {10.4230/LIPIcs.DISC.2023.32},
annote = {Keywords: Distributed graph algorithm, graph sketching, streaming}
}
@InProceedings{taubenfeld:LIPIcs.DISC.2023.33,
author = {Taubenfeld, Gadi},
title = {{Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility Results}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {33:1--33:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.33},
URN = {urn:nbn:de:0030-drops-191599},
doi = {10.4230/LIPIcs.DISC.2023.33},
annote = {Keywords: anonymous shared memory, memory-anonymous algorithms, anonymous registers, starvation-free mutual exclusion}
}
@InProceedings{tran_et_al:LIPIcs.DISC.2023.34,
author = {Tran, Anh and Talmage, Edward},
title = {{Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity Queues}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {34:1--34:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.34},
URN = {urn:nbn:de:0030-drops-191609},
doi = {10.4230/LIPIcs.DISC.2023.34},
annote = {Keywords: Distributed Data Structures, ADTs, Lower Bounds, Shifting Arguments, Multiplicity Queues}
}
@InProceedings{aksenov_et_al:LIPIcs.DISC.2023.35,
author = {Aksenov, Vitaly and Anoprenko, Michael and Fedorov, Alexander and Spear, Michael},
title = {{Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {35:1--35:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.35},
URN = {urn:nbn:de:0030-drops-191612},
doi = {10.4230/LIPIcs.DISC.2023.35},
annote = {Keywords: Concurrency, Synchronization, Locality}
}
@InProceedings{attiya_et_al:LIPIcs.DISC.2023.36,
author = {Attiya, Hagit and Welch, Jennifer L.},
title = {{Brief Announcement: Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {36:1--36:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.36},
URN = {urn:nbn:de:0030-drops-191620},
doi = {10.4230/LIPIcs.DISC.2023.36},
annote = {Keywords: graded broadcast, gradecast, binding, approximate agreement}
}
@InProceedings{chen_et_al:LIPIcs.DISC.2023.37,
author = {Chen, Michael and Pavan, A. and Vinodchandran, N. V.},
title = {{Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {37:1--37:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.37},
URN = {urn:nbn:de:0030-drops-191634},
doi = {10.4230/LIPIcs.DISC.2023.37},
annote = {Keywords: Massively Parallel Computation, AMPC, Complexity Classes, LogSpace, NL, PSPACE}
}
@InProceedings{chouinard_et_al:LIPIcs.DISC.2023.38,
author = {Chouinard, Jakeb and Kansara, Kush and Liu, Xialin and Potdar, Nihal and Golab, Wojciech},
title = {{Brief Announcement: On Implementing Wear Leveling in Persistent Synchronization Structures}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {38:1--38:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.38},
URN = {urn:nbn:de:0030-drops-191640},
doi = {10.4230/LIPIcs.DISC.2023.38},
annote = {Keywords: persistent memory, transactional memory, wear leveling, atomic counter, concurrency, fault tolerance, theory}
}
@InProceedings{cohen_et_al:LIPIcs.DISC.2023.39,
author = {Cohen, Shir and Keidar, Idit},
title = {{Brief Announcement: Subquadratic Multivalued Asynchronous Byzantine Agreement WHP}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {39:1--39:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.39},
URN = {urn:nbn:de:0030-drops-191658},
doi = {10.4230/LIPIcs.DISC.2023.39},
annote = {Keywords: Byzantine agreement, subquadratic communication, fault tolerance in distributed systems}
}
@InProceedings{dahal_et_al:LIPIcs.DISC.2023.40,
author = {Dahal, Sameep and d'Amore, Francesco and Lievonen, Henrik and Picavet, Timoth\'{e} and Suomela, Jukka},
title = {{Brief Announcement: Distributed Derandomization Revisited}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {40:1--40:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.40},
URN = {urn:nbn:de:0030-drops-191660},
doi = {10.4230/LIPIcs.DISC.2023.40},
annote = {Keywords: Distributed algorithm, Derandomization, LOCAL model}
}
@InProceedings{gafni_et_al:LIPIcs.DISC.2023.41,
author = {Gafni, Eli and Losa, Giuliano},
title = {{Brief Announcement: Byzantine Consensus Under Dynamic Participation with a Well-Behaved Majority}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {41:1--41:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.41},
URN = {urn:nbn:de:0030-drops-191675},
doi = {10.4230/LIPIcs.DISC.2023.41},
annote = {Keywords: Consensus, Sleepy Model, Dynamic Participation, Byzantine Failures}
}
@InProceedings{gelles_et_al:LIPIcs.DISC.2023.42,
author = {Gelles, Yuval and Komargodski, Ilan},
title = {{Brief Announcement: Scalable Agreement Protocols with Optimal Optimistic Efficiency}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {42:1--42:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.42},
URN = {urn:nbn:de:0030-drops-191684},
doi = {10.4230/LIPIcs.DISC.2023.42},
annote = {Keywords: Byzantine Agreement, Consensus, Optimistic-Pessimistic, Secure Multi-Party Computation}
}
@InProceedings{leinweber_et_al:LIPIcs.DISC.2023.43,
author = {Leinweber, Marc and Hartenstein, Hannes},
title = {{Brief Announcement: Let It TEE: Asynchronous Byzantine Atomic Broadcast with n ≥ 2f+1}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {43:1--43:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.43},
URN = {urn:nbn:de:0030-drops-191694},
doi = {10.4230/LIPIcs.DISC.2023.43},
annote = {Keywords: Byzantine Fault Tolerance, Trusted Execution Environments, Asynchrony}
}
@InProceedings{levlehman_et_al:LIPIcs.DISC.2023.44,
author = {Lev Lehman, Tomer and Attiya, Hagit and Hendler, Danny},
title = {{Brief Announcement: Recoverable and Detectable Self-Implementations of Swap}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {44:1--44:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.44},
URN = {urn:nbn:de:0030-drops-191704},
doi = {10.4230/LIPIcs.DISC.2023.44},
annote = {Keywords: Persistent memory, non-volatile memory, recoverable objects, detectablitly}
}
@InProceedings{navarra_et_al:LIPIcs.DISC.2023.45,
author = {Navarra, Alfredo and Piselli, Francesco},
title = {{Brief Announcement: Line Formation in Silent Programmable Matter}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {45:1--45:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.45},
URN = {urn:nbn:de:0030-drops-191715},
doi = {10.4230/LIPIcs.DISC.2023.45},
annote = {Keywords: Programmable Matter, Line formation, Asynchrony, Stigmergy}
}
@InProceedings{ovens:LIPIcs.DISC.2023.46,
author = {Ovens, Sean},
title = {{Brief Announcement: The Space Complexity of Set Agreement Using Swap}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {46:1--46:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.46},
URN = {urn:nbn:de:0030-drops-191725},
doi = {10.4230/LIPIcs.DISC.2023.46},
annote = {Keywords: space complexity, consensus, set agreement, lower bound, shared memory}
}
@InProceedings{shapiro:LIPIcs.DISC.2023.47,
author = {Shapiro, Ehud},
title = {{Brief Announcement: Grassroots Distributed Systems: Concept, Examples, Implementation and Applications}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {47:1--47:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.47},
URN = {urn:nbn:de:0030-drops-191735},
doi = {10.4230/LIPIcs.DISC.2023.47},
annote = {Keywords: Grassroots Distributed Systems, Dissemination Protocol, Multiagent Transition Systems, Blocklace, Cordial Dissemination}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing