Atomic snapshots of shared memory, Journal of the ACM, vol.40, issue.4, pp.873-890, 1993. ,
Multi-writer composite registers, Distributed Computing, vol.7, issue.4, pp.175-195, 1994. ,
Asynchronous Byzantine agreement protocols, Information & Computation, vol.75, issue.2, pp.130-143, 1987. ,
Adding concurrency to smart contracts, vol.17, pp.303-312, 2017. ,
, The consensus number of a cryptocurrency. PODC'19, pp.307-316, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02364290
A modular approach to fault-tolerant broadcasts and related problems, vol.83, 1994. ,
Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, vol.12, issue.3, pp.463-492, 1990. ,
Trading t-resilience for efficiency in asynchronous Byzantine reliable broadcast, Parallel Processing Letters, vol.26, issue.4, p.pages, 2016. ,
, Set-constrained delivery broadcast: definition, abstraction power, and computability limits. ICDCN'18, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02053261
The Byzantine generals problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, 1982. ,
Bitcoin: A peer-to-peer electronic cash system, 2008. ,
Reaching agreement in the presence of faults, Journal of the ACM, vol.27, pp.228-234, 1980. ,
Fault-tolerant message-passing distributed systems: an algorithmic approach, vol.492, 2018. ,
Conflict-free replicated data types. SSS'11, LNCS, vol.6976, pp.386-400, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00609399