-
1
-
-
0012575110
-
On the message complexity of binary agreement under crash failures
-
S. Amdur, S. Weber, and V. Hadzilacos, On the message complexity of binary agreement under crash failures, Distributed Computing, 5 (1992) 175-186.
-
(1992)
Distributed Computing
, vol.5
, pp. 175-186
-
-
Amdur, S.1
Weber, S.2
Hadzilacos, V.3
-
2
-
-
0141610192
-
Randomized protocols for asynchronous consensus
-
J. Aspnes, Randomized protocols for asynchronous consensus, Distributed Computing, 16 (2003) 165-175.
-
(2003)
Distributed Computing
, vol.16
, pp. 165-175
-
-
Aspnes, J.1
-
5
-
-
0022144724
-
Asynchronous consensus and broadcast protocols
-
G. Bracha, and S. Toueg, Asynchronous consensus and broadcast protocols, Journal of the ACM, 32 (1985) 824-840.
-
(1985)
Journal of the ACM
, vol.32
, pp. 824-840
-
-
Bracha, G.1
Toueg, S.2
-
8
-
-
33845210348
-
-
B.S. Chlebus, and D.R. Kowalski, Time and communication efficient consensus for crash failures, in Proceedings of the 21st International Symposium on Distributed Computing (DISC), 2006, Springer LNCS 4167, pp. 314-328.
-
B.S. Chlebus, and D.R. Kowalski, Time and communication efficient consensus for crash failures, in Proceedings of the 21st International Symposium on Distributed Computing (DISC), 2006, Springer LNCS 4167, pp. 314-328.
-
-
-
-
9
-
-
0021976090
-
Bounds on information exchange for Byzantine agreement
-
D. Dolev, and R. Reischuk, Bounds on information exchange for Byzantine agreement, Journal of the ACM, 32 (1985) 191-204.
-
(1985)
Journal of the ACM
, vol.32
, pp. 191-204
-
-
Dolev, D.1
Reischuk, R.2
-
10
-
-
0001280843
-
Performing work efficiently in the presence of faults
-
C. Dwork, J. Halpern, and O. Waarts, Performing work efficiently in the presence of faults, SIAM Journal on Computing, 27 (1998) 1457-1491.
-
(1998)
SIAM Journal on Computing
, vol.27
, pp. 1457-1491
-
-
Dwork, C.1
Halpern, J.2
Waarts, O.3
-
11
-
-
0031210863
-
An optimal probabilistic protocol for synchronous Byzantine agreement
-
P. Feldman, and S. Micali, An optimal probabilistic protocol for synchronous Byzantine agreement, SIAM Journal on Computing, 26 (1997) 873-933.
-
(1997)
SIAM Journal on Computing
, vol.26
, pp. 873-933
-
-
Feldman, P.1
Micali, S.2
-
12
-
-
0141854015
-
Hundreds of impossibility results for distributed computing
-
F. Fich, and E. Ruppert, Hundreds of impossibility results for distributed computing, Distributed Computing, 16 (2003) 121-163.
-
(2003)
Distributed Computing
, vol.16
, pp. 121-163
-
-
Fich, F.1
Ruppert, E.2
-
13
-
-
0000613943
-
A lower bound for the time to assure interactive consistency
-
M. Fisher, and N. Lynch, A lower bound for the time to assure interactive consistency, Information Processing Letters, 14 (1982) 183-186.
-
(1982)
Information Processing Letters
, vol.14
, pp. 183-186
-
-
Fisher, M.1
Lynch, N.2
-
14
-
-
0022045868
-
Impossibility of distributed consensus with one faulty process
-
M. Fisher, N. Lynch, and M. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, 32 (1985) 374-382.
-
(1985)
Journal of the ACM
, vol.32
, pp. 374-382
-
-
Fisher, M.1
Lynch, N.2
Paterson, M.3
-
15
-
-
0029510897
-
Resolving message complexity of Byzantine agreement and beyond
-
Z. Galil, A. Mayer, and M. Yung, Resolving message complexity of Byzantine agreement and beyond, in Proceedings of the 36th IEEE Symposium on Foundations of Computer Science (FOCS), 1995, pp. 724-733.
-
(1995)
Proceedings of the 36th IEEE Symposium on Foundations of Computer Science (FOCS)
, pp. 724-733
-
-
Galil, Z.1
Mayer, A.2
Yung, M.3
-
16
-
-
57549085187
-
On the complexity of asynchronous gossip
-
C. Georgiou, S. Gilbert, R. Guerraoui, and D.R. Kowalski, On the complexity of asynchronous gossip, in Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC), 2008, pp. 135-144.
-
(2008)
Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC)
, pp. 135-144
-
-
Georgiou, C.1
Gilbert, S.2
Guerraoui, R.3
Kowalski, D.R.4
-
17
-
-
38049011966
-
-
S. Gilbert, R. Guerraoui, and D.R. Kowalski, On the message complexity of indulgent consensus, in Proceedings of the 21st International Symposium on Distributed Computing (DISC), 2007, Springer LNCS 4731, pp. 283-297.
-
S. Gilbert, R. Guerraoui, and D.R. Kowalski, On the message complexity of indulgent consensus, in Proceedings of the 21st International Symposium on Distributed Computing (DISC), 2007, Springer LNCS 4731, pp. 283-297.
-
-
-
-
19
-
-
51649126675
-
Lower bound for scalable Byzantine Agreement
-
D. Holtby, B.M. Kapron, and V. King, Lower bound for scalable Byzantine Agreement, Distributed Computing, 21 (2008) 239-248.
-
(2008)
Distributed Computing
, vol.21
, pp. 239-248
-
-
Holtby, D.1
Kapron, B.M.2
King, V.3
-
20
-
-
33244463798
-
Scalable leader election
-
V. King, J. Saia, V. Sanwalani, and E. Vee, Scalable leader election, in Proceedings of the 17th ACM-SIAM Symposium on Discrete algorithms (SODA), 2006, pp. 990-999.
-
(2006)
Proceedings of the 17th ACM-SIAM Symposium on Discrete algorithms (SODA)
, pp. 990-999
-
-
King, V.1
Saia, J.2
Sanwalani, V.3
Vee, E.4
-
21
-
-
38049008242
-
Towards secure and scalable computation in peer-to-peer networks
-
V. King, J. Saia, V. Sanwalani, and E. Vee, Towards secure and scalable computation in peer-to-peer networks, in Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (FOCS), 2006, pp. 87-98.
-
(2006)
Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (FOCS)
, pp. 87-98
-
-
King, V.1
Saia, J.2
Sanwalani, V.3
Vee, E.4
-
22
-
-
84976699318
-
The Byzantine generals problem
-
L. Lamport, R. Shostak, and M. Pease, The Byzantine generals problem, ACM Transactions on Programming Languages and Systems, 4 (1982) 382-401.
-
(1982)
ACM Transactions on Programming Languages and Systems
, vol.4
, pp. 382-401
-
-
Lamport, L.1
Shostak, R.2
Pease, M.3
-
24
-
-
84976810569
-
Reaching agreement in the presence of faults
-
M. Pease, R. Shostak, and L. Lamport, Reaching agreement in the presence of faults, Journal of the ACM, 27 (1980) 228-234.
-
(1980)
Journal of the ACM
, vol.27
, pp. 228-234
-
-
Pease, M.1
Shostak, R.2
Lamport, L.3
-
25
-
-
0023580443
-
Sorting and selecting in rounds
-
N. Pippenger, Sorting and selecting in rounds, SIAM Journal on Computing, 16 (1987) 1032-1038.
-
(1987)
SIAM Journal on Computing
, vol.16
, pp. 1032-1038
-
-
Pippenger, N.1
-
26
-
-
0002956996
-
Bounds for dispersers, extractors, and depth-two superconcentrators
-
J. Radhakrishnan, and A. Ta-Shma, Bounds for dispersers, extractors, and depth-two superconcentrators, SIAM Journal of Discrete Mathematics, 13 (2000) 2-24.
-
(2000)
SIAM Journal of Discrete Mathematics
, vol.13
, pp. 2-24
-
-
Radhakrishnan, J.1
Ta-Shma, A.2
-
27
-
-
34248175874
-
Lossless condensers, unbalanced expanders, and extractors
-
A. Ta-Shma, C. Umans, and D. Zuckerman, Lossless condensers, unbalanced expanders, and extractors, Combinatorica, 27 (2007) 213-240.
-
(2007)
Combinatorica
, vol.27
, pp. 213-240
-
-
Ta-Shma, A.1
Umans, C.2
Zuckerman, D.3
|