@Proceedings{gilbert:LIPIcs.DISC.2021,
title = {{LIPIcs, Volume 209, DISC 2021, Complete Volume}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {1--860},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021},
URN = {urn:nbn:de:0030-drops-148015},
doi = {10.4230/LIPIcs.DISC.2021},
annote = {Keywords: LIPIcs, Volume 209, DISC 2021, Complete Volume}
}
@InProceedings{gilbert:LIPIcs.DISC.2021.0,
author = {Gilbert, Seth},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {0:i--0:xxii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.0},
URN = {urn:nbn:de:0030-drops-148028},
doi = {10.4230/LIPIcs.DISC.2021.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{haeupler:LIPIcs.DISC.2021.1,
author = {Haeupler, Bernhard},
title = {{The Quest for Universally-Optimal Distributed Algorithms}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.1},
URN = {urn:nbn:de:0030-drops-148030},
doi = {10.4230/LIPIcs.DISC.2021.1},
annote = {Keywords: Distributed algorithms}
}
@InProceedings{malkhi:LIPIcs.DISC.2021.2,
author = {Malkhi, Dahlia},
title = {{Tech Transfer Stories and Takeaways}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.2},
URN = {urn:nbn:de:0030-drops-148045},
doi = {10.4230/LIPIcs.DISC.2021.2},
annote = {Keywords: Tech Transfer, Distributed Systems}
}
@InProceedings{aguilera_et_al:LIPIcs.DISC.2021.3,
author = {Aguilera, Marcos K. and Ben-David, Naama and Guerraoui, Rachid and Papuc, Dalia and Xygkis, Athanasios and Zablotchi, Igor},
title = {{Frugal Byzantine Computing}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {3:1--3:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.3},
URN = {urn:nbn:de:0030-drops-148051},
doi = {10.4230/LIPIcs.DISC.2021.3},
annote = {Keywords: Reliable Broadcast, Consistent Broadcast, Consensus, Byzantine Failure, Message-and-memory}
}
@InProceedings{alistarh_et_al:LIPIcs.DISC.2021.4,
author = {Alistarh, Dan and Gelashvili, Rati and Nadiradze, Giorgi},
title = {{Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {4:1--4:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.4},
URN = {urn:nbn:de:0030-drops-148063},
doi = {10.4230/LIPIcs.DISC.2021.4},
annote = {Keywords: Lower Bounds, Leader Election, Shared-Memory}
}
@InProceedings{anagnostides_et_al:LIPIcs.DISC.2021.5,
author = {Anagnostides, Ioannis and Gouleakis, Themis},
title = {{Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {5:1--5:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.5},
URN = {urn:nbn:de:0030-drops-148077},
doi = {10.4230/LIPIcs.DISC.2021.5},
annote = {Keywords: Distributed Computing, Hybrid Model, Sparse Graphs, Deterministic Algorithms, All-Pairs Shortest Paths, Minimum Cut, Radius}
}
@InProceedings{assadi_et_al:LIPIcs.DISC.2021.6,
author = {Assadi, Sepehr and Dudeja, Aditi},
title = {{Ruling Sets in Random Order and Adversarial Streams}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {6:1--6:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.6},
URN = {urn:nbn:de:0030-drops-148086},
doi = {10.4230/LIPIcs.DISC.2021.6},
annote = {Keywords: Symmetry breaking, Ruling sets, Lower bounds, Communication Complexity}
}
@InProceedings{attiya_et_al:LIPIcs.DISC.2021.7,
author = {Attiya, Hagit and Enea, Constantin and Welch, Jennifer L.},
title = {{Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {7:1--7:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.7},
URN = {urn:nbn:de:0030-drops-148096},
doi = {10.4230/LIPIcs.DISC.2021.7},
annote = {Keywords: Concurrent Objects, Message-passing systems, Strong linearizability, Impossibility proofs, BG simulation, Shared registers}
}
@InProceedings{balliu_et_al:LIPIcs.DISC.2021.8,
author = {Balliu, Alkida and Censor-Hillel, Keren and Maus, Yannic and Olivetti, Dennis and Suomela, Jukka},
title = {{Locally Checkable Labelings with Small Messages}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {8:1--8:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.8},
URN = {urn:nbn:de:0030-drops-148109},
doi = {10.4230/LIPIcs.DISC.2021.8},
annote = {Keywords: distributed graph algorithms, CONGEST, locally checkable labelings}
}
@InProceedings{bankhamer_et_al:LIPIcs.DISC.2021.9,
author = {Bankhamer, Gregor and Els\"{a}sser, Robert and Schmid, Stefan},
title = {{Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {9:1--9:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.9},
URN = {urn:nbn:de:0030-drops-148117},
doi = {10.4230/LIPIcs.DISC.2021.9},
annote = {Keywords: local failover routing, congestion, randomized algorithms, datacenter networks}
}
@InProceedings{barenboim_et_al:LIPIcs.DISC.2021.10,
author = {Barenboim, Leonid and Maimon, Tzalik},
title = {{Deterministic Logarithmic Completeness in the Distributed Sleeping Model}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {10:1--10:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.10},
URN = {urn:nbn:de:0030-drops-148123},
doi = {10.4230/LIPIcs.DISC.2021.10},
annote = {Keywords: Distributed Computing, Sleeping Model, Complexity Class}
}
@InProceedings{bedin_et_al:LIPIcs.DISC.2021.11,
author = {B\'{e}din, Denis and L\'{e}pine, Fran\c{c}ois and Most\'{e}faoui, Achour and Perez, Damien and Perrin, Matthieu},
title = {{Wait-Free CAS-Based Algorithms: The Burden of the Past}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.11},
URN = {urn:nbn:de:0030-drops-148131},
doi = {10.4230/LIPIcs.DISC.2021.11},
annote = {Keywords: Compare-And-Swap, Concurrent Object, Infinite arrival model, Linearizability, Memory complexity, Multi-Threaded Systems, Shared-Memory, Universality, Wait-freedom}
}
@InProceedings{bendavid_et_al:LIPIcs.DISC.2021.12,
author = {Ben-David, Naama and Blelloch, Guy E. and Fatourou, Panagiota and Ruppert, Eric and Sun, Yihan and Wei, Yuanhao},
title = {{Space and Time Bounded Multiversion Garbage Collection}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {12:1--12:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.12},
URN = {urn:nbn:de:0030-drops-148143},
doi = {10.4230/LIPIcs.DISC.2021.12},
annote = {Keywords: Lock-free, data structures, memory management, snapshot, version lists}
}
@InProceedings{bonamy_et_al:LIPIcs.DISC.2021.13,
author = {Bonamy, Marthe and Cook, Linda and Groenland, Carla and Wesolek, Alexandra},
title = {{A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {13:1--13:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.13},
URN = {urn:nbn:de:0030-drops-148159},
doi = {10.4230/LIPIcs.DISC.2021.13},
annote = {Keywords: Outerplanar graphs, dominating set, LOCAL model, constant-factor approximation algorithm}
}
@InProceedings{cai_et_al:LIPIcs.DISC.2021.14,
author = {Cai, Wentao and Wen, Haosen and Maksimovski, Vladimir and Du, Mingzhe and Sanna, Rafaello and Abdallah, Shreif and Scott, Michael L.},
title = {{Fast Nonblocking Persistence for Concurrent Data Structures}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {14:1--14:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.14},
URN = {urn:nbn:de:0030-drops-148169},
doi = {10.4230/LIPIcs.DISC.2021.14},
annote = {Keywords: Persistent Memory, Nonblocking Progress, Buffered Durable Linearizability}
}
@InProceedings{cambus_et_al:LIPIcs.DISC.2021.15,
author = {Cambus, M\'{e}lanie and Choo, Davin and Miikonen, Havu and Uitto, Jara},
title = {{Massively Parallel Correlation Clustering in Bounded Arboricity Graphs}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {15:1--15:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.15},
URN = {urn:nbn:de:0030-drops-148173},
doi = {10.4230/LIPIcs.DISC.2021.15},
annote = {Keywords: MPC Algorithm, Correlation Clustering, Bounded Arboricity}
}
@InProceedings{castaneda_et_al:LIPIcs.DISC.2021.16,
author = {Casta\~{n}eda, Armando and Pi\~{n}a, Miguel},
title = {{Fully Read/Write Fence-Free Work-Stealing with Multiplicity}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {16:1--16:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.16},
URN = {urn:nbn:de:0030-drops-148181},
doi = {10.4230/LIPIcs.DISC.2021.16},
annote = {Keywords: Correctness condition, Linearizability, Nonblocking, Relaxed data type, Set-linearizability, Wait-freedom, Work-stealing}
}
@InProceedings{chen:LIPIcs.DISC.2021.17,
author = {Chen, Jinyuan},
title = {{Optimal Error-Free Multi-Valued Byzantine Agreement}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {17:1--17:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.17},
URN = {urn:nbn:de:0030-drops-148190},
doi = {10.4230/LIPIcs.DISC.2021.17},
annote = {Keywords: Byzantine agreement, information-theoretic security, error correction codes}
}
@InProceedings{cohen_et_al:LIPIcs.DISC.2021.18,
author = {Cohen, Shir and Keidar, Idit},
title = {{Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {18:1--18:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.18},
URN = {urn:nbn:de:0030-drops-148203},
doi = {10.4230/LIPIcs.DISC.2021.18},
annote = {Keywords: Byzantine linearizability, concurrent algorithms, snapshot, asset transfer}
}
@InProceedings{dani_et_al:LIPIcs.DISC.2021.19,
author = {Dani, Varsha and Gupta, Aayush and Hayes, Thomas P. and Pettie, Seth},
title = {{Wake up and Join Me! an Energy-Efficient Algorithm for Maximal Matching in Radio Networks}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.19},
URN = {urn:nbn:de:0030-drops-148219},
doi = {10.4230/LIPIcs.DISC.2021.19},
annote = {Keywords: Distributed Algorithms, Energy-Aware Computation, Radio Networks, Maximal Matching, Sensor Networks}
}
@InProceedings{daymude_et_al:LIPIcs.DISC.2021.20,
author = {Daymude, Joshua J. and Richa, Andr\'{e}a W. and Scheideler, Christian},
title = {{The Canonical Amoebot Model: Algorithms and Concurrency Control}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {20:1--20:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.20},
URN = {urn:nbn:de:0030-drops-148227},
doi = {10.4230/LIPIcs.DISC.2021.20},
annote = {Keywords: Programmable matter, self-organization, distributed algorithms, concurrency}
}
@InProceedings{elkin_et_al:LIPIcs.DISC.2021.21,
author = {Elkin, Michael and Gitlitz, Yuval and Neiman, Ofer},
title = {{Improved Weighted Additive Spanners}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.21},
URN = {urn:nbn:de:0030-drops-148232},
doi = {10.4230/LIPIcs.DISC.2021.21},
annote = {Keywords: Graph theory, Pure additive spanners}
}
@InProceedings{ganczorz_et_al:LIPIcs.DISC.2021.22,
author = {Ga\'{n}czorz, Adam and Jurdzi\'{n}ski, Tomasz and Lewko, Mateusz and Pelc, Andrzej},
title = {{Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {22:1--22:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.22},
URN = {urn:nbn:de:0030-drops-148242},
doi = {10.4230/LIPIcs.DISC.2021.22},
annote = {Keywords: size discovery, topology recognition, radio network, labeling scheme}
}
@InProceedings{hitron_et_al:LIPIcs.DISC.2021.23,
author = {Hitron, Yael and Parter, Merav},
title = {{Broadcast CONGEST Algorithms against Adversarial Edges}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {23:1--23:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.23},
URN = {urn:nbn:de:0030-drops-148256},
doi = {10.4230/LIPIcs.DISC.2021.23},
annote = {Keywords: CONGEST, Fault-Tolerant Network Design, Edge Connectivity}
}
@InProceedings{hitron_et_al:LIPIcs.DISC.2021.24,
author = {Hitron, Yael and Parter, Merav},
title = {{General CONGEST Compilers against Adversarial Edges}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {24:1--24:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.24},
URN = {urn:nbn:de:0030-drops-148266},
doi = {10.4230/LIPIcs.DISC.2021.24},
annote = {Keywords: CONGEST, Cycle Covers, Byzantine Adversaries}
}
@InProceedings{jayanti_et_al:LIPIcs.DISC.2021.25,
author = {Jayanti, Siddhartha and Shun, Julian},
title = {{Fast Arrays: Atomic Arrays with Constant Time Initialization}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {25:1--25:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.25},
URN = {urn:nbn:de:0030-drops-148278},
doi = {10.4230/LIPIcs.DISC.2021.25},
annote = {Keywords: fast array, linearizable, wait-free, asynchronous, multiprocessor, constant time, space efficient, data structure}
}
@InProceedings{khan_et_al:LIPIcs.DISC.2021.26,
author = {Khan, Muhammad Samir and Vaidya, Nitin H.},
title = {{Byzantine Consensus with Local Multicast Channels}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {26:1--26:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.26},
URN = {urn:nbn:de:0030-drops-148285},
doi = {10.4230/LIPIcs.DISC.2021.26},
annote = {Keywords: Byzantine fault, distributed algorithm, consensus, broadcast, multicast}
}
@InProceedings{kutten_et_al:LIPIcs.DISC.2021.27,
author = {Kutten, Shay and Moses Jr., William K. and Pandurangan, Gopal and Peleg, David},
title = {{Singularly Near Optimal Leader Election in Asynchronous Networks}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {27:1--27:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.27},
URN = {urn:nbn:de:0030-drops-148294},
doi = {10.4230/LIPIcs.DISC.2021.27},
annote = {Keywords: Leader election, Singular optimality, Randomized algorithms, Asynchronous networks, Arbitrary graphs}
}
@InProceedings{kuznetsov_et_al:LIPIcs.DISC.2021.28,
author = {Kuznetsov, Petr and Pignolet, Yvonne-Anne and Ponomarev, Pavel and Tonkikh, Andrei},
title = {{Permissionless and Asynchronous Asset Transfer}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {28:1--28:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.28},
URN = {urn:nbn:de:0030-drops-148307},
doi = {10.4230/LIPIcs.DISC.2021.28},
annote = {Keywords: Asset transfer, permissionless, asynchronous, dynamic adversary}
}
@InProceedings{li_et_al:LIPIcs.DISC.2021.29,
author = {Li, Nan and Golab, Wojciech},
title = {{Detectable Sequential Specifications for Recoverable Shared Objects}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {29:1--29:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.29},
URN = {urn:nbn:de:0030-drops-148311},
doi = {10.4230/LIPIcs.DISC.2021.29},
annote = {Keywords: persistent memory, concurrency, fault tolerance, correctness, detectability}
}
@InProceedings{maor_et_al:LIPIcs.DISC.2021.30,
author = {Maor, Liat and Taubenfeld, Gadi},
title = {{Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {30:1--30:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.30},
URN = {urn:nbn:de:0030-drops-148322},
doi = {10.4230/LIPIcs.DISC.2021.30},
annote = {Keywords: Group mutual exclusion, RMR complexity, unbounded number of processes, fetch\&store (FAS), compare\&swap (CAS)}
}
@InProceedings{maus_et_al:LIPIcs.DISC.2021.31,
author = {Maus, Yannic and Uitto, Jara},
title = {{Efficient CONGEST Algorithms for the Lov\'{a}sz Local Lemma}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {31:1--31:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.31},
URN = {urn:nbn:de:0030-drops-148333},
doi = {10.4230/LIPIcs.DISC.2021.31},
annote = {Keywords: distributed graph algorithms, CONGEST, Lov\'{a}sz Local Lemma, locally checkable labelings}
}
@InProceedings{momose_et_al:LIPIcs.DISC.2021.32,
author = {Momose, Atsuki and Ren, Ling},
title = {{Optimal Communication Complexity of Authenticated Byzantine Agreement}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {32:1--32:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.32},
URN = {urn:nbn:de:0030-drops-148341},
doi = {10.4230/LIPIcs.DISC.2021.32},
annote = {Keywords: Byzantine Agreement, Communication Complexity, Lower Bound}
}
@InProceedings{morgan_et_al:LIPIcs.DISC.2021.33,
author = {Morgan, Adir and Solomon, Shay and Wein, Nicole},
title = {{Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {33:1--33:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.33},
URN = {urn:nbn:de:0030-drops-148353},
doi = {10.4230/LIPIcs.DISC.2021.33},
annote = {Keywords: Graph Algorithms, Dominating Set, Bounded Arboricity, Linear time algorithms}
}
@InProceedings{schwartzman_et_al:LIPIcs.DISC.2021.34,
author = {Schwartzman, Gregory and Sudo, Yuichi},
title = {{Smoothed Analysis of Population Protocols}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {34:1--34:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.34},
URN = {urn:nbn:de:0030-drops-148362},
doi = {10.4230/LIPIcs.DISC.2021.34},
annote = {Keywords: Population protocols, Smoothed analysis, Leader election}
}
@InProceedings{sheffi_et_al:LIPIcs.DISC.2021.35,
author = {Sheffi, Gali and Herlihy, Maurice and Petrank, Erez},
title = {{VBR: Version Based Reclamation}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {35:1--35:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.35},
URN = {urn:nbn:de:0030-drops-148374},
doi = {10.4230/LIPIcs.DISC.2021.35},
annote = {Keywords: Safe memory reclamation, concurrency, linearizability, lock-freedom}
}
@InProceedings{sheng_et_al:LIPIcs.DISC.2021.36,
author = {Sheng, Yilun and Ellen, Faith},
title = {{Extension-Based Proofs for Synchronous Message Passing}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {36:1--36:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.36},
URN = {urn:nbn:de:0030-drops-148380},
doi = {10.4230/LIPIcs.DISC.2021.36},
annote = {Keywords: Set agreement, lower bounds, valency arguments}
}
@InProceedings{solodkin_et_al:LIPIcs.DISC.2021.37,
author = {Solodkin, Lior and Oshman, Rotem},
title = {{Truthful Information Dissemination in General Asynchronous Networks}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {37:1--37:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.37},
URN = {urn:nbn:de:0030-drops-148398},
doi = {10.4230/LIPIcs.DISC.2021.37},
annote = {Keywords: game theory, asynchronous networks, information dissemination}
}
@InProceedings{spiegelman:LIPIcs.DISC.2021.38,
author = {Spiegelman, Alexander},
title = {{In Search for an Optimal Authenticated Byzantine Agreement}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {38:1--38:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.38},
URN = {urn:nbn:de:0030-drops-148401},
doi = {10.4230/LIPIcs.DISC.2021.38},
annote = {Keywords: Byzantine agreement, Optimistic, Asynchronous fallback}
}
@InProceedings{su_et_al:LIPIcs.DISC.2021.39,
author = {Su, Lili and Liu, Quanquan C. and Narula, Neha},
title = {{The Power of Random Symmetry-Breaking in Nakamoto Consensus}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {39:1--39:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.39},
URN = {urn:nbn:de:0030-drops-148413},
doi = {10.4230/LIPIcs.DISC.2021.39},
annote = {Keywords: Nakamoto consensus, Byzantine consensus, blockchain, symmetry-breaking, coalescing random walks}
}
@InProceedings{sudo_et_al:LIPIcs.DISC.2021.40,
author = {Sudo, Yuichi and Eguchi, Ryota and Izumi, Taisuke and Masuzawa, Toshimitsu},
title = {{Time-Optimal Loosely-Stabilizing Leader Election in Population Protocols}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {40:1--40:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.40},
URN = {urn:nbn:de:0030-drops-148427},
doi = {10.4230/LIPIcs.DISC.2021.40},
annote = {Keywords: population protocols, leader election, loose-stabilization, self-stabilization}
}
@InProceedings{gsundaram_et_al:LIPIcs.DISC.2021.41,
author = {G Sundaram, Ranjani and Gupta, Himanshu and Ramakrishnan, C. R.},
title = {{Efficient Distribution of Quantum Circuits}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {41:1--41:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.41},
URN = {urn:nbn:de:0030-drops-148434},
doi = {10.4230/LIPIcs.DISC.2021.41},
annote = {Keywords: Distributed Quantum Computing, Hypergraph Min-Cut}
}
@InProceedings{zappala_et_al:LIPIcs.DISC.2021.42,
author = {Zappal\`{a}, Paolo and Belotti, Marianna and Potop-Butucaru, Maria and Secci, Stefano},
title = {{Game Theoretical Framework for Analyzing Blockchains Robustness}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {42:1--42:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.42},
URN = {urn:nbn:de:0030-drops-148440},
doi = {10.4230/LIPIcs.DISC.2021.42},
annote = {Keywords: Blockchain protocols, Distributed algorithms, Game-theoretical modeling, Fault tolerance, Failure robustness}
}
@InProceedings{alistarh_et_al:LIPIcs.DISC.2021.43,
author = {Alistarh, Dan and Gelashvili, Rati and Rybicki, Joel},
title = {{Brief Announcement: Fast Graphical Population Protocols}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {43:1--43:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.43},
URN = {urn:nbn:de:0030-drops-148451},
doi = {10.4230/LIPIcs.DISC.2021.43},
annote = {Keywords: population protocols, leader election, majority}
}
@InProceedings{alpos_et_al:LIPIcs.DISC.2021.44,
author = {Alpos, Orestis and Cachin, Christian and Zanolini, Luca},
title = {{Brief Announcement: How to Trust Strangers - Composition of Byzantine Quorum Systems}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {44:1--44:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.44},
URN = {urn:nbn:de:0030-drops-148468},
doi = {10.4230/LIPIcs.DISC.2021.44},
annote = {Keywords: Byzantine quorum systems, composition of quorum systems, trust models, asymmetric trust}
}
@InProceedings{assa_et_al:LIPIcs.DISC.2021.45,
author = {Assa, Gal and Meir, Hagar and Golan-Gueta, Guy and Keidar, Idit and Spiegelman, Alexander},
title = {{Brief Announcement: Using Nesting to Push the Limits of Transactional Data Structure Libraries}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {45:1--45:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.45},
URN = {urn:nbn:de:0030-drops-148479},
doi = {10.4230/LIPIcs.DISC.2021.45},
annote = {Keywords: Transactional Libraries}
}
@InProceedings{bano_et_al:LIPIcs.DISC.2021.46,
author = {Bano, Shehar and Sonnino, Alberto and Chursin, Andrey and Perelman, Dmitri and Li, Zekun and Ching, Avery and Malkhi, Dahlia},
title = {{Brief Announcement: Twins – BFT Systems Made Robust}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {46:1--46:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.46},
URN = {urn:nbn:de:0030-drops-148485},
doi = {10.4230/LIPIcs.DISC.2021.46},
annote = {Keywords: Distributed Systems, Byzantine Fault Tolerance, Real-World Deployment}
}
@InProceedings{bastide_et_al:LIPIcs.DISC.2021.47,
author = {Bastide, Paul and Fraigniaud, Pierre},
title = {{Brief Annoucement: On Extending Brandt’s Speedup Theorem from LOCAL to Round-Based Full-Information Models}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {47:1--47:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.47},
URN = {urn:nbn:de:0030-drops-148492},
doi = {10.4230/LIPIcs.DISC.2021.47},
annote = {Keywords: Local Checkability, Distributed Complexity and Computability}
}
@InProceedings{bhat_et_al:LIPIcs.DISC.2021.48,
author = {Bhat, Shreesha G. and Nagar, Kartik},
title = {{Brief Announcement: Automating and Mechanising Cutoff Proofs for Parameterized Verification of Distributed Protocols}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {48:1--48:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.48},
URN = {urn:nbn:de:0030-drops-148505},
doi = {10.4230/LIPIcs.DISC.2021.48},
annote = {Keywords: Formal Methods, Automated Verification, Distributed Protocols}
}
@InProceedings{bousquet_et_al:LIPIcs.DISC.2021.49,
author = {Bousquet, Nicolas and Feuilloley, Laurent and Pierron, Th\'{e}o},
title = {{Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {49:1--49:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.49},
URN = {urn:nbn:de:0030-drops-148515},
doi = {10.4230/LIPIcs.DISC.2021.49},
annote = {Keywords: Local certification, proof-labeling schemes, locally checkable proofs, graph decompositions, minor-free graphs}
}
@InProceedings{brandt_et_al:LIPIcs.DISC.2021.50,
author = {Brandt, Sebastian and Latypov, Rustam and Uitto, Jara},
title = {{Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {50:1--50:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.50},
URN = {urn:nbn:de:0030-drops-148521},
doi = {10.4230/LIPIcs.DISC.2021.50},
annote = {Keywords: Distributed computing, Locally checkable labeling problems, Trees, Massively Parallel Computation, Sublinear memory, 3-coloring}
}
@InProceedings{cachin_et_al:LIPIcs.DISC.2021.51,
author = {Cachin, Christian and Zanolini, Luca},
title = {{Brief Announcement: Revisiting Signature-Free Asynchronous Byzantine Consensus}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {51:1--51:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.51},
URN = {urn:nbn:de:0030-drops-148535},
doi = {10.4230/LIPIcs.DISC.2021.51},
annote = {Keywords: Randomized consensus}
}
@InProceedings{chatterjee_et_al:LIPIcs.DISC.2021.52,
author = {Chatterjee, Bapi and Peri, Sathya and Sa, Muktikanta},
title = {{Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {52:1--52:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.52},
URN = {urn:nbn:de:0030-drops-148549},
doi = {10.4230/LIPIcs.DISC.2021.52},
annote = {Keywords: concurrent data structure, linearizability, non-blocking, directed graph, breadth-first search, single-source shortest-path, betweenness centrality}
}
@InProceedings{cogo_et_al:LIPIcs.DISC.2021.53,
author = {Cogo, Vinicius Vielmo and Bessani, Alysson},
title = {{Brief Announcement: Auditable Register Emulations}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {53:1--53:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.53},
URN = {urn:nbn:de:0030-drops-148558},
doi = {10.4230/LIPIcs.DISC.2021.53},
annote = {Keywords: Auditability, Secure Storage, Information Dispersal}
}
@InProceedings{desouza_et_al:LIPIcs.DISC.2021.54,
author = {de Souza, Luciano Freitas and Kuznetsov, Petr and Rieutord, Thibault and Tucci-Piergiovanni, Sara},
title = {{Brief Announcement: Accountability and Reconfiguration — Self-Healing Lattice Agreement}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {54:1--54:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.54},
URN = {urn:nbn:de:0030-drops-148565},
doi = {10.4230/LIPIcs.DISC.2021.54},
annote = {Keywords: Reconfiguration, accountability, asynchronous, lattice agreement}
}
@InProceedings{derrick_et_al:LIPIcs.DISC.2021.55,
author = {Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike},
title = {{Brief Announcement: On Strong Observational Refinement and Forward Simulation}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {55:1--55:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.55},
URN = {urn:nbn:de:0030-drops-148575},
doi = {10.4230/LIPIcs.DISC.2021.55},
annote = {Keywords: Strong Observational Refinement, Hyperproperties, Forward Simulation}
}
@InProceedings{fatourou_et_al:LIPIcs.DISC.2021.56,
author = {Fatourou, Panagiota and Kallimanis, Nikolaos D. and Kosmas, Eleftherios},
title = {{Brief Announcement: Persistent Software Combining}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {56:1--56:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.56},
URN = {urn:nbn:de:0030-drops-148580},
doi = {10.4230/LIPIcs.DISC.2021.56},
annote = {Keywords: Persistent objects, recoverable algorithms, durability, synchronization protocols, software combining, universal constructions, wait-freedom, stacks, queues}
}
@InProceedings{goren_et_al:LIPIcs.DISC.2021.57,
author = {Goren, Guy and Moses, Yoram and Spiegelman, Alexander},
title = {{Brief Announcement: Probabilistic Indistinguishability and The Quality of Validity in Byzantine Agreement}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {57:1--57:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.57},
URN = {urn:nbn:de:0030-drops-148596},
doi = {10.4230/LIPIcs.DISC.2021.57},
annote = {Keywords: Indistinguishability, probabilistic lower bounds, Byzantine agreement}
}
@InProceedings{korhonen_et_al:LIPIcs.DISC.2021.58,
author = {Korhonen, Janne H. and Paz, Ami and Rybicki, Joel and Schmid, Stefan and Suomela, Jukka},
title = {{Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {58:1--58:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.58},
URN = {urn:nbn:de:0030-drops-148609},
doi = {10.4230/LIPIcs.DISC.2021.58},
annote = {Keywords: Supported LOCAL model, sinkless orientation, round elimination}
}
@InProceedings{livshits_et_al:LIPIcs.DISC.2021.59,
author = {Livshits, Ariel and Shadmi, Yonatan and Tamir (Averbuch), Ran},
title = {{Brief Announcement: Simple Majority Consensus in Networks with Unreliable Communication}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {59:1--59:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.59},
URN = {urn:nbn:de:0030-drops-148617},
doi = {10.4230/LIPIcs.DISC.2021.59},
annote = {Keywords: Majority consensus, probabilistic message loss, distributed systems}
}
@InProceedings{nikolaev_et_al:LIPIcs.DISC.2021.60,
author = {Nikolaev, Ruslan and Ravindran, Binoy},
title = {{Brief Announcement: Crystalline: Fast and Memory Efficient Wait-Free Reclamation}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {60:1--60:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.60},
URN = {urn:nbn:de:0030-drops-148626},
doi = {10.4230/LIPIcs.DISC.2021.60},
annote = {Keywords: memory reclamation, wait-free, reference counting, hazard pointers}
}
@InProceedings{schultz_et_al:LIPIcs.DISC.2021.61,
author = {Schultz, William and Zhou, Siyuan and Tripakis, Stavros},
title = {{Brief Announcement: Design and Verification of a Logless Dynamic Reconfiguration Protocol in MongoDB Replication}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {61:1--61:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.61},
URN = {urn:nbn:de:0030-drops-148636},
doi = {10.4230/LIPIcs.DISC.2021.61},
annote = {Keywords: Reconfiguration, Consensus, State Machine Replication}
}
@InProceedings{yandamuri_et_al:LIPIcs.DISC.2021.62,
author = {Yandamuri, Sravya and Abraham, Ittai and Nayak, Kartik and Reiter, Michael},
title = {{Brief Announcement: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {62:1--62:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.62},
URN = {urn:nbn:de:0030-drops-148647},
doi = {10.4230/LIPIcs.DISC.2021.62},
annote = {Keywords: communication complexity, consensus, trusted hardware}
}
@InProceedings{zarbafian_et_al:LIPIcs.DISC.2021.63,
author = {Zarbafian, Pouriya and Gramoli, Vincent},
title = {{Brief Announcement: Ordered Reliable Broadcast and Fast Ordered Byzantine Consensus for Cryptocurrency}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {63:1--63:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.63},
URN = {urn:nbn:de:0030-drops-148655},
doi = {10.4230/LIPIcs.DISC.2021.63},
annote = {Keywords: distributed algorithm, consensus, reliable broadcast, byzantine fault tolerance, linearizability, blockchain}
}
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