default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeva Blanchard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j2]Karolos Antoniadis, Peva Blanchard
, Rachid Guerraoui, Julien Stainer:
The entropy of a distributed computation random number generation from memory interleaving. Distributed Comput. 31(5): 389-417 (2018)- 2017
- [c10]Peva Blanchard, Rachid Guerraoui, Julien Stainer, Igor Zablotchi:
The Disclosure Power of Shared Objects. NETYS 2017: 222-227 - [c9]Peva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui, Julien Stainer:
Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent. NIPS 2017: 119-129 - [c8]Peva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui, Julien Stainer:
Brief Announcement: Byzantine-Tolerant Machine Learning. PODC 2017: 455-457 - [c7]Peva Blanchard, Rachid Guerraoui:
On the Smallest Grain of Salt to Get a Unique Identity. SIROCCO 2017: 106-121 - [i2]Peva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui, Julien Stainer:
Byzantine-Tolerant Machine Learning. CoRR abs/1703.02757 (2017) - 2016
- [c6]Joffroy Beauquier, Peva Blanchard, Janna Burman, Oksana Denysyuk:
On the Power of Oracle \varOmega ? for Self-Stabilizing Leader Election in Population Protocols. SSS 2016: 20-35 - 2015
- [c5]Joffroy Beauquier, Peva Blanchard, Janna Burman, Shay Kutten:
The Weakest Oracle for Symmetric Consensus in Population Protocols. ALGOSENSORS 2015: 41-56 - [c4]Joffroy Beauquier, Peva Blanchard, Janna Burman, Rachid Guerraoui:
The Benefits of Entropy in Population Protocols. OPODIS 2015: 21:1-21:15 - 2014
- [b1]Peva Blanchard:
Synchronization and Fault-tolerance in Distributed Algorithms. (Synchronisation et tolérance aux défaillances en algoritmique répartie). University of Paris-Sud, Orsay, France, 2014 - [c3]Peva Blanchard, Shlomi Dolev, Joffroy Beauquier, Sylvie Delaët:
Practically Self-stabilizing Paxos Replicated State-Machine. NETYS 2014: 99-121 - 2013
- [j1]Joffroy Beauquier, Peva Blanchard, Janna Burman, Sylvie Delaët:
Tight complexity analysis of population protocols with cover times - The ZebraNet example. Theor. Comput. Sci. 512: 15-27 (2013) - [c2]Joffroy Beauquier, Peva Blanchard, Janna Burman:
Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs. OPODIS 2013: 38-52 - [i1]Peva Blanchard, Shlomi Dolev, Joffroy Beauquier, Sylvie Delaët:
Self-Stabilizing Paxos. CoRR abs/1305.4263 (2013) - 2011
- [c1]Joffroy Beauquier, Peva Blanchard, Janna Burman, Sylvie Delaët:
Computing Time Complexity of Population Protocols with Cover Times - The ZebraNet Example. SSS 2011: 47-61
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:57 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:
