Peva Blanchard

According to our database, Peva Blanchard authored at least 15 papers between 2011 and 2018.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2018

The entropy of a distributed computation random number generation from memory interleaving.

Karolos Antoniadis, Peva Blanchard, Rachid Guerraoui, Julien Stainer

Distributed Comput., 2018

2017

Byzantine-Tolerant Machine Learning.

Peva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui, Julien Stainer

CoRR, 2017

On the Smallest Grain of Salt to Get a Unique Identity.

Peva Blanchard, Rachid Guerraoui

Proceedings of the Structural Information and Communication Complexity, 2017

Brief Announcement: Byzantine-Tolerant Machine Learning.

Peva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui, Julien Stainer

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent.

Peva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui, Julien Stainer

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

The Disclosure Power of Shared Objects.

Peva Blanchard, Rachid Guerraoui, Julien Stainer, Igor Zablotchi

Proceedings of the Networked Systems - 5th International Conference, 2017

2016

On the Power of Oracle \varOmega ? for Self-Stabilizing Leader Election in Population Protocols.

Joffroy Beauquier, Peva Blanchard, Janna Burman, Oksana Denysyuk

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

2015

The Benefits of Entropy in Population Protocols.

Joffroy Beauquier, Peva Blanchard, Janna Burman, Rachid Guerraoui

Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

The Weakest Oracle for Symmetric Consensus in Population Protocols.

Joffroy Beauquier, Peva Blanchard, Janna Burman, Shay Kutten

Proceedings of the Algorithms for Sensor Systems, 2015

2014

Synchronization and Fault-tolerance in Distributed Algorithms. (Synchronisation et tolérance aux défaillances en algoritmique répartie).

Peva Blanchard

PhD thesis, 2014

Practically Self-stabilizing Paxos Replicated State-Machine.

Peva Blanchard, Shlomi Dolev, Joffroy Beauquier, Sylvie Delaët

Proceedings of the Networked Systems - Second International Conference, 2014

2013

Tight complexity analysis of population protocols with cover times - The ZebraNet example.

Joffroy Beauquier, Peva Blanchard, Janna Burman, Sylvie Delaët

Theor. Comput. Sci., 2013

Self-Stabilizing Paxos

Peva Blanchard, Shlomi Dolev, Joffroy Beauquier, Sylvie Delaët

CoRR, 2013

Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs.

Joffroy Beauquier, Peva Blanchard, Janna Burman

Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013

2011

Computing Time Complexity of Population Protocols with Cover Times - The ZebraNet Example.

Joffroy Beauquier, Peva Blanchard, Janna Burman, Sylvie Delaët

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011