PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Stainer, Julien"

Author of the publication

copydeleteadd this publication to your clipboard
Trust-aware peer sampling: Performance and privacy tradeoffs.

, , , , and . Theor. Comput. Sci., (2013)

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.

Julien Genty University of Stuttgart

Julien Vrydagh University of Stuttgart

Dr. Ingo Julien Horst Wilhelm von Reitzenstein University of Stuttgart

 

Other publications of authors with the same name

Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems., , and . SSS, volume 6976 of Lecture Notes in Computer Science, page 341-355. Springer, (2011)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)Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors., and . SIROCCO, volume 7355 of Lecture Notes in Computer Science, page 231-242. Springer, (2012)A Simple Asynchronous Shared Memory Consensus Algorithm Based on Omega and Closing Sets., and . CISIS, page 357-364. IEEE Computer Society, (2012)The entropy of a distributed computation random number generation from memory interleaving., , , and . Distributed Computing, 31 (5): 389-417 (2018)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)Read/write shared memory abstraction on top of asynchronous Byzantine message-passing systems., , , and . J. Parallel Distrib. Comput., (2016)Distributed Universality., , and . Algorithmica, 76 (2): 502-535 (2016)Are Byzantine Failures Really Different from Crash Failures?, , and . DISC, volume 9888 of Lecture Notes in Computer Science, page 215-229. Springer, (2016)