EASY IMPOSSIBILITY PROOFS FOR DISTRIBUTED CONSENSUS PROBLEMS

被引：126

作者：

FISCHER, MJ

LYNCH, NA

MERRITT, M

机构：

[1] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139

[2] AT&T BELL LABS,MURRAY HILL,NJ 07974

来源：

DISTRIBUTED COMPUTING | 1986年 / 1卷 / 01期

关键词：

D O I：

10.1007/BF01843568

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：26 / 39

页数：14

共 50 条

[1] EASY IMPOSSIBILITY PROOFS FOR DISTRIBUTED CONSENSUS PROBLEMS
FISCHER, MJ
LYNCH, NA
MERRITT, M
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 448 : 147 - 170
[2] Distributed Computing Theory: Algorithms, Impossibility Results, Models, and Proofs
Lynch, Nancy
STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 247 - 247
[3] IMPOSSIBILITY OF DISTRIBUTED CONSENSUS WITH ONE FAULTY PROCESS
FISCHER, MJ
LYNCH, NA
PATERSON, MS
JOURNAL OF THE ACM, 1985, 32 (02) : 374 - 382
[4] Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems
Biely, Martin
Robinson, Peter
Schmid, Ulrich
PRINCIPLES OF DISTRIBUTED SYSTEMS, 2011, 7109 : 299 - +
[5] Brief Announcement: Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems
Biely, Martin
Robinson, Peter
Schmid, Ulrich
PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, 2011, : 227 - 228
[6] Truthmaking, Evidence Of, and Impossibility Proofs
Heathcote, Adrian
ACTA ANALYTICA-INTERNATIONAL PERIODICAL FOR PHILOSOPHY IN THE ANALYTICAL TRADITION, 2014, 29 (03): : 363 - 375
[7] Truthmaking, Evidence Of, and Impossibility Proofs
Adrian Heathcote
Acta Analytica, 2014, 29 : 363 - 375
[8] Brief proofs of Arrovian impossibility theorems
Susumu Cato
Social Choice and Welfare, 2010, 35 : 267 - 284
[9] Brief proofs of Arrovian impossibility theorems
Cato, Susumu
SOCIAL CHOICE AND WELFARE, 2010, 35 (02) : 267 - 284
[10] Impossibility proofs for RSA signatures in the standard model
Paillier, Pascal
Topics in Cryptology - CT-RSA 2007, Proceedings, 2007, 4377 : 31 - 48

← 1 2 3 4 5 →