Julien Stainer

According to our database, Julien Stainer authored at least 26 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

From wait-free to arbitrary concurrent solo executions in colorless distributed computing.

Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer

Theor. Comput. Sci., 2017

Byzantine-Tolerant Machine Learning.

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

CoRR, 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

Sequential Proximity - Towards Provably Scalable Concurrent Search Algorithms.

Karolos Antoniadis, Rachid Guerraoui, Julien Stainer, Vasileios Trigonakis

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

2016

Read/write shared memory abstraction on top of asynchronous Byzantine message-passing systems.

Damien Imbs, Sergio Rajsbaum, Michel Raynal, Julien Stainer

J. Parallel Distributed Comput., 2016

Distributed Universality.

Michel Raynal, Julien Stainer, Gadi Taubenfeld

Algorithmica, 2016

Are Byzantine Failures Really Different from Crash Failures?

Damien Imbs, Michel Raynal, Julien Stainer

Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015

Computability Abstractions for Fault-tolerant Asynchronous Distributed Computing. (Abstractions pour la calculabilité dans les systèmes répartis asynchrones tolérant les défaillances).

Julien Stainer

PhD thesis, 2015

From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach.

Damien Imbs, Michel Raynal, Julien Stainer

CoRR, 2015

2014

Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems.

Damien Imbs, Sergio Rajsbaum, Michel Raynal, Julien Stainer

Proceedings of the Structural Information and Communication Complexity, 2014

Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties.

Michel Raynal, Julien Stainer, Gadi Taubenfeld

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

Computing in the Presence of Concurrent Solo Executions.

Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

A Simple Broadcast Algorithm for Recurrent Dynamic Systems.

Michel Raynal, Julien Stainer, Jiannong Cao, Weigang Wu

Proceedings of the 28th IEEE International Conference on Advanced Information Networking and Applications, 2014

2013

Trust-aware peer sampling: Performance and privacy tradeoffs.

Davide Frey, Arnaud Jégou, Anne-Marie Kermarrec, Michel Raynal, Julien Stainer

Theor. Comput. Sci., 2013

Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems.

Michel Raynal, Julien Stainer

Proceedings of the Structural Information and Communication Complexity, 2013

Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors.

Michel Raynal, Julien Stainer

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

2012

Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors.

Michel Raynal, Julien Stainer

Proceedings of the Structural Information and Communication Complexity, 2012

Brief announcement: increasing the power of the iterated immediate snapshot model with failure detectors.

Michel Raynal, Julien Stainer

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

When and How Process Groups Can Be Used to Reduce the Renaming Space.

Armando Castañeda, Michel Raynal, Julien Stainer

Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems.

Achour Mostéfaoui, Michel Raynal, Julien Stainer

Proceedings of the 11th IEEE International Symposium on Network Computing and Applications, 2012

From a Store-Collect Object and Ω to Efficient Asynchronous Consensus.

Michel Raynal, Julien Stainer

Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

A Simple Asynchronous Shared Memory Consensus Algorithm Based on Omega and Closing Sets.

Michel Raynal, Julien Stainer

Proceedings of the Sixth International Conference on Complex, 2012

2011

Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems.

Achour Mostéfaoui, Michel Raynal, Julien Stainer

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