Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
Idit Keidar, Oded Naor, Ouri Poupko, and Ehud Shapiro. Cordial Miners: Fast and Efficient Consensus for Every Eventuality. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 26:1-26:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{keidar_et_al:LIPIcs.DISC.2023.26, author = {Keidar, Idit and Naor, Oded and Poupko, Ouri and Shapiro, Ehud}, title = {{Cordial Miners: Fast and Efficient Consensus for Every Eventuality}}, booktitle = {37th International Symposium on Distributed Computing (DISC 2023)}, pages = {26:1--26:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-301-0}, ISSN = {1868-8969}, year = {2023}, volume = {281}, editor = {Oshman, Rotem}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.26}, URN = {urn:nbn:de:0030-drops-191525}, doi = {10.4230/LIPIcs.DISC.2023.26}, annote = {Keywords: Byzantine Fault Tolerance, State Machine Replication, DAG, Consensus, Blockchain, Blocklace, Cordial Dissemination} }
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
Ehud Shapiro. Brief Announcement: Grassroots Distributed Systems: Concept, Examples, Implementation and Applications. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 47:1-47:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{shapiro:LIPIcs.DISC.2023.47, author = {Shapiro, Ehud}, title = {{Brief Announcement: Grassroots Distributed Systems: Concept, Examples, Implementation and Applications}}, booktitle = {37th International Symposium on Distributed Computing (DISC 2023)}, pages = {47:1--47:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-301-0}, ISSN = {1868-8969}, year = {2023}, volume = {281}, editor = {Oshman, Rotem}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.47}, URN = {urn:nbn:de:0030-drops-191735}, doi = {10.4230/LIPIcs.DISC.2023.47}, annote = {Keywords: Grassroots Distributed Systems, Dissemination Protocol, Multiagent Transition Systems, Blocklace, Cordial Dissemination} }
Published in: OASIcs, Volume 110, 4th International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2022)
Dahlia Malkhi and Pawel Szalachowski. Maximal Extractable Value (MEV) Protection on a DAG. In 4th International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2022). Open Access Series in Informatics (OASIcs), Volume 110, pp. 6:1-6:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{malkhi_et_al:OASIcs.Tokenomics.2022.6, author = {Malkhi, Dahlia and Szalachowski, Pawel}, title = {{Maximal Extractable Value (MEV) Protection on a DAG}}, booktitle = {4th International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2022)}, pages = {6:1--6:17}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-274-7}, ISSN = {2190-6807}, year = {2023}, volume = {110}, editor = {Amoussou-Guenou, Yackolley and Kiayias, Aggelos and Verdier, Marianne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.Tokenomics.2022.6}, URN = {urn:nbn:de:0030-drops-184231}, doi = {10.4230/OASIcs.Tokenomics.2022.6}, annote = {Keywords: DAG, MEV, consensus, BFT} }
Published in: LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022)
Oded Naor and Idit Keidar. On Payment Channels in Asynchronous Money Transfer Systems. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 29:1-29:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@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-dev.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} }
Published in: LIPIcs, Volume 245, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)
Peter Mörters, Christian Sohler, and Stefan Walzer. A Sublinear Local Access Implementation for the Chinese Restaurant Process. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 245, pp. 28:1-28:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{morters_et_al:LIPIcs.APPROX/RANDOM.2022.28, author = {M\"{o}rters, Peter and Sohler, Christian and Walzer, Stefan}, title = {{A Sublinear Local Access Implementation for the Chinese Restaurant Process}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)}, pages = {28:1--28:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-249-5}, ISSN = {1868-8969}, year = {2022}, volume = {245}, editor = {Chakrabarti, Amit and Swamy, Chaitanya}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.28}, URN = {urn:nbn:de:0030-drops-171500}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.28}, annote = {Keywords: Chinese restaurant process, Dirichlet process, sublinear time algorithm, random recursive tree, random permutation, random partition, Ewens distribution, simulation, local access implementation, continuous time embedding} }
Published in: LIPIcs, Volume 184, 24th International Conference on Principles of Distributed Systems (OPODIS 2020)
Idit Keidar. Byzantine Agreement and SMR with Sub-Quadratic Message Complexity (Invited Talk). In 24th International Conference on Principles of Distributed Systems (OPODIS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 184, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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-dev.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} }
Published in: LIPIcs, Volume 179, 34th International Symposium on Distributed Computing (DISC 2020)
Oded Naor and Idit Keidar. Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 26:1-26:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{naor_et_al:LIPIcs.DISC.2020.26, author = {Naor, Oded and Keidar, Idit}, title = {{Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {26:1--26:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.26}, URN = {urn:nbn:de:0030-drops-131046}, doi = {10.4230/LIPIcs.DISC.2020.26}, annote = {Keywords: Distributed Systems, State Machine Replication} }
Published in: LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
Ishan Agarwal, Oded Regev, and Yi Tang. Nearly Optimal Embeddings of Flat Tori. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 43:1-43:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{agarwal_et_al:LIPIcs.APPROX/RANDOM.2020.43, author = {Agarwal, Ishan and Regev, Oded and Tang, Yi}, title = {{Nearly Optimal Embeddings of Flat Tori}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {43:1--43:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-164-1}, ISSN = {1868-8969}, year = {2020}, volume = {176}, editor = {Byrka, Jaros{\l}aw and Meka, Raghu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.43}, URN = {urn:nbn:de:0030-drops-126464}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.43}, annote = {Keywords: Lattices, metric embeddings, flat torus} }
Published in: LIPIcs, Volume 146, 33rd International Symposium on Distributed Computing (DISC 2019)
Merav Parter. Small Cuts and Connectivity Certificates: A Fault Tolerant Approach. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 30:1-30:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{parter:LIPIcs.DISC.2019.30, author = {Parter, Merav}, title = {{Small Cuts and Connectivity Certificates: A Fault Tolerant Approach}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {30:1--30:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.30}, URN = {urn:nbn:de:0030-drops-113371}, doi = {10.4230/LIPIcs.DISC.2019.30}, annote = {Keywords: Connectivity, Minimum Cut, Spanners} }
Feedback for Dagstuhl Publishing