Communication-efficient leader election and consensus with limited link synchrony, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, 2004. ,
DOI : 10.1145/1011767.1011816
URL : https://hal.archives-ouvertes.fr/hal-00154865
Consensus with Byzantine Failures and Little System Synchrony, International Conference on Dependable Systems and Networks (DSN'06), 2006. ,
DOI : 10.1109/DSN.2006.22
URL : https://hal.archives-ouvertes.fr/hal-00154870
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols, Proc. 2nd ACM Symposium on Principles of Distributed Computing (PODC'83), pp.27-30, 1983. ,
Practical Byzantine fault tolerance, Proc. of the 3rd Symposium on Operating Systems Design and Implementation, 1999. ,
Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996. ,
DOI : 10.1145/226643.226647
Encapsulating Failure Detection: From Crash to Byzantine Failures, Proc. International Conference on Reliable Software Technologies, 2002. ,
DOI : 10.1007/3-540-48046-3_3
Best-Case Complexity of Asynchronous Byzantine Consensus, 2005. ,
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
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
$\diamondsuit {\mathcal P}_{mute}$-BASED CONSENSUS for ASYNCHRONOUS BYZANTINE SYSTEMS, Parallel Processing Letters, vol.15, issue.01n02, pp.169-182, 2005. ,
DOI : 10.1142/S0129626405002131
Chasing the Weakest System Model for Implementing Omega and Consensus Solving Consensus in a Byzantine Environment Using an Unreliable Fault Detector, Proc. of the Int. Conference on Principles of Distributed Systems (OPODIS), pp.61-75, 1997. ,
Optimistic Byzantine agreement, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., 2002. ,
DOI : 10.1109/RELDIS.2002.1180196
Lower bounds for asynchronous consensus, Distributed Computing, vol.66, issue.10, pp.104-125, 2006. ,
DOI : 10.1007/s00446-006-0155-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.499.3032
?? Meets Paxos: Leader Election and Stability Without Eventual Timely Links, Proc. on the 19th International Conference on Distributed Computing (DISC'05), pp.26-29, 2005. ,
DOI : 10.1007/11561927_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.8257
Asynchronous implementation of failure detectors, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings., pp.351-360, 2003. ,
DOI : 10.1109/DSN.2003.1209946
A TIME-FREE ASSUMPTION TO IMPLEMENT EVENTUAL LEADERSHIP, Parallel Processing Letters, vol.16, issue.02, pp.189-208, 2006. ,
DOI : 10.1142/S0129626406002575
Byzantine Consensus with Few Synchronous Links, Proc. of the Int. Conference on Principles of Distributed Systems (OPODIS'07), pp.76-89, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00338059
A hybrid approach for building eventually accurate failure detectors, 10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings., pp.57-65, 2004. ,
DOI : 10.1109/PRDC.2004.1276553
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.1658
Time-free and timer-based assumptions can be combined to obtain eventual leadership, IEEE Transactions on Parallel and Distributed Systems, vol.17, issue.7, pp.656-666, 2006. ,
DOI : 10.1109/TPDS.2006.95
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.659.6005
On the Fly Estimation of the Processes that Are Alive in an Asynchronous Message-Passing System, IEEE Transactions on Parallel and Distributed Systems, vol.20, issue.6, pp.778-787, 2009. ,
DOI : 10.1109/TPDS.2009.12
A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1978. ,
DOI : 10.1145/359340.359342
The Theta-Model: achieving synchrony without clocks, Distributed Computing, pp.29-47, 2009. ,
DOI : 10.1007/s00446-009-0080-x