| Machine learning with adversaries: Byzantine tolerant gradient descent P Blanchard, EM El Mhamdi, R Guerraoui, J Stainer Advances in neural information processing systems 30, 2017 | 1780 | 2017 |
| Byzantine-tolerant machine learning P Blanchard, EME Mhamdi, R Guerraoui, J Stainer arXiv preprint arXiv:1703.02757, 2017 | 62 | 2017 |
| Self-stabilizing leader election in population protocols over arbitrary communication graphs J Beauquier, P Blanchard, J Burman International Conference on Principles of Distributed Systems, 38-52, 2013 | 48 | 2013 |
| Practically self-stabilizing paxos replicated state-machine P Blanchard, S Dolev, J Beauquier, S Delaët International Conference on Networked Systems, 99-121, 2014 | 32 | 2014 |
| Tight complexity analysis of population protocols with cover times—the Zebranet example J Beauquier, P Blanchard, J Burman, S Delaët Theoretical Computer Science 512, 15-27, 2013 | 13 | 2013 |
| The entropy of a distributed computation random number generation from memory interleaving K Antoniadis, P Blanchard, R Guerraoui, J Stainer Distributed Computing 31, 389-417, 2018 | 11 | 2018 |
| Brief announcement: Byzantine-tolerant machine learning P Blanchard, EM El Mhamdi, R Guerraoui, J Stainer Proceedings of the ACM Symposium on Principles of Distributed Computing, 455-457, 2017 | 5 | 2017 |
| Self-stabilizing paxos P Blanchard, S Dolev, J Beauquier, S Delaët arXiv preprint arXiv:1305.4263, 2013 | 5 | 2013 |
| On the Power of Oracle for Self-Stabilizing Leader Election in Population Protocols J Beauquier, P Blanchard, J Burman, O Denysyuk International Symposium on Stabilization, Safety, and Security of …, 2016 | 4 | 2016 |
| Computing time complexity of population protocols with cover times-the zebranet example J Beauquier, P Blanchard, J Burman, S Delaët Stabilization, Safety, and Security of Distributed Systems: 13th …, 2011 | 4 | 2011 |
| Concurrency as a random number generator-technical report PF Blanchard, R Guerraoui, JM Stainer, K Antoniadis | 3 | 2016 |
| Byzantine tolerant gradient descent for distributed machine learning with adversaries P Blanchard, R Guerraoui, J Stainer US Patent App. 16/767,802, 2020 | 2 | 2020 |
| The benefits of entropy in population protocols J Beauquier, P Blanchard, J Burman, R Guerraoui 19th International Conference on Principles of Distributed Systems (OPODIS 2015), 2016 | 2 | 2016 |
| The weakest Oracle for symmetric consensus in population protocols J Beauquier, P Blanchard, J Burman, S Kutten Algorithms for Sensor Systems: 11th International Symposium on Algorithms …, 2015 | 2 | 2015 |
| On the smallest grain of salt to get a unique identity P Blanchard, R Guerraoui Structural Information and Communication Complexity: 24th International …, 2017 | 1 | 2017 |
| The disclosure power of shared objects P Blanchard, R Guerraoui, J Stainer, I Zablotchi Networked Systems: 5th International Conference, NETYS 2017, Marrakech …, 2017 | 1 | 2017 |
| Oracles for selfstabilizing leader election in population protocols J Beauquier, P Blanchard, J Burman, O Denysyuk Technical report, INRIA, 2013. http://hal. archives-ouvertes. fr/hal-00839759, 2013 | 1 | 2013 |
| Том. Part F129314. PODC 2017-Proceedings of the ACM Symposium on Principles of Distributed Computing.-Сер. PODC 2017-Proceedings of the ACM Symposium on Principles of … L Beranboim, T Maimon, M Elkin, O Freedman, P Gawrychowski, ... | | 2017 |
| CoRNG: Concurrency as a Random Number Generator K Antoniadis, PF Blanchard, R Guerraoui, JM Stainer | | 2016 |
| Concurrency as a Random Number Generator-Companion Technical Report PF Blanchard, R Guerraoui, JM Stainer | | 2016 |