Published in: OASIcs, Volume 108, Fourth Workshop on Next Generation Real-Time Embedded Systems (NG-RES 2023)
Ehsan Shahri, Paulo Pedreiras, and Luis Almeida. Response Time Analysis for RT-MQTT Protocol Grounded on SDN. In Fourth Workshop on Next Generation Real-Time Embedded Systems (NG-RES 2023). Open Access Series in Informatics (OASIcs), Volume 108, pp. 5:1-5:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{shahri_et_al:OASIcs.NG-RES.2023.5, author = {Shahri, Ehsan and Pedreiras, Paulo and Almeida, Luis}, title = {{Response Time Analysis for RT-MQTT Protocol Grounded on SDN}}, booktitle = {Fourth Workshop on Next Generation Real-Time Embedded Systems (NG-RES 2023)}, pages = {5:1--5:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-268-6}, ISSN = {2190-6807}, year = {2023}, volume = {108}, editor = {Terraneo, Federico and Cattaneo, Daniele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.NG-RES.2023.5}, URN = {urn:nbn:de:0030-drops-177364}, doi = {10.4230/OASIcs.NG-RES.2023.5}, annote = {Keywords: Real-time systems, OpenFlow, fixed-priority non-preemptive scheduling, response time analysis, MQTT} }
Published in: OASIcs, Volume 104, 11th Symposium on Languages, Applications and Technologies (SLATE 2022)
Luís Filipe Cunha, J. João Almeida, and Alberto Simões. Reasoning with Portuguese Word Embeddings. In 11th Symposium on Languages, Applications and Technologies (SLATE 2022). Open Access Series in Informatics (OASIcs), Volume 104, pp. 17:1-17:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cunha_et_al:OASIcs.SLATE.2022.17, author = {Cunha, Lu{\'\i}s Filipe and Almeida, J. Jo\~{a}o and Sim\~{o}es, Alberto}, title = {{Reasoning with Portuguese Word Embeddings}}, booktitle = {11th Symposium on Languages, Applications and Technologies (SLATE 2022)}, pages = {17:1--17:14}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-245-7}, ISSN = {2190-6807}, year = {2022}, volume = {104}, editor = {Cordeiro, Jo\~{a}o and Pereira, Maria Jo\~{a}o and Rodrigues, Nuno F. and Pais, Sebasti\~{a}o}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2022.17}, URN = {urn:nbn:de:0030-drops-167636}, doi = {10.4230/OASIcs.SLATE.2022.17}, annote = {Keywords: Word Embeddings, Word2Vec, Evaluation Methods} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Zhenjian Lu, Igor C. Oliveira, and Marius Zimand. Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 92:1-92:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lu_et_al:LIPIcs.ICALP.2022.92, author = {Lu, Zhenjian and Oliveira, Igor C. and Zimand, Marius}, title = {{Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {92:1--92:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.92}, URN = {urn:nbn:de:0030-drops-164331}, doi = {10.4230/LIPIcs.ICALP.2022.92}, annote = {Keywords: computational complexity, randomized algorithms, Kolmogorov complexity} }
Published in: OASIcs, Volume 93, 3rd Conference on Language, Data and Knowledge (LDK 2021)
Christian Chiarcos, Maxim Ionov, Luis Glaser, and Christian Fäth. An Ontology for CoNLL-RDF: Formal Data Structures for TSV Formats in Language Technology. In 3rd Conference on Language, Data and Knowledge (LDK 2021). Open Access Series in Informatics (OASIcs), Volume 93, pp. 20:1-20:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{chiarcos_et_al:OASIcs.LDK.2021.20, author = {Chiarcos, Christian and Ionov, Maxim and Glaser, Luis and F\"{a}th, Christian}, title = {{An Ontology for CoNLL-RDF: Formal Data Structures for TSV Formats in Language Technology}}, booktitle = {3rd Conference on Language, Data and Knowledge (LDK 2021)}, pages = {20:1--20:14}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-199-3}, ISSN = {2190-6807}, year = {2021}, volume = {93}, editor = {Gromann, Dagmar and S\'{e}rasset, Gilles and Declerck, Thierry and McCrae, John P. and Gracia, Jorge and Bosque-Gil, Julia and Bobillo, Fernando and Heinisch, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.LDK.2021.20}, URN = {urn:nbn:de:0030-drops-145566}, doi = {10.4230/OASIcs.LDK.2021.20}, annote = {Keywords: language technology, data models, CoNLL-RDF, ontology} }
Published in: OASIcs, Volume 87, Second Workshop on Next Generation Real-Time Embedded Systems (NG-RES 2021)
Miguel Gutiérrez Gaitán, Luís Almeida, Pedro Miguel Santos, and Patrick Meumeu Yomsi. EDF Scheduling and Minimal-Overlap Shortest-Path Routing for Real-Time TSCH Networks. In Second Workshop on Next Generation Real-Time Embedded Systems (NG-RES 2021). Open Access Series in Informatics (OASIcs), Volume 87, pp. 2:1-2:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{gaitan_et_al:OASIcs.NG-RES.2021.2, author = {Gait\'{a}n, Miguel Guti\'{e}rrez and Almeida, Lu{\'\i}s and Santos, Pedro Miguel and Yomsi, Patrick Meumeu}, title = {{EDF Scheduling and Minimal-Overlap Shortest-Path Routing for Real-Time TSCH Networks}}, booktitle = {Second Workshop on Next Generation Real-Time Embedded Systems (NG-RES 2021)}, pages = {2:1--2:12}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-178-8}, ISSN = {2190-6807}, year = {2021}, volume = {87}, editor = {Bertogna, Marko and Terraneo, Federico}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.NG-RES.2021.2}, URN = {urn:nbn:de:0030-drops-134786}, doi = {10.4230/OASIcs.NG-RES.2021.2}, annote = {Keywords: Real-time communication, Routing, Scheduling, TDMA, Wireless networks} }
Published in: OASIcs, Volume 81, First International Computer Programming Education Conference (ICPEC 2020)
Marcela Viana P. Almeida, Luís M. Alves, Maria João Varanda Pereira, and Glívia Angélica R. Barbosa. EasyCoding - Methodology to Support Programming Learning. In First International Computer Programming Education Conference (ICPEC 2020). Open Access Series in Informatics (OASIcs), Volume 81, pp. 1:1-1:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{almeida_et_al:OASIcs.ICPEC.2020.1, author = {Almeida, Marcela Viana P. and Alves, Lu{\'\i}s M. and Pereira, Maria Jo\~{a}o Varanda and Barbosa, Gl{\'\i}via Ang\'{e}lica R.}, title = {{EasyCoding - Methodology to Support Programming Learning}}, booktitle = {First International Computer Programming Education Conference (ICPEC 2020)}, pages = {1:1--1:8}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-153-5}, ISSN = {2190-6807}, year = {2020}, volume = {81}, editor = {Queir\'{o}s, Ricardo and Portela, Filipe and Pinto, M\'{a}rio and Sim\~{o}es, Alberto}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2020.1}, URN = {urn:nbn:de:0030-drops-122887}, doi = {10.4230/OASIcs.ICPEC.2020.1}, annote = {Keywords: learning programming, teaching programming, automatic activity guides, programming motivation} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Boris Aronov, Esther Ezra, and Micha Sharir. Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{aronov_et_al:LIPIcs.SoCG.2020.8, author = {Aronov, Boris and Ezra, Esther and Sharir, Micha}, title = {{Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {8:1--8:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.8}, URN = {urn:nbn:de:0030-drops-121666}, doi = {10.4230/LIPIcs.SoCG.2020.8}, annote = {Keywords: Algebraic decision tree, Polynomial partition, Collinearity testing, 3SUM-hard problems, Polynomials vanishing on Cartesian products} }
Published in: OASIcs, Volume 77, Workshop on Next Generation Real-Time Embedded Systems (NG-RES 2020)
Luis Almeida. SDN for Dynamic Reservations on Real-Time Networks (Invited Talk). In Workshop on Next Generation Real-Time Embedded Systems (NG-RES 2020). Open Access Series in Informatics (OASIcs), Volume 77, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{almeida:OASIcs.NG-RES.2020.1, author = {Almeida, Luis}, title = {{SDN for Dynamic Reservations on Real-Time Networks}}, booktitle = {Workshop on Next Generation Real-Time Embedded Systems (NG-RES 2020)}, pages = {1:1--1:1}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-136-8}, ISSN = {2190-6807}, year = {2020}, volume = {77}, editor = {Bertogna, Marko and Terraneo, Federico}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.NG-RES.2020.1}, URN = {urn:nbn:de:0030-drops-117774}, doi = {10.4230/OASIcs.NG-RES.2020.1}, annote = {Keywords: Latency-constrained networks, Real-time communication, Software-defined networking} }
Published in: LIPIcs, Volume 125, 22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
Keren Censor-Hillel, Dean Leitersdorf, and Elia Turner. Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model. In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 125, pp. 4:1-4:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{censorhillel_et_al:LIPIcs.OPODIS.2018.4, author = {Censor-Hillel, Keren and Leitersdorf, Dean and Turner, Elia}, title = {{Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model}}, booktitle = {22nd International Conference on Principles of Distributed Systems (OPODIS 2018)}, pages = {4:1--4:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-098-9}, ISSN = {1868-8969}, year = {2019}, volume = {125}, editor = {Cao, Jiannong and Ellen, Faith and Rodrigues, Luis and Ferreira, Bernardo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2018.4}, URN = {urn:nbn:de:0030-drops-100645}, doi = {10.4230/LIPIcs.OPODIS.2018.4}, annote = {Keywords: congested clique, matrix multiplication, triangle listing} }
Published in: LIPIcs, Volume 125, 22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
Tanmay Inamdar, Shreyas Pai, and Sriram V. Pemmaraju. Large-Scale Distributed Algorithms for Facility Location with Outliers. In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 125, pp. 5:1-5:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{inamdar_et_al:LIPIcs.OPODIS.2018.5, author = {Inamdar, Tanmay and Pai, Shreyas and Pemmaraju, Sriram V.}, title = {{Large-Scale Distributed Algorithms for Facility Location with Outliers}}, booktitle = {22nd International Conference on Principles of Distributed Systems (OPODIS 2018)}, pages = {5:1--5:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-098-9}, ISSN = {1868-8969}, year = {2019}, volume = {125}, editor = {Cao, Jiannong and Ellen, Faith and Rodrigues, Luis and Ferreira, Bernardo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2018.5}, URN = {urn:nbn:de:0030-drops-100650}, doi = {10.4230/LIPIcs.OPODIS.2018.5}, annote = {Keywords: Distributed Algorithms, Clustering with Outliers, Metric Facility Location, Massively Parallel Computation, k-machine model, Congested Clique} }
Published in: LIPIcs, Volume 125, 22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
Keren Censor-Hillel, Ami Paz, and Noam Ravid. The Sparsest Additive Spanner via Multiple Weighted BFS Trees. In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 125, pp. 7:1-7:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{censorhillel_et_al:LIPIcs.OPODIS.2018.7, author = {Censor-Hillel, Keren and Paz, Ami and Ravid, Noam}, title = {{The Sparsest Additive Spanner via Multiple Weighted BFS Trees}}, booktitle = {22nd International Conference on Principles of Distributed Systems (OPODIS 2018)}, pages = {7:1--7:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-098-9}, ISSN = {1868-8969}, year = {2019}, volume = {125}, editor = {Cao, Jiannong and Ellen, Faith and Rodrigues, Luis and Ferreira, Bernardo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2018.7}, URN = {urn:nbn:de:0030-drops-100676}, doi = {10.4230/LIPIcs.OPODIS.2018.7}, annote = {Keywords: Distributed graph algorithms, congest model, weighted BFS trees, additive spanners} }
Published in: LIPIcs, Volume 125, 22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
Vitaly Aksenov, Petr Kuznetsov, and Anatoly Shalyto. Parallel Combining: Benefits of Explicit Synchronization. In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 125, pp. 11:1-11:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{aksenov_et_al:LIPIcs.OPODIS.2018.11, author = {Aksenov, Vitaly and Kuznetsov, Petr and Shalyto, Anatoly}, title = {{Parallel Combining: Benefits of Explicit Synchronization}}, booktitle = {22nd International Conference on Principles of Distributed Systems (OPODIS 2018)}, pages = {11:1--11:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-098-9}, ISSN = {1868-8969}, year = {2019}, volume = {125}, editor = {Cao, Jiannong and Ellen, Faith and Rodrigues, Luis and Ferreira, Bernardo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2018.11}, URN = {urn:nbn:de:0030-drops-100713}, doi = {10.4230/LIPIcs.OPODIS.2018.11}, annote = {Keywords: concurrent data structure, parallel batched data structure, combining} }
Published in: LIPIcs, Volume 125, 22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
Hengfeng Wei, Yu Huang, and Jian Lu. Specification and Implementation of Replicated List: The Jupiter Protocol Revisited. In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 125, pp. 12:1-12:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{wei_et_al:LIPIcs.OPODIS.2018.12, author = {Wei, Hengfeng and Huang, Yu and Lu, Jian}, title = {{Specification and Implementation of Replicated List: The Jupiter Protocol Revisited}}, booktitle = {22nd International Conference on Principles of Distributed Systems (OPODIS 2018)}, pages = {12:1--12:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-098-9}, ISSN = {1868-8969}, year = {2019}, volume = {125}, editor = {Cao, Jiannong and Ellen, Faith and Rodrigues, Luis and Ferreira, Bernardo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2018.12}, URN = {urn:nbn:de:0030-drops-100720}, doi = {10.4230/LIPIcs.OPODIS.2018.12}, annote = {Keywords: Collaborative text editing systems, Replicated list, Concurrency control, Strong/weak list specification, Operational transformation, Jupiter protocol} }
Published in: LIPIcs, Volume 125, 22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
Dimitris Sakavalas, Lewis Tseng, and Nitin H. Vaidya. Effects of Topology Knowledge and Relay Depth on Asynchronous Appoximate Consensus. In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 125, pp. 14:1-14:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{sakavalas_et_al:LIPIcs.OPODIS.2018.14, author = {Sakavalas, Dimitris and Tseng, Lewis and Vaidya, Nitin H.}, title = {{Effects of Topology Knowledge and Relay Depth on Asynchronous Appoximate Consensus}}, booktitle = {22nd International Conference on Principles of Distributed Systems (OPODIS 2018)}, pages = {14:1--14:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-098-9}, ISSN = {1868-8969}, year = {2019}, volume = {125}, editor = {Cao, Jiannong and Ellen, Faith and Rodrigues, Luis and Ferreira, Bernardo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2018.14}, URN = {urn:nbn:de:0030-drops-100744}, doi = {10.4230/LIPIcs.OPODIS.2018.14}, annote = {Keywords: Asynchrony, crash, consensus, incomplete graphs, topology knowledge} }
Published in: LIPIcs, Volume 125, 22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
Adam Shimi, Aurélie Hurault, and Philippe Quéinnec. Characterizing Asynchronous Message-Passing Models Through Rounds. In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 125, pp. 18:1-18:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{shimi_et_al:LIPIcs.OPODIS.2018.18, author = {Shimi, Adam and Hurault, Aur\'{e}lie and Qu\'{e}innec, Philippe}, title = {{Characterizing Asynchronous Message-Passing Models Through Rounds}}, booktitle = {22nd International Conference on Principles of Distributed Systems (OPODIS 2018)}, pages = {18:1--18:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-098-9}, ISSN = {1868-8969}, year = {2019}, volume = {125}, editor = {Cao, Jiannong and Ellen, Faith and Rodrigues, Luis and Ferreira, Bernardo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2018.18}, URN = {urn:nbn:de:0030-drops-100783}, doi = {10.4230/LIPIcs.OPODIS.2018.18}, annote = {Keywords: Message-passing, Asynchronous Rounds, Dominant Strategies, Failures} }
Feedback for Dagstuhl Publishing