-
1
-
-
0033609572
-
A Simple bivalency proof that t-resilient consensus requires t + 1 rounds
-
Aguilera M.K. and Toueg S., A Simple Bivalency Proof that t-Resilient Consensus Requires t + 1 Rounds. Information Processing Letters, 71:155-178, 1999.
-
(1999)
Information Processing Letters
, vol.71
, pp. 155-178
-
-
Aguilera, M.K.1
Toueg, S.2
-
2
-
-
33748117259
-
Optimal early stopping in distributed consensus
-
Springer-Verlag, LNCS #647
-
Berman P., Garay J.A. and Perry K.J., Optimal Early Stopping in Distributed Consensus. Proc. 6th Int. Workshop on Distributed Algorithms, Springer-Verlag, LNCS #647, pp. 221-237, 1992.
-
(1992)
Proc. 6th Int. Workshop on Distributed Algorithms
, pp. 221-237
-
-
Berman, P.1
Garay, J.A.2
Perry, K.J.3
-
3
-
-
0003426516
-
Uniform consensus is harder than consensus (extended abstract)
-
EPFL, May
-
Charron-Bost B. and Schiper A., Uniform Consensus is Harder than Consensus (Extended Abstract). Technical Report DSC/2000/028, EPFL, May 2000.
-
(2000)
Technical Report DSC/2000/028
-
-
Charron-Bost, B.1
Schiper, A.2
-
4
-
-
0025496224
-
Early stopping in byzantine agreement
-
Dolev D., Reischuk R. and Strong R., Early Stopping in Byzantine Agreement. JACM, 37(4):720-741, 1990.
-
(1990)
JACM
, vol.37
, Issue.4
, pp. 720-741
-
-
Dolev, D.1
Reischuk, R.2
Strong, R.3
-
5
-
-
0001683636
-
Authenticated algorithms for byzantine agreement
-
Dolev D. and Strong R., Authenticated Algorithms for Byzantine Agreement. Siam Journal of Computing, 12:656-666, 1983.
-
(1983)
Siam Journal of Computing
, vol.12
, pp. 656-666
-
-
Dolev, D.1
Strong, R.2
-
6
-
-
0025499183
-
Knowledge and common knowledge in a byzantine environment: Crash failures
-
Dwork C. and Moses Y., Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures, Information Computation, 88(2):156-186, 1990.
-
(1990)
Information Computation
, vol.88
, Issue.2
, pp. 156-186
-
-
Dwork, C.1
Moses, Y.2
-
7
-
-
0000613943
-
A lower bound for the time to assure interactive consistency
-
Fischer M.J. and Lynch N., A Lower Bound for the Time to Assure Interactive Consistency. Information Processing Letters, 71:183-186, 1982.
-
(1982)
Information Processing Letters
, vol.71
, pp. 183-186
-
-
Fischer, M.J.1
Lynch, N.2
-
8
-
-
0022045868
-
Impossibility of distributed consensus with one faulty process
-
April
-
Fischer M.J., Lynch N. and Paterson M.S., Impossibility of Distributed Consensus with One Faulty Process. JACM, 32(2):374-382, April 1985.
-
(1985)
JACM
, vol.32
, Issue.2
, pp. 374-382
-
-
Fischer, M.J.1
Lynch, N.2
Paterson, M.S.3
-
9
-
-
0012525797
-
Fully polynomial byzantine agreement for n > 3t processes in t + 1 rounds
-
Garay J.A. and Moses Y., Fully Polynomial Byzantine Agreement for n > 3t Processes in t + 1 Rounds. SIAM Journal on Computing, 27(1):247-290, 1998.
-
(1998)
SIAM Journal on Computing
, vol.27
, Issue.1
, pp. 247-290
-
-
Garay, J.A.1
Moses, Y.2
-
11
-
-
0003070483
-
Reliable broadcast and related problems
-
ACM Press (S. Mullender Ed.), New-York
-
Hadzilacos V. and Toueg S., Reliable Broadcast and Related Problems. In Distributed Systems, ACM Press (S. Mullender Ed.), New-York, pp. 97-145, 1993.
-
(1993)
Distributed Systems
, pp. 97-145
-
-
Hadzilacos, V.1
Toueg, S.2
-
12
-
-
0037448292
-
A simple proof of the uniform consensus synchronous lower bound
-
Keidar I. and Rajsbaum S., A Simple Proof of the Uniform Consensus Synchronous Lower Bound. Information Processing Letters, 85:47-52, 2003.
-
(2003)
Information Processing Letters
, vol.85
, pp. 47-52
-
-
Keidar, I.1
Rajsbaum, S.2
-
13
-
-
84976699318
-
The byzantine general problem
-
Lamport L., Shostak R. and Pease L., The Byzantine General Problem. ACM TOPLAS, 4(3):382-401,1982.
-
(1982)
ACM TOPLAS
, vol.4
, Issue.3
, pp. 382-401
-
-
Lamport, L.1
Shostak, R.2
Pease, L.3
-
14
-
-
32344443443
-
The complexity of early-deciding in unreliable synchronous networks
-
Microsoft Research, Cambridge (UK)
-
Le Fessant F., The complexity of Early-Deciding in Unreliable Synchronous Networks. Research Report #TR-2003-23, Microsoft Research, Cambridge (UK), 2003.
-
(2003)
Research Report #TR-2003-23
, vol.TR-2003-23
-
-
Le Fessant, F.1
-
16
-
-
0004215089
-
-
Morgan Kaufmann Pub., San Francisco (CA)
-
Lynch N.A., Distributed Algorithms. Morgan Kaufmann Pub., San Francisco (CA), 872 pages, 1996.
-
(1996)
Distributed Algorithms
, pp. 872
-
-
Lynch, N.A.1
-
17
-
-
38249018396
-
Automatically increasing the fault-tolerance of distributed algorithms
-
Neiger G. and Toueg S., Automatically Increasing the Fault-Tolerance of Distributed Algorithms. Journal of Algorithms, 11:374-419, 1990.
-
(1990)
Journal of Algorithms
, vol.11
, pp. 374-419
-
-
Neiger, G.1
Toueg, S.2
-
18
-
-
84976810569
-
Reaching agreement in presence of faults
-
Pease L., Shostak R. and Lamport L., Reaching Agreement in Presence of Faults. JACM, 27(2):228-234, 1980.
-
(1980)
JACM
, vol.27
, Issue.2
, pp. 228-234
-
-
Pease, L.1
Shostak, R.2
Lamport, L.3
-
19
-
-
0022689370
-
Distributed agreement in the presence of processor and communication faults
-
Perry K.J. and Toueg S., Distributed Agreement in the Presence of Processor and Communication Faults. IEEE Transactions on Software Eng., SE-12(3):477-482, 1986.
-
(1986)
IEEE Transactions on Software Eng.
, vol.SE-12
, Issue.3
, pp. 477-482
-
-
Perry, K.J.1
Toueg, S.2
-
21
-
-
1142306590
-
Optimal early-stopping uniform consensus in synchronous systems with process omission failures
-
University of Rennes (France), January
-
Raïpin Parvédy Ph. and Raynal M., Optimal Early-stopping Uniform Consensus in Synchronous Systems with Process Omission Failures. Research Report #1509, University of Rennes (France), January 2003.
-
(2003)
Research Report #1509
, vol.1509
-
-
Raïpin Parvédy, Ph.1
Raynal, M.2
|