Abortable and query-abortable objects and their efficient implementation, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pp.23-32, 2007. ,
DOI : 10.1145/1281100.1281107
Lower bounds for distributed coin-flipping and randomized consensus, Journal of the ACM, vol.45, issue.3, pp.415-450, 1998. ,
DOI : 10.1145/278298.278304
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols, Proc. 2nd ACM Symposium on Principles of Distributed Com- puting(PODC'83), pp.27-30, 1983. ,
Asynchronous Byzantine agreement protocols, Information and Computation, vol.75, issue.2, pp.130-143, 1987. ,
DOI : 10.1016/0890-5401(87)90054-X
URL : http://doi.org/10.1016/0890-5401(87)90054-x
Asynchronous consensus and broadcast protocols, Journal of the ACM, vol.32, issue.4, pp.824-840, 1985. ,
DOI : 10.1145/4221.214134
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.8693
Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement using Cryptography, Proc. 19th Annual ACM Symp. on Principles of Distributed Computing (PODC'00), pp.123-132, 2000. ,
Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996. ,
DOI : 10.1145/226643.226647
From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures, The Computer Journal, vol.49, issue.1, pp.82-96, 2006. ,
DOI : 10.1093/comjnl/bxh145
Consensus in the presence of partial synchrony, Journal of the ACM, vol.35, issue.2, pp.288-323, 1988. ,
DOI : 10.1145/42282.42283
Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985. ,
DOI : 10.1145/3149.214121
3Pmute-Based Consensus for Asynchronous Byzantine Systems, Parallel Processing Letters, pp.162-182, 2005. ,
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems, IEEE Transactions on Dependable and Secure Computing, pp.46-56, 2005. ,
The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982. ,
DOI : 10.1145/357172.357176
Byzantine Fault Detectors for Solving Consensus, The Computer Journal, vol.46, issue.1, pp.16-35, 2003. ,
DOI : 10.1093/comjnl/46.1.16
Fast Byzantine Consensus, IEEE Transactions on Dependable and Secure Computing, vol.3, issue.3, pp.202-215, 2006. ,
DOI : 10.1109/TDSC.2006.35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.5600
Solving Consensus Using Chandra-Toueg???s Unreliable Failure Detectors: A General Quorum-Based Approach, Proc. 13th Int'l Symp. on Distributed Computing (DISC'99), LNCS #1693, pp.49-63, 1999. ,
DOI : 10.1007/3-540-48169-9_4
From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems, Information Processing Letters, vol.73, issue.5-6, pp.207-213, 2000. ,
DOI : 10.1016/S0020-0190(00)00027-2
Reaching Agreement in the Presence of Faults, Journal of the ACM, vol.27, issue.2, pp.228-234, 1980. ,
DOI : 10.1145/322186.322188
Bosco: One-Step Byzantine Asynchronous Consensus, Proc. 22th Symposium on Distributed Computing (DISC'08), pp.438-450, 2008. ,
DOI : 10.1007/978-3-540-87779-0_30
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.2091
Simulating authenticated broadcasts to derive simple fault-tolerant algorithms, Distributed Computing, pp.80-94, 1987. ,
DOI : 10.1007/BF01667080
Extending binary Byzantine agreement to multivalued Byzantine agreement, Information Processing Letters, vol.18, issue.2, pp.73-76, 1984. ,
DOI : 10.1016/0020-0190(84)90027-9