@Proceedings{bramas_et_al:LIPIcs.OPODIS.2020, title = {{LIPIcs, Volume 184, OPODIS 2020, Complete Volume}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {1--514}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020}, URN = {urn:nbn:de:0030-drops-134842}, doi = {10.4230/LIPIcs.OPODIS.2020}, annote = {Keywords: LIPIcs, Volume 184, OPODIS 2020, Complete Volume} } @InProceedings{bramas_et_al:LIPIcs.OPODIS.2020.0, author = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.0}, URN = {urn:nbn:de:0030-drops-134854}, doi = {10.4230/LIPIcs.OPODIS.2020.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} } @InProceedings{felber:LIPIcs.OPODIS.2020.1, author = {Felber, Pascal}, title = {{Big Data Processing: Security and Scalability Challenges}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.1}, URN = {urn:nbn:de:0030-drops-134863}, doi = {10.4230/LIPIcs.OPODIS.2020.1}, annote = {Keywords: Big Data} } @InProceedings{keidar:LIPIcs.OPODIS.2020.2, author = {Keidar, Idit}, title = {{Byzantine Agreement and SMR with Sub-Quadratic Message Complexity}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.2}, URN = {urn:nbn:de:0030-drops-134874}, doi = {10.4230/LIPIcs.OPODIS.2020.2}, annote = {Keywords: Distributed Computing, Byzantine Agreement} } @InProceedings{suomela:LIPIcs.OPODIS.2020.3, author = {Suomela, Jukka}, title = {{Can We Automate Our Own Work - or Show That It Is Hard?}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {3:1--3:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.3}, URN = {urn:nbn:de:0030-drops-134881}, doi = {10.4230/LIPIcs.OPODIS.2020.3}, annote = {Keywords: Distributed Computing} } @InProceedings{zheng_et_al:LIPIcs.OPODIS.2020.4, author = {Zheng, Xiong and Garg, Vijay}, title = {{Byzantine Lattice Agreement in Asynchronous Systems}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {4:1--4:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.4}, URN = {urn:nbn:de:0030-drops-134894}, doi = {10.4230/LIPIcs.OPODIS.2020.4}, annote = {Keywords: Byzantine Lattice Agreement, Asynchronous} } @InProceedings{sheff_et_al:LIPIcs.OPODIS.2020.5, author = {Sheff, Isaac and Wang, Xinwen and van Renesse, Robbert and Myers, Andrew C.}, title = {{Heterogeneous Paxos}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {5:1--5:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.5}, URN = {urn:nbn:de:0030-drops-134909}, doi = {10.4230/LIPIcs.OPODIS.2020.5}, annote = {Keywords: Consensus, Trust, Heterogeneous Trust} } @InProceedings{hirt_et_al:LIPIcs.OPODIS.2020.6, author = {Hirt, Martin and Kastrati, Ard and Liu-Zhang, Chen-Da}, title = {{Multi-Threshold Asynchronous Reliable Broadcast and Consensus}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.6}, URN = {urn:nbn:de:0030-drops-134917}, doi = {10.4230/LIPIcs.OPODIS.2020.6}, annote = {Keywords: broadcast, byzantine agreement, multi-threshold} } @InProceedings{zhang_et_al:LIPIcs.OPODIS.2020.7, author = {Zhang, Qinzi and Tseng, Lewis}, title = {{Echo-CGC: A Communication-Efficient Byzantine-Tolerant Distributed Machine Learning Algorithm in Single-Hop Radio Network}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {7:1--7:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.7}, URN = {urn:nbn:de:0030-drops-134927}, doi = {10.4230/LIPIcs.OPODIS.2020.7}, annote = {Keywords: Distributed Machine Learning, Single-hop Radio Network, Byzantine Fault, Communication Complexity, Wireless Communication, Parameter Server} } @InProceedings{boussetta_et_al:LIPIcs.OPODIS.2020.8, author = {Boussetta, Amine and El-Mhamdi, El-Mahdi and Guerraoui, Rachid and Maurer, Alexandre and Rouault, S\'{e}bastien}, title = {{AKSEL: Fast Byzantine SGD}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {8:1--8:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.8}, URN = {urn:nbn:de:0030-drops-134931}, doi = {10.4230/LIPIcs.OPODIS.2020.8}, annote = {Keywords: Machine learning, Stochastic gradient descent, Byzantine failures} } @InProceedings{spiegelman_et_al:LIPIcs.OPODIS.2020.9, author = {Spiegelman, Alexander and Rinberg, Arik and Malkhi, Dahlia}, title = {{ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {9:1--9:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.9}, URN = {urn:nbn:de:0030-drops-134948}, doi = {10.4230/LIPIcs.OPODIS.2020.9}, annote = {Keywords: Framework, Asynchronous, Consensus boosting, State Machine Replication} } @InProceedings{amoressesar_et_al:LIPIcs.OPODIS.2020.10, author = {Amores-Sesar, Ignacio and Cachin, Christian and Mi\'{c}i\'{c}, Jovana}, title = {{Security Analysis of Ripple Consensus}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {10:1--10:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.10}, URN = {urn:nbn:de:0030-drops-134956}, doi = {10.4230/LIPIcs.OPODIS.2020.10}, annote = {Keywords: Ripple, Blockchain, Quorums, Consensus} } @InProceedings{abraham_et_al:LIPIcs.OPODIS.2020.11, author = {Abraham, Ittai and Stern, Gilad}, title = {{Information Theoretic HotStuff}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {11:1--11:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.11}, URN = {urn:nbn:de:0030-drops-134969}, doi = {10.4230/LIPIcs.OPODIS.2020.11}, annote = {Keywords: byzantine agreement, partial synchrony, bounded space} } @InProceedings{amoussouguenou_et_al:LIPIcs.OPODIS.2020.12, author = {Amoussou-Guenou, Yackolley and Biais, Bruno and Potop-Butucaru, Maria and Tucci-Piergiovanni, Sara}, title = {{Rational Behaviors in Committee-Based Blockchains}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {12:1--12:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.12}, URN = {urn:nbn:de:0030-drops-134973}, doi = {10.4230/LIPIcs.OPODIS.2020.12}, annote = {Keywords: BFT Consensus, Blockchains, Game Theory} } @InProceedings{castaneda_et_al:LIPIcs.OPODIS.2020.13, author = {Casta\~{n}eda, Armando and Rajsbaum, Sergio and Raynal, Michel}, title = {{Relaxed Queues and Stacks from Read/Write Operations}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {13:1--13:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.13}, URN = {urn:nbn:de:0030-drops-134983}, doi = {10.4230/LIPIcs.OPODIS.2020.13}, annote = {Keywords: Asynchrony, Correctness condition, Linearizability, Nonblocking, Process crash, Relaxed data type, Set-linearizability, Wait-freedom, Work-stealing} } @InProceedings{wade_et_al:LIPIcs.OPODIS.2020.14, author = {Wade, Dempsey and Talmage, Edward}, title = {{Fast and Space-Efficient Queues via Relaxation}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {14:1--14:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.14}, URN = {urn:nbn:de:0030-drops-134994}, doi = {10.4230/LIPIcs.OPODIS.2020.14}, annote = {Keywords: Shared Data Structures, Message Passing, Relaxed Data Types, Space Complexity} } @InProceedings{katzan_et_al:LIPIcs.OPODIS.2020.15, author = {Katzan, Daniel and Morrison, Adam}, title = {{Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.15}, URN = {urn:nbn:de:0030-drops-135004}, doi = {10.4230/LIPIcs.OPODIS.2020.15}, annote = {Keywords: Mutual exclusion, recovery, non-volatile memory} } @InProceedings{attiya_et_al:LIPIcs.OPODIS.2020.16, author = {Attiya, Hagit and Kumari, Sweta and Schiller, Noa}, title = {{Optimal Resilience in Systems That Mix Shared Memory and Message Passing}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {16:1--16:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.16}, URN = {urn:nbn:de:0030-drops-135019}, doi = {10.4230/LIPIcs.OPODIS.2020.16}, annote = {Keywords: fault resilience, m\&m model, cluster-based model, randomized consensus, approximate agreement, renaming, register implementations, atomic snapshots} } @InProceedings{firmli_et_al:LIPIcs.OPODIS.2020.17, author = {Firmli, Soukaina and Trigonakis, Vasileios and Lozi, Jean-Pierre and Psaroudakis, Iraklis and Weld, Alexander and Chiadmi, Dalila and Hong, Sungpack and Chafi, Hassan}, title = {{CSR++: A Fast, Scalable, Update-Friendly Graph Data Structure}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {17:1--17:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.17}, URN = {urn:nbn:de:0030-drops-135021}, doi = {10.4230/LIPIcs.OPODIS.2020.17}, annote = {Keywords: Data Structures, Concurrency, Graph Processing, Graph Mutations} } @InProceedings{attiya_et_al:LIPIcs.OPODIS.2020.18, author = {Attiya, Hagit and Casta\~{n}eda, Armando and Rajsbaum, Sergio}, title = {{Locally Solvable Tasks and the Limitations of Valency Arguments}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.18}, URN = {urn:nbn:de:0030-drops-135037}, doi = {10.4230/LIPIcs.OPODIS.2020.18}, annote = {Keywords: Wait-freedom, Set agreement, Weak symmetry breaking, Impossibility proofs} } @InProceedings{amir_et_al:LIPIcs.OPODIS.2020.19, author = {Amir, Talley and Aspnes, James and Lazarsfeld, John}, title = {{Approximate Majority with Catalytic Inputs}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {19:1--19:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.19}, URN = {urn:nbn:de:0030-drops-135040}, doi = {10.4230/LIPIcs.OPODIS.2020.19}, annote = {Keywords: population protocols, approximate majority, catalysts, leaks, lower bound} } @InProceedings{ganguly_et_al:LIPIcs.OPODIS.2020.20, author = {Ganguly, Ritam and Momtaz, Anik and Bonakdarpour, Borzoo}, title = {{Distributed Runtime Verification Under Partial Synchrony}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {20:1--20:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.20}, URN = {urn:nbn:de:0030-drops-135053}, doi = {10.4230/LIPIcs.OPODIS.2020.20}, annote = {Keywords: Runtime monitoring, Distributed systems, Formal methods, Cassandra} } @InProceedings{samadi_et_al:LIPIcs.OPODIS.2020.21, author = {Samadi, Mahboubeh and Ghassemi, Fatemeh and Khosravi, Ramtin}, title = {{Decentralized Runtime Enforcement of Message Sequences in Message-Based Systems}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {21:1--21:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.21}, URN = {urn:nbn:de:0030-drops-135069}, doi = {10.4230/LIPIcs.OPODIS.2020.21}, annote = {Keywords: Asynchronous Message Passing, Choreography-Based, Runtime Enforcement, Runtime Prevention, Message Ordering} } @InProceedings{chen_et_al:LIPIcs.OPODIS.2020.22, author = {Chen, Haimin and Zheng, Chaodong}, title = {{Broadcasting Competitively Against Adaptive Adversary in Multi-Channel Radio Networks}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.22}, URN = {urn:nbn:de:0030-drops-135076}, doi = {10.4230/LIPIcs.OPODIS.2020.22}, annote = {Keywords: Broadcast, radio networks, resource competitive algorithms} } @InProceedings{guerraoui_et_al:LIPIcs.OPODIS.2020.23, author = {Guerraoui, Rachid and Komatovic, Jovan and Kuznetsov, Petr and Pignolet, Yvonne-Anne and Seredinschi, Dragos-Adrian and Tonkikh, Andrei}, title = {{Dynamic Byzantine Reliable Broadcast}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {23:1--23:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.23}, URN = {urn:nbn:de:0030-drops-135087}, doi = {10.4230/LIPIcs.OPODIS.2020.23}, annote = {Keywords: Byzantine reliable broadcast, deterministic distributed algorithms, dynamic distributed systems} } @InProceedings{das_et_al:LIPIcs.OPODIS.2020.24, author = {Das, Shantanu and Giachoudis, Nikos and Luccio, Flaminia L. and Markou, Euripides}, title = {{Broadcasting with Mobile Agents in Dynamic Networks}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {24:1--24:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.24}, URN = {urn:nbn:de:0030-drops-135095}, doi = {10.4230/LIPIcs.OPODIS.2020.24}, annote = {Keywords: Distributed Algorithm, Dynamic Networks, Mobile Agents, Broadcast, Constantly Connected, Global visibility} } @InProceedings{liuzhang_et_al:LIPIcs.OPODIS.2020.25, author = {Liu-Zhang, Chen-Da and Maram, Varun and Maurer, Ueli}, title = {{On Broadcast in Generalized Network and Adversarial Models}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {25:1--25:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.25}, URN = {urn:nbn:de:0030-drops-135108}, doi = {10.4230/LIPIcs.OPODIS.2020.25}, annote = {Keywords: broadcast, partial broadcast, minicast, general adversary, general network} } @InProceedings{parham_et_al:LIPIcs.OPODIS.2020.26, author = {Parham, Mahmoud and Foerster, Klaus-Tycho and Kosic, Petar and Schmid, Stefan}, title = {{Maximally Resilient Replacement Paths for a Family of Product Graphs}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {26:1--26:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.26}, URN = {urn:nbn:de:0030-drops-135111}, doi = {10.4230/LIPIcs.OPODIS.2020.26}, annote = {Keywords: Product Graphs, Resilience, Failures, Routing} } @InProceedings{maurer:LIPIcs.OPODIS.2020.27, author = {Maurer, Alexandre}, title = {{Self-Stabilizing Byzantine-Resilient Communication in Dynamic Networks}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {27:1--27:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.27}, URN = {urn:nbn:de:0030-drops-135126}, doi = {10.4230/LIPIcs.OPODIS.2020.27}, annote = {Keywords: Dynamic networks, Self-stabilization, Byzantine failures} } @InProceedings{censorhillel_et_al:LIPIcs.OPODIS.2020.28, author = {Censor-Hillel, Keren and Dafni, Neta and Kolobov, Victor I. and Paz, Ami and Schwartzman, Gregory}, title = {{Fast Deterministic Algorithms for Highly-Dynamic Networks}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {28:1--28:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.28}, URN = {urn:nbn:de:0030-drops-135138}, doi = {10.4230/LIPIcs.OPODIS.2020.28}, annote = {Keywords: dynamic distributed algorithms} } @InProceedings{faour_et_al:LIPIcs.OPODIS.2020.29, author = {Faour, Salwa and Kuhn, Fabian}, title = {{Approximating Bipartite Minimum Vertex Cover in the CONGEST Model}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.29}, URN = {urn:nbn:de:0030-drops-135149}, doi = {10.4230/LIPIcs.OPODIS.2020.29}, annote = {Keywords: distributed vertex cover, distributed graph algorithms, distributed optimization, bipartite vertex cover} } @InProceedings{ancona_et_al:LIPIcs.OPODIS.2020.30, author = {Ancona, Bertie and Censor-Hillel, Keren and Dalirrooyfard, Mina and Efron, Yuval and Vassilevska Williams, Virginia}, title = {{Distributed Distance Approximation}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {30:1--30:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.30}, URN = {urn:nbn:de:0030-drops-135150}, doi = {10.4230/LIPIcs.OPODIS.2020.30}, annote = {Keywords: Distributed Computing, Distance Computation, Algorithms, Lower Bounds} } @InProceedings{feldmann_et_al:LIPIcs.OPODIS.2020.31, author = {Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian}, title = {{Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {31:1--31:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.31}, URN = {urn:nbn:de:0030-drops-135165}, doi = {10.4230/LIPIcs.OPODIS.2020.31}, annote = {Keywords: hybrid networks, overlay networks, sparse graphs, cactus graphs} } @InProceedings{barenboim_et_al:LIPIcs.OPODIS.2020.32, author = {Barenboim, Leonid and Levin, Harel}, title = {{Secured Distributed Algorithms Without Hardness Assumptions}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {32:1--32:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.32}, URN = {urn:nbn:de:0030-drops-135171}, doi = {10.4230/LIPIcs.OPODIS.2020.32}, annote = {Keywords: distributed algorithms, privacy preserving, graph coloring, generic algorithms, multi-party computation} } @InProceedings{yasumi_et_al:LIPIcs.OPODIS.2020.33, author = {Yasumi, Hiroto and Ooshita, Fukuhito and Inoue, Michiko and Tixeuil, S\'{e}bastien}, title = {{Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {33:1--33:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.33}, URN = {urn:nbn:de:0030-drops-135182}, doi = {10.4230/LIPIcs.OPODIS.2020.33}, annote = {Keywords: population protocol, uniform bipartition, distributed protocol} }