1. Alex Auvolat and François Taïani . 2019 . Merkle search trees: Efficient state-based CRDTs in open networks . In 2019 38th Symposium on Reliable Distributed Systems (SRDS). IEEE, 221–22109 . Alex Auvolat and François Taïani. 2019. Merkle search trees: Efficient state-based CRDTs in open networks. In 2019 38th Symposium on Reliable Distributed Systems (SRDS). IEEE, 221–22109.
2. Miguel Castro Barbara Liskov 1999. Practical byzantine fault tolerance. In OsDI Vol. 99. 173–186. Miguel Castro Barbara Liskov 1999. Practical byzantine fault tolerance. In OsDI Vol. 99. 173–186.
3. Bulk-insertions info r-trees using the small-tree-large-tree approach
4. Rasmus Dahlberg , Tobias Pulls , and Roel Peeters . 2016 . Efficient sparse merkle trees: Caching strategies and secure (non-) membership proofs . In Secure IT Systems: 21st Nordic Conference, NordSec 2016, Oulu, Finland, November 2-4, 2016. Proceedings 21 . Springer, 199–215. Rasmus Dahlberg, Tobias Pulls, and Roel Peeters. 2016. Efficient sparse merkle trees: Caching strategies and secure (non-) membership proofs. In Secure IT Systems: 21st Nordic Conference, NordSec 2016, Oulu, Finland, November 2-4, 2016. Proceedings 21. Springer, 199–215.