( en | de | ru )

 

Disambiguation of "Stainer, Julien"

Author of the publication

copydeleteadd this publication to your clipboard
Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems.

, , , and . SIROCCO, volume 8576 of Lecture Notes in Computer Science, page 37-53. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Amélie Stainer

Beate Stainer

Peter Stainer

Ludwig Stainer

Julius Stainer

 

Other publications of authors with the same name

Sequential Proximity - Towards Provably Scalable Concurrent Search Algorithms., , , and . NETYS, volume 10299 of Lecture Notes in Computer Science, page 405-420. (2017)Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors., and . PODC, page 166-175. ACM, (2013)Distributed Universality., , and . OPODIS, volume 8878 of Lecture Notes in Computer Science, page 469-484. Springer, (2014)When and How Process Groups Can Be Used to Reduce the Renaming Space., , and . OPODIS, volume 7702 of Lecture Notes in Computer Science, page 91-105. Springer, (2012)A Simple Broadcast Algorithm for Recurrent Dynamic Systems., , , and . AINA, page 933-939. IEEE Computer Society, (2014)From a Store-Collect Object and Ω to Efficient Asynchronous Consensus., and . Euro-Par, volume 7484 of Lecture Notes in Computer Science, page 427-438. Springer, (2012)Computability Abstractions for Fault-tolerant Asynchronous Distributed Computing. (Abstractions pour la calculabilité dans les systèmes répartis asynchrones tolérant les défaillances).. University of Rennes 1, France, (2015)A Simple Asynchronous Shared Memory Consensus Algorithm Based on Omega and Closing Sets., and . CISIS, page 357-364. IEEE Computer Society, (2012)Brief announcement: increasing the power of the iterated immediate snapshot model with failure detectors., and . PODC, page 337-338. ACM, (2012)Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties., , and . PODC, page 206-208. ACM, (2014)