Tyler Crain

Christopher Natoli

Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

2020

Experimental Evaluation of Asynchronous Binary Byzantine Consensus Algorithms with t<n/3 and O(n<sup>2</sup>) Messages and O(1) Round Expected Termination.

[BibT_eX]

[DOI]

CoRR, 2020

Two More Algorithms for Randomized Signature-Free Asynchronous Binary Byzantine Consensus with t<n/3 and O(n<sup>2</sup>) Messages and O(1) Round Expected Termination.

[BibT_eX]

[DOI]

CoRR, 2020

A Simple and Efficient Asynchronous Randomized Binary Byzantine Consensus Algorithm.

[BibT_eX]

[DOI]

CoRR, 2020

A Simple and Efficient Binary Byzantine Consensus Algorithm using Cryptography and Partial Synchrony.

[BibT_eX]

[DOI]

CoRR, 2020

Anonymity Preserving Byzantine Vector Consensus.

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2020, 2020

2019

Byzantine Fault Tolerant Vector Consensus with Anonymous Proposals.

[BibT_eX]

[DOI]

CoRR, 2019

A speculation-friendly binary search tree.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2019

2018

Evaluating the Red Belly Blockchain.

[BibT_eX]

[DOI]

Christopher Natoli

CoRR, 2018

DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE International Symposium on Network Computing and Applications, 2018

2017

(Leader/Randomization/Signature)-free Byzantine Consensus for Consortium Blockchains.

[BibT_eX]

[DOI]

CoRR, 2017

2016

A Fast Contention-Friendly Binary Search Tree.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2016

Cure: Strong Semantics Meets High Availability and Low Latency.

[BibT_eX]

[DOI]

Deepthi Devaki Akkoorath

Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

PhysiCS-NMSI: efficient consistent snapshots for scalable snapshot isolation.

[BibT_eX]

[DOI]

Alejandro Z. Tomsic

Proceedings of the 2nd Workshop on the Principles and Practice of Consistency for Distributed Data, 2016

2015

Scaling Geo-replicated Databases to the MEC Environment.

[BibT_eX]

[DOI]

Alejandro Z. Tomsic

Proceedings of the 34th IEEE Symposium on Reliable Distributed Systems Workshop, 2015

An empirical perspective on causal consistency.

[BibT_eX]

[DOI]

Alejandro Z. Tomsic

Proceedings of the First Workshop on Principles and Practice of Consistency for Distributed Data, 2015

Designing a causally consistent protocol for geo-distributed partial replication.

[BibT_eX]

[DOI]

Proceedings of the First Workshop on Principles and Practice of Consistency for Distributed Data, 2015

2013

On improving the ease of use of the software transactional memory abstraction. (Faciliter l'utilisation des mémoires transactionnelles logicielles).

[BibT_eX]

[DOI]

PhD thesis, 2013

Towards a universal construction for transaction-based multiprocess programs.

[BibT_eX]

[DOI]

Damien Imbs

Theor. Comput. Sci., 2013

No Hot Spot Non-blocking Skip List.

[BibT_eX]

[DOI]

Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

A Contention-Friendly Binary Search Tree.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2013 Parallel Processing, 2013

2012

Brief Announcement: A Contention-Friendly, Non-blocking Skip List.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

STM Systems: Enforcing Strong Isolation between Transactions and Non-transactional Code.

[BibT_eX]

[DOI]

Eleni Kanellou

Proceedings of the Algorithms and Architectures for Parallel Processing, 2012

2011

Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible.

[BibT_eX]

[DOI]

Damien Imbs

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Read Invisibility, Virtual World Consistency and Probabilistic Permissiveness are Compatible.

[BibT_eX]

[DOI]

Damien Imbs