![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Rachid Hadid
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c6]Rachid Hadid, Vincent Villain:
A Self-stabilizing One-To-Many Node Disjoint Paths Routing Algorithm in Star Networks. DAIS 2020: 186-203
2010 – 2019
- 2018
- [j8]Rachid Hadid:
A stabilising optimal k-out-of-ℓ resources allocation algorithm. Int. J. Knowl. Eng. Data Min. 5(3): 173-194 (2018) - 2017
- [j7]Rachid Hadid, Mehmet Hakan Karaata, Vincent Villain:
A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks. Int. J. Found. Comput. Sci. 28(4): 411- (2017) - 2016
- [j6]Mehmet Hakan Karaata, Rachid Hadid:
A Stabilizing Optimal ℓ-Exclusion Algorithm. J. Circuits Syst. Comput. 25(8): 1650098:1-1650098:20 (2016)
2000 – 2009
- 2009
- [j5]Rachid Hadid, Mehmet Hakan Karaata:
An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks. Comput. Commun. 32(5): 858-866 (2009) - [j4]Rachid Hadid, Mehmet Hakan Karaata:
Stabilizing maximum matching in bipartite networks. Computing 84(1-2): 121-138 (2009) - [c5]Mehmet Hakan Karaata, Rachid Hadid:
Brief Announcement: A Stabilizing Algorithm for Finding Two Disjoint Paths in Arbitrary Networks. SSS 2009: 789-790 - 2008
- [j3]Mehmet Hakan Karaata, Rachid Hadid:
An optimal snap-stabilizing wave algorithm in arbitrary graphs. Comput. Commun. 31(14): 3071-3077 (2008) - 2003
- [j2]Ajoy Kumar Datta, Rachid Hadid, Vincent Villain:
A self-stabilizing token-based k-out-of- exclusion algorithm. Concurr. Comput. Pract. Exp. 15(11-12): 1069-1091 (2003) - [c4]Ajoy Kumar Datta, Rachid Hadid, Vincent Villain:
A New Self-Stabilizing k-out-of-l Exclusion Algorithm on Rings. Self-Stabilizing Systems 2003: 113-128 - 2002
- [j1]Rachid Hadid:
Space and Time Efficient Self-Stabilizing l-Exclusion in Tree Networks. J. Parallel Distributed Comput. 62(5): 843-864 (2002) - [c3]Ajoy Kumar Datta, Rachid Hadid, Vincent Villain:
A Self-stabilizing Token-Based k-out-of-l Exclusion Algorithm. Euro-Par 2002: 553-562 - 2001
- [c2]Rachid Hadid, Vincent Villain:
A New Efficient Tool for the Design of Self-Stabilizing l-Exclusion Algorithms: The Controller. WSS 2001: 136-151 - 2000
- [c1]Rachid Hadid:
Space and Time Efficient Self-Stabilizing l-Exclusion in Tree Networks. IPDPS 2000: 529-534
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint