default search action
Zohir Bouzid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j4]Zohir Bouzid, Pierre Sutra
, Corentin Travers:
Agreeing within a few writes. Theor. Comput. Sci. 922: 283-299 (2022)
2010 – 2019
- 2018
- [j3]Zohir Bouzid, Michel Raynal, Pierre Sutra
Anonymous obstruction-free (n, k)-set agreement with n-k+1 atomic read/write registers. Distributed Comput. 31(2): 99-117 (2018) - 2016
- [j2]Zohir Bouzid
A necessary condition for Byzantine k-set agreement. Inf. Process. Lett. 116(12): 757-759 (2016) - [c17]Zohir Bouzid, Corentin Travers:
Anonymity-Preserving Failure Detectors. DISC 2016: 173-186 - 2015
- [c16]Zohir Bouzid, Michel Raynal, Pierre Sutra
Anonymous Obstruction-Free (n, k)-Set Agreement with n-k+1 Atomic Read/Write Registers. OPODIS 2015: 18:1-18:17 - [c15]Zohir Bouzid, Achour Mostéfaoui, Michel Raynal:
Minimal Synchrony for Byzantine Consensus. PODC 2015: 461-470 - [i11]Zohir Bouzid, Michel Raynal, Pierre Sutra
Anonymous Obstruction-free (n, k)-Set Agreement with n-k+1 Atomic Read/Write Registers. CoRR abs/1507.00474 (2015) - [i10]Zohir Bouzid, Damien Imbs, Michel Raynal:
A Necessary Condition for Byzantine $k$-Set Agreement. CoRR abs/1512.06227 (2015) - 2014
- [c14]Zohir Bouzid, Eli Gafni, Petr Kuznetsov:
Strong Equivalence Relations for Iterated Models. OPODIS 2014: 139-154 - [i9]Zohir Bouzid, Eli Gafni, Petr Kuznetsov:
Live Equals Fast in Iterated Models. CoRR abs/1402.2446 (2014) - 2013
- [c13]Zohir Bouzid, Shantanu Das, Sébastien Tixeuil:
Gathering of Mobile Robots Tolerating Multiple Crash Faults. ICDCS 2013: 337-346 - [c12]Zohir Bouzid, Corentin Travers:
Parallel Consensus is Harder than Set Agreement in Message Passing. ICDCS 2013: 611-620 - [c11]Cédric Auger, Zohir Bouzid, Pierre Courtieu, Sébastien Tixeuil, Xavier Urbain:
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots. SSS 2013: 178-190 - [i8]Cédric Auger, Zohir Bouzid, Pierre Courtieu, Sébastien Tixeuil, Xavier Urbain:
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots. CoRR abs/1306.4242 (2013) - 2012
- [c10]Zohir Bouzid, Shantanu Das, Sébastien Tixeuil:
Brief Announcement: Wait-Free Gathering of Mobile Robots. DISC 2012: 401-402 - [c9]Zohir Bouzid, Corentin Travers:
Brief Announcement: Anonymity, Failures, Detectors and Consensus. DISC 2012: 427-428 - [i7]Zohir Bouzid, Shantanu Das, Sébastien Tixeuil:
Wait-Free Gathering of Mobile Robots. CoRR abs/1207.0226 (2012) - 2011
- [c8]Zohir Bouzid, Pierre Sutra
Anonymous Agreement: The Janus Algorithm. OPODIS 2011: 175-190 - [c7]Zohir Bouzid, Anissa Lamani:
Robot Networks with Homonyms: The Case of Patterns Formation. SSS 2011: 92-107 - [c6]Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada:
Brief Announcement: The BG-Simulation for Byzantine Mobile Robots. DISC 2011: 330-331 - [i6]Zohir Bouzid, Anissa Lamani:
Robot Networks with Homonyms: The Case of Patterns Formation. CoRR abs/1105.5817 (2011) - [i5]Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada:
The BG-simulation for Byzantine Mobile Robots. CoRR abs/1106.0113 (2011) - 2010
- [j1]Zohir Bouzid, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
Optimal Byzantine-resilient convergence in uni-dimensional robot networks. Theor. Comput. Sci. 411(34-36): 3154-3168 (2010) - [c5]Zohir Bouzid, Shlomi Dolev, Maria Potop-Butucaru, Sébastien Tixeuil:
RoboCast: Asynchronous Communication in Robot Networks. OPODIS 2010: 16-31 - [c4]Zohir Bouzid, Corentin Travers:
(anti-Omegax ×Sigmaz)-Based k-Set Agreement Algorithms. OPODIS 2010: 189-204 - [i4]Zohir Bouzid, Shlomi Dolev, Maria Potop-Butucaru, Sébastien Tixeuil:
RoboCast: Asynchronous Communication in Robot Networks. CoRR abs/1006.5877 (2010)
2000 – 2009
- 2009
- [c3]Zohir Bouzid, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
Byzantine-Resilient Convergence in Oblivious Robot Networks. ICDCN 2009: 275-280 - [c2]Zohir Bouzid, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
Byzantine Convergence in Robot Networks: The Price of Asynchrony. OPODIS 2009: 54-70 - [c1]Zohir Bouzid, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
Optimal Byzantine Resilient Convergence in Asynchronous Robots Networks. SSS 2009: 165-179 - [i3]Zohir Bouzid, Maria Potop-Butucaru, Sébastien Tixeuil:
Optimal byzantine resilient convergence in oblivious robot networks. CoRR abs/0905.3967 (2009) - [i2]Zohir Bouzid, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks. CoRR abs/0906.0651 (2009) - [i1]Zohir Bouzid, Maria Potop-Butucaru, Sébastien Tixeuil:
Byzantine Convergence in Robots Networks: The Price of Asynchrony. CoRR abs/0908.0390 (2009)
Coauthor Index
aka: Maria Gradinariu Potop-Butucaru
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-24 22:46 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: