Failure detection and randomization: a hybrid approach to solve consensus, SIAM Journal of Computing, vol.28, issue.3, pp.890-903, 1998. ,
Communicationefficient randomized consensus, Proc. 28th International Symposium on Distributed Computing (DISC'14), vol.8784, pp.61-75, 2014. ,
Fast randomized consensus using shared memory, Journal of algorithms, vol.11, issue.3, pp.441-461, 1990. ,
Tight bounds for asynchronous randomized consensus, Journal of the ACM vol, vol.55, issue.5, p.20, 2008. ,
, Distributed computing: fundamentals, simulations and advanced topics, 2004.
Another advantage of free choice: completely asynchronous agreement protocols, Proc. 2nd ACM Symposium on Principles of Distributed Computing(PODC'83), pp.27-30, 1983. ,
Fast asynchronous Byzantine agreement with optimal resilience, Proc. 25th ACM Symposium on Theory of Computing(STOC'93), pp.42-51, 1993. ,
Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996. ,
The weakest failure detector for solving consensus, Journal of the ACM, vol.43, issue.4, pp.685-722, 1996. ,
On the minimal synchronism needed for distributed consensus, Journal of the ACM, vol.34, issue.1, pp.77-97, 1987. ,
Consensus in the presence of partial synchrony, Journal of the ACM, vol.35, issue.2, pp.288-323, 1988. ,
Impossibility of distributed Consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985. ,
Distributed agreement problems and their connection with error-correcting codes, IEEE Transactions on Computers, vol.56, issue.7, pp.865-875, 2007. ,
RITAS: Services for randomized intrusion tolerance, IEEE Trans. Dependable and Secure Computing, vol.8, issue.1, pp.122-136, 2011. ,
Signature-free asynchronous binary Byzantine consensus with t < n/3, O(n 2 ) messages, and O(1) expected time, Journal of ACM, vol.62, issue.4, 2015. ,
Conditions on input vectors for consensus solvability in asynchronous distributed systems, Journal of the ACM, vol.50, issue.6, pp.922-954, 2003. ,
The Combined power of conditions and information on failures to solve asynchronous set agreement, SIAM Journal of Computing, vol.38, issue.4, pp.1574-1601, 2008. ,
Solving consensus using Chandra-Toueg's unreliable failure detectors: a general quorum-based approach, Proc. 13th Int'l Symposium on Distributed Computing (DISC'99), pp.49-63, 1999. ,
Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with t < n/3, O(n 2 ) messages, and constant time, Acta Informatica, vol.54, issue.5, pp.501-520, 2017. ,
From binary consensus to multivalued consensus in asynchronous messagepassing systems, Information Processing Letters, vol.73, pp.207-213, 2000. ,
The best of both worlds: A hybrid approach to solve consensus, Proc. Int'l Conference on Dependable Systems and Networks (DSN'00), pp.513-522, 2000. ,
Failure mode assumptions and assumption coverage, Proc. of the 22nd Int'l Symposium on Fault-Tolerant Computing (FTCS-22), pp.386-395, 1992. ,
Randomized Byzantine generals, Proc. 24th IEEE Symposium on Foundations of Computer Science (FOCS'83), pp.116-124, 1983. ,
Fault-tolerant message-passing distributed systems : an algorithmic approach, vol.560, p.pages, 2018. ,
Bounded cost algorithms for multivalued consensus using binary consensus instances, Information Processing Letters, vol.109, issue.17, pp.1005-1009, 2009. ,