N. Bronson, Z. Amsden, G. Cabrera, P. Chakka, P. Dimov et al., TAO: Facebook's Distributed Data Store for the Social Graph, 2013.

W. Vogels, Eventually Consistent, Queue, vol.6, 2008.

M. Shapiro, N. Preguiça, C. Baquero, and M. Zawirski, ConflictFree Replicated Data Types, Stabilization, Safety, and Security of Distributed Systems, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00609399

P. S. Almeida, A. Shoker, and C. Baquero, Efficient state-based crdts by delta-mutation, 2014.

A. Van-der-linde, J. Leitão, and N. Preguiça, ?-crdts: Making ?-crdts delta-based, PaPoC '16, p, vol.12, issue.4, pp.1-12, 2016.

B. Nédelec, P. Molli, and A. Mostéfaoui, Breaking the Scalability Barrier of Causal Broadcast for Large and Dynamic Systems, 2018.

R. J. Goncalves, P. S. Almeida, C. Baquero, and V. Fonte, DottedDB: Anti-Entropy without Merkle Trees, Deletes without Tombstones, SRDS '17, 2017.

R. C. Merkle, A digital signature based on a conventional encryption function, 1987.

G. Decandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman et al., Dynamo: Amazon's Highly Available Key-value Store, p.16, 2007.

R. Van-renesse, D. Dumitriu, V. Gough, and C. Thomas, Efficient Reconciliation and Flow Control for Anti-entropy Protocols, LADIS '08, ACM, 2008.

A. Fox and E. A. Brewer, Harvest, yield, and scalable tolerant systems, pp.174-178, 1999.

S. Gilbert and N. Lynch, Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-tolerant Web Services, SIGACT News, 2002.

A. Demers, D. Greene, C. Houser, W. Irish, J. Larson et al., Epidemic algorithms for replicated database maintenance, 1987.

M. Jelasity, S. Voulgaris, R. Guerraoui, A. Kermarrec, and M. Van-steen, Gossip-based peer sampling, ACM Trans. Comput. Syst, 2007.

A. Kermarrec, L. Massoulie, and A. J. Ganesh, Probabilistic reliable dissemination in large-scale systems, IEEE Transactions on Parallel and Distributed Systems, vol.14, pp.248-258, 2003.

P. Euster, R. Guerraoui, A. Kermarrec, and L. Maussoulie, From epidemics to distributed computing, IEEE Computer, 2004.

Y. Zhang, A. Rajimwale, A. C. Arpaci-dusseau, and R. H. Arpacidusseau, End-to-end data integrity for file systems: A zfs case study, FAST, pp.29-42, 2010.

J. Benet, Ipfs-content addressed, versioned, p2p file system, 2014.

R. Tamassia and N. Triandopoulos, Efficient Content Authentication in Peer-to-Peer Networks, Applied Cryptography and Network Security, 2007.

S. A. Crosby and D. S. Wallach, Super-Efficient Aggregating HistoryIndependent Persistent Authenticated Dictionaries, ESORICS, 2009.

R. Bayer and E. M. Mccreight, Organization and maintenance of large ordered indexes, 1970.

B. H. Bloom, Space/time trade-offs in hash coding with allowable errors, Commun. ACM, vol.13, issue.7, pp.422-426, 1970.

J. Byers, J. Considine, and M. Mitzenmacher, Fast approximate reconciliation of set differences, p.17, 2002.

Y. Minsky, A. Trachtenberg, and R. Zippel, Set reconciliation with nearly optimal communication complexity, IEEE Transactions on Information Theory, vol.49, pp.2213-2218, 2003.

L. Lamport, Time, Clocks, and the Ordering of Events in a Distributed System, Commun. ACM, vol.21, pp.558-565, 1978.

R. Friedman and S. Manor, Causal Ordering in Deterministic Overlay Networks, 2004.

J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan, Making Data Structures Persistent, STOC '86, 1986.

M. Shapiro, A comprehensive study of Convergent and Commutative Replicated Data Types, pp.1-5, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00555588

N. Preguica, J. M. Marques, M. Shapiro, and M. Letia, A Commutative Replicated Data Type for Cooperative Editing, 29th IEEE International Conference on Distributed Computing Systems, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00445975

B. Nédelec, P. Molli, A. Mostefaoui, and E. Desmontils, LSEQ: An Adaptive Structure for Sequences in Distributed Collaborative Editing, DocEng '13, ACM, 2013.

T. Schütt, F. Schintke, and A. Reinefeld, Scalaris: reliable transactional p2p key/value store, ERLANG '08, p.41, 2008.