default search action
Julien Stainer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j5]Karolos Antoniadis, Peva Blanchard
, Rachid Guerraoui
The entropy of a distributed computation random number generation from memory interleaving. Distributed Comput. 31(5): 389-417 (2018) - 2017
- [j4]Maurice Herlihy, Sergio Rajsbaum
From wait-free to arbitrary concurrent solo executions in colorless distributed computing. Theor. Comput. Sci. 683: 1-21 (2017) - [c19]Peva Blanchard, Rachid Guerraoui, Julien Stainer, Igor Zablotchi:
The Disclosure Power of Shared Objects. NETYS 2017: 222-227 - [c18]Karolos Antoniadis, Rachid Guerraoui, Julien Stainer, Vasileios Trigonakis:
Sequential Proximity - Towards Provably Scalable Concurrent Search Algorithms. NETYS 2017: 405-420 - [c17]Peva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui
Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent. NIPS 2017: 119-129 - [c16]Peva Blanchard, El Mahdi El Mhamdi
Brief Announcement: Byzantine-Tolerant Machine Learning. PODC 2017: 455-457 - [i2]Peva Blanchard, El Mahdi El Mhamdi
Byzantine-Tolerant Machine Learning. CoRR abs/1703.02757 (2017) - 2016
- [j3]Michel Raynal, Julien Stainer, Gadi Taubenfeld:
Distributed Universality. Algorithmica 76(2): 502-535 (2016) - [j2]Damien Imbs, Sergio Rajsbaum
Read/write shared memory abstraction on top of asynchronous Byzantine message-passing systems. J. Parallel Distributed Comput. 93-94: 1-9 (2016) - [c15]Damien Imbs, Michel Raynal, Julien Stainer:
Are Byzantine Failures Really Different from Crash Failures? DISC 2016: 215-229 - 2015
- [b1]Julien Stainer:
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 - [i1]Damien Imbs, Michel Raynal, Julien Stainer:
From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach. CoRR abs/1510.09119 (2015) - 2014
- [c14]Michel Raynal, Julien Stainer, Jiannong Cao
A Simple Broadcast Algorithm for Recurrent Dynamic Systems. AINA 2014: 933-939 - [c13]Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer:
Computing in the Presence of Concurrent Solo Executions. LATIN 2014: 214-225 - [c12]Michel Raynal, Julien Stainer, Gadi Taubenfeld:
Distributed Universality. OPODIS 2014: 469-484 - [c11]Michel Raynal, Julien Stainer, Gadi Taubenfeld:
Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties. PODC 2014: 206-208 - [c10]Damien Imbs, Sergio Rajsbaum, Michel Raynal, Julien Stainer:
Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems. SIROCCO 2014: 37-53 - 2013
- [j1]Davide Frey, Arnaud Jégou, Anne-Marie Kermarrec
Trust-aware peer sampling: Performance and privacy tradeoffs. Theor. Comput. Sci. 512: 67-83 (2013) - [c9]Michel Raynal, Julien Stainer:
Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors. PODC 2013: 166-175 - [c8]Michel Raynal, Julien Stainer:
Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems. SIROCCO 2013: 298-309 - 2012
- [c7]Michel Raynal, Julien Stainer:
A Simple Asynchronous Shared Memory Consensus Algorithm Based on Omega and Closing Sets. CISIS 2012: 357-364 - [c6]Michel Raynal, Julien Stainer:
From a Store-Collect Object and Ω to Efficient Asynchronous Consensus. Euro-Par 2012: 427-438 - [c5]Achour Mostéfaoui, Michel Raynal, Julien Stainer:
Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems. NCA 2012: 44-51 - [c4]Armando Castañeda, Michel Raynal, Julien Stainer:
When and How Process Groups Can Be Used to Reduce the Renaming Space. OPODIS 2012: 91-105 - [c3]Michel Raynal, Julien Stainer:
Brief announcement: increasing the power of the iterated immediate snapshot model with failure detectors. PODC 2012: 337-338 - [c2]Michel Raynal, Julien Stainer:
Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors. SIROCCO 2012: 231-242 - 2011
- [c1]Achour Mostéfaoui, Michel Raynal, Julien Stainer:
Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems. SSS 2011: 341-355
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: