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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.5394
Distributed computing: fundamentals, simulations and advanced topics, p.414, 2004. ,
DOI : 10.1002/0471478210
Another advantage of free choice: completely asynchronous agreement protocols, Proc. 2nd ACM Symposium on Principles of Distributed Computing(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
Asynchronous consensus and broadcast protocols, Journal of the ACM, vol.32, issue.4, pp.824-840, 1985. ,
DOI : 10.1145/4221.214134
Secure and efficient asynchronous broadcast protocols, Proc. 21st Annual International Cryptology Conference CRYPTO'01, pp.524-541, 2001. ,
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
On k-set consensus problems in asynchronous systems, IEEE Transactions on Parallel and Distributed Systems, vol.12, issue.1, pp.7-21, 2001. ,
DOI : 10.1109/71.899936
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
Asynchronous Agreement and Its Relation with Error-Correcting Codes, IEEE Transactions on Computers, vol.56, issue.7, pp.865-875, 2007. ,
DOI : 10.1109/TC.2007.1043
URL : https://hal.archives-ouvertes.fr/inria-00338071
?Pmute-based consensus for asynchronous Byzantine systems, Parallel Processing Letters, vol.15, issue.12, pp.162-182, 2005. ,
Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems, IEEE Transactions on Dependable and Secure Computing, vol.2, issue.1, pp.46-56, 2005. ,
DOI : 10.1109/TDSC.2005.13
On deterministic abortable objects, Proceedings of the 2013 ACM symposium on Principles of distributed computing, PODC '13, pp.4-12, 2013. ,
DOI : 10.1145/2484239.2484241
Byzantine Fault Detectors for Solving Consensus, The Computer Journal, vol.46, issue.1, pp.16-35, 2003. ,
DOI : 10.1093/comjnl/46.1.16
Breaking the O(n 2 ) bit barrier: scalable Byzantine agreement with an adaptive adversary, Proc. 30th ACM Symposium on Principles of Distributed Computing (PODC'11), pp.420-429, 2011. ,
The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982. ,
DOI : 10.1145/357172.357176
Error-free multi-valued consensus with byzantine failures, Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '11, pp.11-20, 2011. ,
DOI : 10.1145/1993806.1993809
Distributed algorithms, 1996. ,
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
On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults, 2011 IEEE 30th International Symposium on Reliable Distributed Systems, pp.235-244, 2011. ,
DOI : 10.1109/SRDS.2011.36
) messages, Proceedings of the 2014 ACM symposium on Principles of distributed computing, PODC '14, pp.2-9, 2014. ,
DOI : 10.1145/2611462.2611468
Conditions on input vectors for consensus solvability in asynchronous distributed systems, Journal of the ACM, vol.50, issue.6, pp.922-954, 2003. ,
DOI : 10.1145/950620.950624
Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value, Proc. 14th Int'l Conference On Principles Of Distributed Systems (OPODIS'010), Springer LNCS 6490, pp.144-159, 2010. ,
DOI : 10.1016/0020-0190(84)90027-9
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
Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity, Proc. 15th Int'l Conference On Principles Of Distributed Systems (OPODIS'10), Springer LNCS 7109, pp.34-49, 2011. ,
DOI : 10.1007/978-3-642-25873-2_4
Reaching Agreement in the Presence of Faults, Journal of the ACM, vol.27, issue.2, pp.228-234, 1980. ,
DOI : 10.1145/322186.322188
Randomized byzantine generals, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), pp.116-124, 1983. ,
DOI : 10.1109/SFCS.1983.48
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, 2010. ,
DOI : 10.2200/S00236ED1V01Y201004DCT002
URL : https://hal.archives-ouvertes.fr/inria-00543036
Fault-tolerant Agreement in Synchronous Message-passing Systems, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, p.2010 ,
DOI : 10.2200/S00294ED1V01Y201009DCT003
URL : https://hal.archives-ouvertes.fr/inria-00543049
Concurrent programming: algorithms, principles and foundations, p.2013 ,
DOI : 10.1007/978-3-642-32027-9
URL : https://hal.archives-ouvertes.fr/hal-00922217
Randomized Byzantine Agreements, Proceedings of the third annual ACM symposium on Principles of distributed computing , PODC '84, pp.163-178, 1984. ,
DOI : 10.1145/800222.806744
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