Zobrazeno 1 - 10
of 230
pro vyhledávání: '"Pierre Fraigniaud"'
Autor:
Laurent Feuilloley, Pierre Fraigniaud
Publikováno v:
DISC 2017-31st International Symposium on Distributed Computing
DISC 2017-31st International Symposium on Distributed Computing, Oct 2017, Vienna, Austria. pp.1-15, ⟨10.4230/LIPIcs.DISC.2017.16⟩
DISC 2017-31st International Symposium on Distributed Computing, Oct 2017, Vienna, Austria. pp.1-15, ⟨10.4230/LIPIcs.DISC.2017.16⟩
International audience; Proof-labeling schemes are known mechanisms providing nodes of networks with certificates that can be verified locally by distributed algorithms. Given a boolean predicate on network states, such schemes enable to check whethe
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783031327322
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e6c21da3e7bf7f45ff5e52ef43d9315
https://doi.org/10.1007/978-3-031-32733-9_21
https://doi.org/10.1007/978-3-031-32733-9_21
Autor:
Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld
Publikováno v:
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing.
Publikováno v:
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing.
Publikováno v:
32nd International Symposium on Distributed Computing
32nd International Symposium on Distributed Computing, 2018, New Orleans, United States. ⟨10.4230/LIPIcs.DISC.2018.24⟩
Distributed Computing
32nd International Symposium on Distributed Computing, 2018, New Orleans, United States. ⟨10.4230/LIPIcs.DISC.2018.24⟩
Distributed Computing
Distributed proofs are mechanisms enabling the nodes of a network to collectivity and efficiently check the correctness of Boolean predicates on the structure of the network, or on data-structures distributed over the nodes (e.g., spanning trees or r
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783031099922
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21131d154646b819d0cf1500773fac8f
https://doi.org/10.1007/978-3-031-09993-9_7
https://doi.org/10.1007/978-3-031-09993-9_7
Autor:
Ami Paz, Matthieu Roy, Sergio Rajsbaum, Pierre Fraigniaud, Armando Castañeda, Corentin Travers
Publikováno v:
26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019)
26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019), Jul 2019, L'Aquila, Italy. ⟨10.1007/978-3-030-24922-9_1⟩
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2021, 849, pp.121-137. ⟨10.1016/j.tcs.2020.10.012⟩
26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019), Jul 2019, L'Aquila, Italy
Structural Information and Communication Complexity ISBN: 9783030249212
SIROCCO
26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019), Jul 2019, L'Aquila, Italy. ⟨10.1007/978-3-030-24922-9_1⟩
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2021, 849, pp.121-137. ⟨10.1016/j.tcs.2020.10.012⟩
26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019), Jul 2019, L'Aquila, Italy
Structural Information and Communication Complexity ISBN: 9783030249212
SIROCCO
International audience; More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems. In this work, we show that combinatorial top
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::467d7a1e052ea7777cd533bc00cc6aec
http://arxiv.org/abs/1907.03565
http://arxiv.org/abs/1907.03565
Publikováno v:
PODC
Studying distributed computing through the lens of algebraic topology has been the source of many significant breakthroughs during the last two decades, especially in the design of lower bounds or impossibility results for deterministic algorithms. I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa4c79944ef9555594e957d3166e52e2
http://arxiv.org/abs/2105.11713
http://arxiv.org/abs/2105.11713
Autor:
Pierre Fraigniaud
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030910808
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eac0d286f3a184ece183c20d48a25b5e
https://doi.org/10.1007/978-3-030-91081-5_7
https://doi.org/10.1007/978-3-030-91081-5_7