ERC Advanced Grant 339539: AOC (Adversary-Oriented Computing)
Related Papers
The Next 700 BFT Protocols, in ACM Transactions on Computer Systems, vol. 32, num. 4, 2015.
. Making BFT Protocols Really Adaptive. 2015 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Hyderabad, 2015.
. The Weakest Failure Detector for Eventual Consistency. the 2015 ACM Symposium, Donostia-San Sebastian, Spain, 2015.
. Byzantine Fireflies. 29th International Symposium, DISC 2015, Tokyo, Japan, Lecture Notes in Computer Science, 2015.
. A paradox of eventual linearizability in shared memory. the 2014 ACM symposium, Paris, France, 2014.
. Introducing Speculation in Self-Stabilization: An Application to Mutual Exclusion. , 2013.
Speculative Linearizability, in Acm Sigplan Notices, vol. 47, num. 6, p. 55-66, 2012.
. On the cost of composing shared-memory algorithms. Proceedinbgs of the 24th ACM symposium, Pittsburgh, Pennsylvania, USA, 2012.
Generating Fast Indulgent Algorithms, in Theory Of Computing Systems, vol. 51, num. 4, p. 404-424, 2012.
The disagreement power of an adversary, in Distributed Computing, vol. 24, num. 3-4, p. 137-147, 2011.
The Inherent Price of Indulgence, in Distributed Computing, vol. 18, num. 1, p. 85-98, 2005.
. Indulgent Algorithms. Symposium on Principles of Distributed Computing, Portland, Oregon, USA, 2000.