LIPIcs, Volume 281
DISC 2023, October 10-12, 2023, L'Aquila, Italy
Editors: Rotem Oshman
LIPIcs, Volume 184
OPODIS 2020, December 14-16, 2020, Strasbourg, France (Virtual Conference)
Editors: Quentin Bramas, Rotem Oshman, and Paolo Romano
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 1-836, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 0:i-0:xx, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
Ittai Abraham, Danny Dolev, Ittay Eyal, and Joseph Y. Halpern. Colordag: An Incentive-Compatible Blockchain. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 1:1-1:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
Karine Altisen, Pierre Corbineau, and Stéphane Devismes. Certified Round Complexity of Self-Stabilizing Algorithms. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 2:1-2:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
Ananya Appan, Anirudh Chandramouli, and Ashish Choudhury. Network Agnostic Perfectly Secure MPC Against General Adversaries. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 3:1-3:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
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. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 4:1-4:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
Hagit Attiya, Armando Castañeda, and Thomas Nowak. Topological Characterization of Task Solvability in General Models of Computation. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 5:1-5:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
Sarah Azouvi, Guy Goren, Lioba Heimbach, and Alexander Hicks. Base Fee Manipulation in Ethereum’s EIP-1559 Transaction Fee Mechanism. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 6:1-6:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, and Gustav Schmid. On the Node-Averaged Complexity of Locally Checkable Problems on Trees. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 7:1-7:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
Evangelos Bampas, Joffroy Beauquier, Janna Burman, and William Guy--Obé. Treasure Hunt with Volatile Pheromones. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 8:1-8:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
Naama Ben-David, Gal Sela, and Adriana Szekeres. The FIDS Theorems: Tensions Between Multinode and Multicore Performance in Transactional Systems. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 9:1-9:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
Erica Blum, Elette Boyle, Ran Cohen, and Chen-Da Liu-Zhang. Communication Lower Bounds for Cryptographic Broadcast Protocols. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 10:1-10:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
Mélanie Cambus, Fabian Kuhn, Shreyas Pai, and Jara Uitto. Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 11:1-11:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Feedback for Dagstuhl Publishing