Brief Announcement: On the Uncontended Complexity of Anonymous Consensus

被引：0
|
作者：
Capdevielle, Claire [1 ]
Johnen, Colette [1 ]
Kuznetsov, Petr [2 ]
Milani, Alessia [1 ]
机构：
[1] Univ Bordeaux, LaBRI, UMR 5800, F-33400 Talence, France
[2] Telecom ParisTech, Paris, France
来源：
DISTRIBUTED COMPUTING (DISC 2015) | 2015年 / 9363卷
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：667 / 668
页数：2
相关论文
共 50 条
  • [21] Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks
    Michail, Othon
    Chatzigiannakis, Ioannis
    Spirakis, Paul G.
    DISTRIBUTED COMPUTING, DISC 2012, 2012, 7611 : 437 - 438
  • [22] Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
    Di Luna, Giuseppe A.
    Viglietta, Giovanni
    PROCEEDINGS OF THE 2023 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, PODC 2023, 2023, : 176 - 179
  • [23] Brief Announcement: Average Complexity for the LOCAL Model
    Feuilloley, Laurent
    PODC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2015, : 335 - 337
  • [24] Communication Complexity of Consensus in Anonymous Message Passing Systems
    Fusco, Emanuele G.
    Pelc, Andrzej
    PRINCIPLES OF DISTRIBUTED SYSTEMS, 2011, 7109 : 191 - +
  • [25] Communication Complexity of Consensus in Anonymous Message Passing Systems
    Fusco, Emanuele G.
    Pelc, Andrzej
    FUNDAMENTA INFORMATICAE, 2015, 137 (03) : 305 - 322
  • [26] Brief Announcement: A Closer Look at Quantum Distributed Consensus
    Golab, Wojciech
    Tan, Hao
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 539 - 541
  • [27] Brief Announcement: Stabilizing Consensus with the Power of Two Choices
    Doerr, Benjamin
    Goldberg, Leslie Ann
    Minder, Lorenz
    Sauerwald, Thomas
    Scheideler, Christian
    DISTRIBUTED COMPUTING, 2010, 6343 : 528 - +
  • [28] Anonymous Deniable Identification in Ephemeral Setup and Leakage Scenarios (Brief Announcement)
    Krzywiecki, Lukasz
    Kutylowski, Miroslaw
    Pezda, Jakub
    Slowik, Marcin
    CYBER SECURITY CRYPTOGRAPHY AND MACHINE LEARNING, CSCML 2019, 2019, 11527 : 320 - 323
  • [29] Complexity of Optimal Lobbying in Threshold Aggregation (Brief Announcement)
    Nehama, Ilan
    ALGORITHMIC GAME THEORY, SAGT 2014, 2014, 8768 : 295 - 295
  • [30] Self-stabilizing Byzantine Consensus for Blockchain (Brief Announcement)
    Binun, Alexander
    Dolev, Shlomi
    Hadad, Tal
    CYBER SECURITY CRYPTOGRAPHY AND MACHINE LEARNING, CSCML 2019, 2019, 11527 : 106 - 110
12345