@Proceedings{scheideler:LIPIcs.DISC.2022,
title = {{LIPIcs, Volume 246, DISC 2022, Complete Volume}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {1--790},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022},
URN = {urn:nbn:de:0030-drops-171908},
doi = {10.4230/LIPIcs.DISC.2022},
annote = {Keywords: LIPIcs, Volume 246, DISC 2022, Complete Volume}
}
@InProceedings{scheideler:LIPIcs.DISC.2022.0,
author = {Scheideler, Christian},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {0:i--0:xx},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.0},
URN = {urn:nbn:de:0030-drops-171917},
doi = {10.4230/LIPIcs.DISC.2022.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{assadi:LIPIcs.DISC.2022.1,
author = {Assadi, Sepehr},
title = {{Graph Coloring, Palette Sparsification, and Beyond}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.1},
URN = {urn:nbn:de:0030-drops-171920},
doi = {10.4230/LIPIcs.DISC.2022.1},
annote = {Keywords: Graph coloring, Palette Sparsification, Sublinear Algorithms}
}
@InProceedings{baldoni:LIPIcs.DISC.2022.2,
author = {Baldoni, Roberto},
title = {{Managing the Cyber Risk in a Decoupled World: Does This Bring Potential Opportunities in Computer Science?}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.2},
URN = {urn:nbn:de:0030-drops-171931},
doi = {10.4230/LIPIcs.DISC.2022.2},
annote = {Keywords: Supply chain decoupling, technology risk, cyber attacks, computing paradigms and methodologies}
}
@InProceedings{welch:LIPIcs.DISC.2022.3,
author = {Welch, Jennifer L.},
title = {{Using Linearizable Objects in Randomized Concurrent Programs}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.3},
URN = {urn:nbn:de:0030-drops-171946},
doi = {10.4230/LIPIcs.DISC.2022.3},
annote = {Keywords: Concurrent objects, strong linearizability, impossibility proofs, message-passing systems, randomized algorithms}
}
@InProceedings{albouy_et_al:LIPIcs.DISC.2022.4,
author = {Albouy, Timoth\'{e} and Frey, Davide and Raynal, Michel and Ta\"{i}ani, Fran\c{c}ois},
title = {{Good-Case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {4:1--4:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.4},
URN = {urn:nbn:de:0030-drops-171953},
doi = {10.4230/LIPIcs.DISC.2022.4},
annote = {Keywords: Reliable Broadcast, Byzantine Faults, Synchronous Systems, Good-case latency, Deterministic Algorithms}
}
@InProceedings{amram_et_al:LIPIcs.DISC.2022.5,
author = {Amram, Gal and Hayoun, Avi and Mizrahi, Lior and Weiss, Gera},
title = {{Polynomial-Time Verification and Testing of Implementations of the Snapshot Data Structure}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {5:1--5:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.5},
URN = {urn:nbn:de:0030-drops-171964},
doi = {10.4230/LIPIcs.DISC.2022.5},
annote = {Keywords: Snapshot, Linearizability, Verification, Formal Methods}
}
@InProceedings{anagnostides_et_al:LIPIcs.DISC.2022.6,
author = {Anagnostides, Ioannis and Lenzen, Christoph and Haeupler, Bernhard and Zuzic, Goran and Gouleakis, Themis},
title = {{Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {6:1--6:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.6},
URN = {urn:nbn:de:0030-drops-171978},
doi = {10.4230/LIPIcs.DISC.2022.6},
annote = {Keywords: Distributed algorithms, Laplacian solvers, low-congestion shortcuts}
}
@InProceedings{augustine_et_al:LIPIcs.DISC.2022.7,
author = {Augustine, John and Molla, Anisur Rahaman and Pandurangan, Gopal and Vasudev, Yadu},
title = {{Byzantine Connectivity Testing in the Congested Clique}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {7:1--7:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.7},
URN = {urn:nbn:de:0030-drops-171987},
doi = {10.4230/LIPIcs.DISC.2022.7},
annote = {Keywords: Byzantine protocols, distributed graph algorithms, congested clique, graph connectivity, fault-tolerant computation, randomized algorithms}
}
@InProceedings{balliu_et_al:LIPIcs.DISC.2022.8,
author = {Balliu, Alkida and Brandt, Sebastian and Chang, Yi-Jun and Olivetti, Dennis and Studen\'{y}, Jan and Suomela, Jukka},
title = {{Efficient Classification of Locally Checkable Problems in Regular Trees}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {8:1--8:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.8},
URN = {urn:nbn:de:0030-drops-171993},
doi = {10.4230/LIPIcs.DISC.2022.8},
annote = {Keywords: locally checkable labeling, locality, distributed computational complexity}
}
@InProceedings{balliu_et_al:LIPIcs.DISC.2022.9,
author = {Balliu, Alkida and Brandt, Sebastian and Fischer, Manuela and Latypov, Rustam and Maus, Yannic and Olivetti, Dennis and Uitto, Jara},
title = {{Exponential Speedup over Locality in MPC with Optimal Memory}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {9:1--9:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.9},
URN = {urn:nbn:de:0030-drops-172003},
doi = {10.4230/LIPIcs.DISC.2022.9},
annote = {Keywords: Distributed computing, Locally checkable labeling problems, Trees, Massively Parallel Computation, Sublinear memory}
}
@InProceedings{bertrand_et_al:LIPIcs.DISC.2022.10,
author = {Bertrand, Nathalie and Gramoli, Vincent and Konnov, Igor and Lazi\'{c}, Marijana and Tholoniat, Pierre and Widder, Josef},
title = {{Holistic Verification of Blockchain Consensus}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {10:1--10:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.10},
URN = {urn:nbn:de:0030-drops-172019},
doi = {10.4230/LIPIcs.DISC.2022.10},
annote = {Keywords: Model checking, automata, logic, byzantine failure}
}
@InProceedings{bhagat_et_al:LIPIcs.DISC.2022.11,
author = {Bhagat, Subhash and Pelc, Andrzej},
title = {{How to Meet at a Node of Any Connected Graph}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {11:1--11:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.11},
URN = {urn:nbn:de:0030-drops-172024},
doi = {10.4230/LIPIcs.DISC.2022.11},
annote = {Keywords: Algorithm, graph, rendezvous, mobile agent, terrain}
}
@InProceedings{bravo_et_al:LIPIcs.DISC.2022.12,
author = {Bravo, Manuel and Chockler, Gregory and Gotsman, Alexey},
title = {{Liveness and Latency of Byzantine State-Machine Replication}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {12:1--12:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.12},
URN = {urn:nbn:de:0030-drops-172037},
doi = {10.4230/LIPIcs.DISC.2022.12},
annote = {Keywords: Replication, blockchain, partial synchrony, liveness}
}
@InProceedings{camaioni_et_al:LIPIcs.DISC.2022.13,
author = {Camaioni, Martina and Guerraoui, Rachid and Monti, Matteo and Vidigueira, Manuel},
title = {{Oracular Byzantine Reliable Broadcast}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {13:1--13:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.13},
URN = {urn:nbn:de:0030-drops-172048},
doi = {10.4230/LIPIcs.DISC.2022.13},
annote = {Keywords: Byzantine reliable broadcast, Good-case complexity, Amortized complexity, Batching}
}
@InProceedings{civit_et_al:LIPIcs.DISC.2022.14,
author = {Civit, Pierre and Dzulfikar, Muhammad Ayaz and Gilbert, Seth and Gramoli, Vincent and Guerraoui, Rachid and Komatovic, Jovan and Vidigueira, Manuel},
title = {{Byzantine Consensus Is \Theta(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony!}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {14:1--14:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.14},
URN = {urn:nbn:de:0030-drops-172059},
doi = {10.4230/LIPIcs.DISC.2022.14},
annote = {Keywords: Optimal Byzantine consensus, Communication complexity, Latency complexity}
}
@InProceedings{civit_et_al:LIPIcs.DISC.2022.15,
author = {Civit, Pierre and Potop-Butucaru, Maria},
title = {{Dynamic Probabilistic Input Output Automata}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {15:1--15:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.15},
URN = {urn:nbn:de:0030-drops-172064},
doi = {10.4230/LIPIcs.DISC.2022.15},
annote = {Keywords: Automata, Distributed Computing, Formal Verification, Dynamic systems}
}
@InProceedings{dani_et_al:LIPIcs.DISC.2022.16,
author = {Dani, Varsha and Hayes, Thomas P.},
title = {{How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {16:1--16:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.16},
URN = {urn:nbn:de:0030-drops-172071},
doi = {10.4230/LIPIcs.DISC.2022.16},
annote = {Keywords: Radio Networks, Low Energy Computation, Clustering}
}
@InProceedings{demarco_et_al:LIPIcs.DISC.2022.17,
author = {De Marco, Gianluca and Kowalski, Dariusz R. and Stachowiak, Grzegorz},
title = {{Contention Resolution Without Collision Detection: Constant Throughput And Logarithmic Energy}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {17:1--17:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.17},
URN = {urn:nbn:de:0030-drops-172081},
doi = {10.4230/LIPIcs.DISC.2022.17},
annote = {Keywords: Shared channel, Contention resolution, Throughput, Energy consumption, Randomized algorithms, Lower bound}
}
@InProceedings{dinitz_et_al:LIPIcs.DISC.2022.18,
author = {Dinitz, Michael and Fineman, Jeremy and Gilbert, Seth and Newport, Calvin},
title = {{Smoothed Analysis of Information Spreading in Dynamic Networks}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {18:1--18:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.18},
URN = {urn:nbn:de:0030-drops-172094},
doi = {10.4230/LIPIcs.DISC.2022.18},
annote = {Keywords: Smoothed Analysis, Dynamic networks, Gossip}
}
@InProceedings{dufoulon_et_al:LIPIcs.DISC.2022.19,
author = {Dufoulon, Fabien and Kutten, Shay and Moses Jr., William K. and Pandurangan, Gopal and Peleg, David},
title = {{An Almost Singularly Optimal Asynchronous Distributed MST Algorithm}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {19:1--19:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.19},
URN = {urn:nbn:de:0030-drops-172107},
doi = {10.4230/LIPIcs.DISC.2022.19},
annote = {Keywords: Asynchronous networks, Minimum Spanning Tree, Distributed Algorithm, Singularly Optimal}
}
@InProceedings{emek_et_al:LIPIcs.DISC.2022.20,
author = {Emek, Yuval and Gil, Yuval and Kutten, Shay},
title = {{Locally Restricted Proof Labeling Schemes}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {20:1--20:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.20},
URN = {urn:nbn:de:0030-drops-172111},
doi = {10.4230/LIPIcs.DISC.2022.20},
annote = {Keywords: proof labeling schemes, generic compilers, SLOCAL algorithms}
}
@InProceedings{eppstein_et_al:LIPIcs.DISC.2022.21,
author = {Eppstein, David and Khodabandeh, Hadi},
title = {{Distributed Construction of Lightweight Spanners for Unit Ball Graphs}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {21:1--21:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.21},
URN = {urn:nbn:de:0030-drops-172129},
doi = {10.4230/LIPIcs.DISC.2022.21},
annote = {Keywords: spanners, doubling metrics, distributed, topology control}
}
@InProceedings{fischer_et_al:LIPIcs.DISC.2022.22,
author = {Fischer, Manuela and Giliberti, Jeff and Grunau, Christoph},
title = {{Improved Deterministic Connectivity in Massively Parallel Computation}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {22:1--22:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.22},
URN = {urn:nbn:de:0030-drops-172138},
doi = {10.4230/LIPIcs.DISC.2022.22},
annote = {Keywords: Massively Parallel Computation, MPC, MapReduce, Deterministic Algorithms, Connectivity, Hitting Set, Maximum Matching, Derandomization}
}
@InProceedings{fraigniaud_et_al:LIPIcs.DISC.2022.23,
author = {Fraigniaud, Pierre and Lambein-Monette, Patrick and Rabie, Mika\"{e}l},
title = {{Fault Tolerant Coloring of the Asynchronous Cycle}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {23:1--23:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.23},
URN = {urn:nbn:de:0030-drops-172147},
doi = {10.4230/LIPIcs.DISC.2022.23},
annote = {Keywords: graph coloring, LOCAL model, shared-memory model, immediate snapshot, renaming, wait-free algorithms}
}
@InProceedings{freitas_et_al:LIPIcs.DISC.2022.24,
author = {Freitas, Luciano and Kuznetsov, Petr and Tonkikh, Andrei},
title = {{Distributed Randomness from Approximate Agreement}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {24:1--24:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.24},
URN = {urn:nbn:de:0030-drops-172157},
doi = {10.4230/LIPIcs.DISC.2022.24},
annote = {Keywords: Asynchronous, approximate agreement, weak common coin, consensus, Byzantine agreement}
}
@InProceedings{georgiou_et_al:LIPIcs.DISC.2022.25,
author = {Georgiou, Chryssis and Nicolaou, Nicolas and Trigeorgi, Andria},
title = {{Fragmented ARES: Dynamic Storage for Large Objects}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {25:1--25:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.25},
URN = {urn:nbn:de:0030-drops-172161},
doi = {10.4230/LIPIcs.DISC.2022.25},
annote = {Keywords: Distributed storage, Large objects, Strong consistency, High access concurrency, Erasure code, Reconfiguration}
}
@InProceedings{halldorsson_et_al:LIPIcs.DISC.2022.26,
author = {Halld\'{o}rsson, Magn\'{u}s M. and Maus, Yannic and Nolin, Alexandre},
title = {{Fast Distributed Vertex Splitting with Applications}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {26:1--26:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.26},
URN = {urn:nbn:de:0030-drops-172176},
doi = {10.4230/LIPIcs.DISC.2022.26},
annote = {Keywords: Graph problems, Edge coloring, List coloring, Lov\'{a}sz local lemma, LOCAL model, CONGEST model, Distributed computing}
}
@InProceedings{hitron_et_al:LIPIcs.DISC.2022.27,
author = {Hitron, Yael and Parter, Merav and Yogev, Eylon},
title = {{Broadcast CONGEST Algorithms Against Eavesdroppers}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {27:1--27:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.27},
URN = {urn:nbn:de:0030-drops-172186},
doi = {10.4230/LIPIcs.DISC.2022.27},
annote = {Keywords: congest, edge-connectivity, secret sharing}
}
@InProceedings{kuhn_et_al:LIPIcs.DISC.2022.28,
author = {Kuhn, Fabian and Schneider, Philipp},
title = {{Routing Schemes and Distance Oracles in the Hybrid Model}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {28:1--28:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.28},
URN = {urn:nbn:de:0030-drops-172198},
doi = {10.4230/LIPIcs.DISC.2022.28},
annote = {Keywords: Distributed Computing, Graph Algorithms, Complexity Analysis}
}
@InProceedings{naor_et_al:LIPIcs.DISC.2022.29,
author = {Naor, Oded and Keidar, Idit},
title = {{On Payment Channels in Asynchronous Money Transfer Systems}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {29:1--29:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.29},
URN = {urn:nbn:de:0030-drops-172201},
doi = {10.4230/LIPIcs.DISC.2022.29},
annote = {Keywords: Blockchains, Asynchrony, Byzantine faults, Payment channels}
}
@InProceedings{ovens:LIPIcs.DISC.2022.30,
author = {Ovens, Sean},
title = {{The Space Complexity of Scannable Objects with Bounded Components}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {30:1--30:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.30},
URN = {urn:nbn:de:0030-drops-172213},
doi = {10.4230/LIPIcs.DISC.2022.30},
annote = {Keywords: space complexity, lower bound, shared memory, snapshot object}
}
@InProceedings{parter_et_al:LIPIcs.DISC.2022.31,
author = {Parter, Merav and Petruschka, Asaf},
title = {{Near-Optimal Distributed Computation of Small Vertex Cuts}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {31:1--31:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.31},
URN = {urn:nbn:de:0030-drops-172223},
doi = {10.4230/LIPIcs.DISC.2022.31},
annote = {Keywords: Vertex-connectivity, Congest, Graph Sketches}
}
@InProceedings{parter_et_al:LIPIcs.DISC.2022.32,
author = {Parter, Merav and Petruschka, Asaf},
title = {{\~{O}ptimal Dual Vertex Failure Connectivity Labels}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {32:1--32:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.32},
URN = {urn:nbn:de:0030-drops-172239},
doi = {10.4230/LIPIcs.DISC.2022.32},
annote = {Keywords: Fault-Tolerance, Heavy-Light Decomposition, Labeling Schemes}
}
@InProceedings{pu_et_al:LIPIcs.DISC.2022.33,
author = {Pu, Youer and Alvisi, Lorenzo and Eyal, Ittay},
title = {{Safe Permissionless Consensus}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {33:1--33:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.33},
URN = {urn:nbn:de:0030-drops-172246},
doi = {10.4230/LIPIcs.DISC.2022.33},
annote = {Keywords: Consensus, Permissionless, Nakamoto, Deterministic Safety}
}
@InProceedings{rosenbaum:LIPIcs.DISC.2022.34,
author = {Rosenbaum, Will},
title = {{Packet Forwarding with a Locally Bursty Adversary}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {34:1--34:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.34},
URN = {urn:nbn:de:0030-drops-172254},
doi = {10.4230/LIPIcs.DISC.2022.34},
annote = {Keywords: packet forwarding, packet scheduling, adversarial queueing theory, network calculus, odd-even downhill forwarding, locally bursty adversary, local algorithms}
}
@InProceedings{sutra:LIPIcs.DISC.2022.35,
author = {Sutra, Pierre},
title = {{The Weakest Failure Detector for Genuine Atomic Multicast}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {35:1--35:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.35},
URN = {urn:nbn:de:0030-drops-172267},
doi = {10.4230/LIPIcs.DISC.2022.35},
annote = {Keywords: Failure Detector, State Machine Replication, Consensus}
}
@InProceedings{hu_et_al:LIPIcs.DISC.2022.36,
author = {Hu, Xing and Toueg, Sam},
title = {{On Implementing SWMR Registers from SWSR Registers in Systems with Byzantine Failures}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {36:1--36:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.36},
URN = {urn:nbn:de:0030-drops-172272},
doi = {10.4230/LIPIcs.DISC.2022.36},
annote = {Keywords: distributed computing, concurrency, linearizability, shared registers}
}
@InProceedings{zinovyev:LIPIcs.DISC.2022.37,
author = {Zinovyev, Anatoliy},
title = {{Space-Stretch Tradeoff in Routing Revisited}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {37:1--37:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.37},
URN = {urn:nbn:de:0030-drops-172281},
doi = {10.4230/LIPIcs.DISC.2022.37},
annote = {Keywords: Compact routing, labeled network routing, lower bounds}
}
@InProceedings{abraham_et_al:LIPIcs.DISC.2022.38,
author = {Abraham, Ittai and Dolev, Danny and Kagan, Alon and Stern, Gilad},
title = {{Brief Announcement: Authenticated Consensus in Synchronous Systems with Mixed Faults}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {38:1--38:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.38},
URN = {urn:nbn:de:0030-drops-172292},
doi = {10.4230/LIPIcs.DISC.2022.38},
annote = {Keywords: consensus, state machine replication, mixed faults, synchrony, lower bounds}
}
@InProceedings{abraham_et_al:LIPIcs.DISC.2022.39,
author = {Abraham, Ittai and Crooks, Natacha and Giridharan, Neil and Howard, Heidi and Suri-Payer, Florian},
title = {{Brief Announcement: It’s not easy to relax: liveness in chained BFT protocols}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {39:1--39:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.39},
URN = {urn:nbn:de:0030-drops-172305},
doi = {10.4230/LIPIcs.DISC.2022.39},
annote = {Keywords: Consensus, blockchain, BFT}
}
@InProceedings{alipour_et_al:LIPIcs.DISC.2022.40,
author = {Alipour, Sharareh and Salari, Mohammadhadi},
title = {{Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {40:1--40:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.40},
URN = {urn:nbn:de:0030-drops-172315},
doi = {10.4230/LIPIcs.DISC.2022.40},
annote = {Keywords: Minimum dominating set problem, set cover problem, k-distance dominating set problem, distributed algorithms}
}
@InProceedings{bendavid_et_al:LIPIcs.DISC.2022.41,
author = {Ben-David, Naama and Friedman, Michal and Wei, Yuanhao},
title = {{Brief Announcement: Survey of Persistent Memory Correctness Conditions}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {41:1--41:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.41},
URN = {urn:nbn:de:0030-drops-172328},
doi = {10.4230/LIPIcs.DISC.2022.41},
annote = {Keywords: Persistence, NVRAM, Correctness, Concurrency}
}
@InProceedings{dai_et_al:LIPIcs.DISC.2022.42,
author = {Dai, Wenkai and Dinitz, Michael and Foerster, Klaus-Tycho and Schmid, Stefan},
title = {{Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {42:1--42:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.42},
URN = {urn:nbn:de:0030-drops-172330},
doi = {10.4230/LIPIcs.DISC.2022.42},
annote = {Keywords: Congestion, Reconfigurable Networks, Algorithms, Complexity}
}
@InProceedings{fraigniaud_et_al:LIPIcs.DISC.2022.43,
author = {Fraigniaud, Pierre and Montealegre, Pedro and Paredes, Pablo and Rapaport, Ivan and R{\'\i}os-Wilson, Mart{\'\i}n and Todinca, Ioan},
title = {{Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {43:1--43:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.43},
URN = {urn:nbn:de:0030-drops-172345},
doi = {10.4230/LIPIcs.DISC.2022.43},
annote = {Keywords: hybrid model, synchronous networks, LOCAL, CONGEST, Broadcast Congested Clique}
}
@InProceedings{gasieniec_et_al:LIPIcs.DISC.2022.44,
author = {G\k{a}sieniec, Leszek and Spirakis, Paul and Stachowiak, Grzegorz},
title = {{Brief Announcement: New Clocks, Fast Line Formation and Self-Replication Population Protocols}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {44:1--44:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.44},
URN = {urn:nbn:de:0030-drops-172351},
doi = {10.4230/LIPIcs.DISC.2022.44},
annote = {Keywords: Population protocols, network constructors, probabilistic bubble-sort, self-replication}
}
@InProceedings{kharal_et_al:LIPIcs.DISC.2022.45,
author = {Kharal, Rosina F. and Brown, Trevor},
title = {{Brief Announcement: Performance Anomalies in Concurrent Data Structure Microbenchmarks}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {45:1--45:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.45},
URN = {urn:nbn:de:0030-drops-172363},
doi = {10.4230/LIPIcs.DISC.2022.45},
annote = {Keywords: concurrent microbenchmarks, concurrent data structures, high performance simulations, PRNGs}
}
@InProceedings{kim_et_al:LIPIcs.DISC.2022.46,
author = {Kim, Yonghwan and Shibata, Masahiro and Sudo, Yuichi and Nakamura, Junya and Katayama, Yoshiaki and Masuzawa, Toshimitsu},
title = {{Brief Announcement: Gathering Despite Defected View}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {46:1--46:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.46},
URN = {urn:nbn:de:0030-drops-172377},
doi = {10.4230/LIPIcs.DISC.2022.46},
annote = {Keywords: mobile robot, gathering, defected view model}
}
@InProceedings{kostitsyna_et_al:LIPIcs.DISC.2022.47,
author = {Kostitsyna, Irina and Peters, Tom and Speckmann, Bettina},
title = {{Brief Announcement: An Effective Geometric Communication Structure for Programmable Matter}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {47:1--47:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.47},
URN = {urn:nbn:de:0030-drops-172386},
doi = {10.4230/LIPIcs.DISC.2022.47},
annote = {Keywords: Programmable matter, amoebot model, shape reconfiguration}
}
@InProceedings{legall_et_al:LIPIcs.DISC.2022.48,
author = {Le Gall, Fran\c{c}ois and Miyamoto, Masayuki and Nishimura, Harumichi},
title = {{Brief Announcement: Distributed Quantum Interactive Proofs}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {48:1--48:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.48},
URN = {urn:nbn:de:0030-drops-172396},
doi = {10.4230/LIPIcs.DISC.2022.48},
annote = {Keywords: distributed interactive proofs, distributed verification, quantum computation}
}
@InProceedings{nataf_et_al:LIPIcs.DISC.2022.49,
author = {Nataf, Ra\"{i}ssa and Goren, Guy and Moses, Yoram},
title = {{Brief Announcement: Null Messages, Information and Coordination}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {49:1--49:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.49},
URN = {urn:nbn:de:0030-drops-172409},
doi = {10.4230/LIPIcs.DISC.2022.49},
annote = {Keywords: null messages, fault tolerance, coordination, information flow}
}
@InProceedings{nelsonslivon_et_al:LIPIcs.DISC.2022.50,
author = {Nelson-Slivon, Jacob and Tseng, Lewis and Palmieri, Roberto},
title = {{Brief Announcement: Asymmetric Mutual Exclusion for RDMA}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {50:1--50:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.50},
URN = {urn:nbn:de:0030-drops-172417},
doi = {10.4230/LIPIcs.DISC.2022.50},
annote = {Keywords: Mutual exclusion, Synchronization, Remote direct memory access (RDMA)}
}
@InProceedings{oh_et_al:LIPIcs.DISC.2022.51,
author = {Oh, Shunhao and Randall, Dana and Richa, Andr\'{e}a W.},
title = {{Brief Announcement: Foraging in Particle Systems via Self-Induced Phase Changes}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {51:1--51:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.51},
URN = {urn:nbn:de:0030-drops-172423},
doi = {10.4230/LIPIcs.DISC.2022.51},
annote = {Keywords: Foraging, self-organized particle systems, compression, phase changes}
}
@InProceedings{pacut_et_al:LIPIcs.DISC.2022.52,
author = {Pacut, Maciej and Parham, Mahmoud and Rybicki, Joel and Schmid, Stefan and Suomela, Jukka and Tereshchenko, Aleksandr},
title = {{Brief Announcement: Temporal Locality in Online Algorithms}},
booktitle = {36th International Symposium on Distributed Computing (DISC 2022)},
pages = {52:1--52:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-255-6},
ISSN = {1868-8969},
year = {2022},
volume = {246},
editor = {Scheideler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.52},
URN = {urn:nbn:de:0030-drops-172431},
doi = {10.4230/LIPIcs.DISC.2022.52},
annote = {Keywords: Online algorithms, distributed algorithms}
}
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