default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoumen Hamouma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Ahmed-Sami Berkani
, Hamouma Moumen, Saber Benharzallah, Said Yahiaoui, Ahcène Bounceur:
Blockchain Use Cases in the Sports Industry: A Systematic Review. Int. J. Networked Distributed Comput. 12(1): 17-40 (2024)- 2023
- [j12]Badreddine Benreguia, Chafik Arar, Hamouma Moumen, Mohammed Amine Merzoug:
New Techniques for Limiting Misinformation Propagation. IEEE Access 11: 61234-61248 (2023) - [j11]Abderafik Nezzar, Hamouma Moumen, Chafik Arar:
A Time-Free Assumption for Solving Signature-Free Asynchronous Multivalued Byzantine Consensus. Int. J. Networked Distributed Comput. 11(2): 49-59 (2023) - [j10]Mohamed Ben Othmane, Abderrahim Siam, Hamouma Moumen:
Minimal synchrony for implementing Timely Provable Reliable Send primitive with Byzantine failures. Int. J. Parallel Emergent Distributed Syst. 38(4): 280-287 (2023) - [c8]Hamouma Moumen, Badreddine Benreguia, Leila Saadi, Ahcène Bounceur:
Locating the Diffusion Source in Networks by Critical Observers. ISCC 2023: 543-548 - [c7]Hamouma Moumen, Badreddine Benreguia, Ahcène Bounceur, Leila Saadi:
Limiting the Spread of Fake News on Social Networks by Users as Witnesses. ISCC 2023: 663-668 - 2022
- [j9]Leila Saadi, Badreddine Benreguia, Chafik Arar, Hamouma Moumen:
Self-stabilizing algorithm for minimal (α, β)-dominating set. Int. J. Comput. Math. Comput. Syst. Theory 7(2): 81-94 (2022) - [j8]Badreddine Benreguia, Hamouma Moumen:
Some Consistency Rules for Graph Matching. SN Comput. Sci. 3(2): 113 (2022) - [i5]Djamila Bouhata, Hamouma Moumen:
Byzantine Fault Tolerance in Distributed Machine Learning : a Survey. CoRR abs/2205.02572 (2022) - 2021
- [j7]Makhlouf Ledmi, Hamouma Moumen, Abderrahim Siam, Hichem Haouassi, Nabil Azizi:
A Discrete Crow Search Algorithm for Mining Quantitative Association Rules. Int. J. Swarm Intell. Res. 12(4): 101-124 (2021) - [j6]Mohamed Yassine Hayi, Zahira Chouiref, Hamouma Moumen:
Towards Intelligent Road Traffic Management Over a Weighted Large Graphs Hybrid Meta-Heuristic-Based Approach. J. Cases Inf. Technol. 24(3): 1-18 (2021) - [i4]Badreddine Benreguia, Hamouma Moumen, Souheila Bouam, Chafik Arar:
Self-stabilizing Algorithm for Maximal Distance-2 Independent Set. CoRR abs/2101.11126 (2021) - 2020
- [j5]Badreddine Benreguia, Hamouma Moumen, Mohammed Amine Merzoug:
Tracking COVID-19 by Tracking Infectious Trajectories. IEEE Access 8: 145242-145255 (2020) - [j4]Abdelhamid Tioura, Hamouma Moumen, Hamoudi Kalla, Ahmed Ait Saidi:
A Hybrid Protocol to Solve Authenticated Byzantine Consensus. Fundam. Informaticae 173(1): 73-89 (2020) - [i3]Badreddine Benreguia, Hamouma Moumen, Mohammed Amine Merzoug:
Tracking COVID-19 by Tracking Infectious Trajectories. CoRR abs/2005.05523 (2020) - [i2]Badreddine Benreguia, Hamouma Moumen:
Self-stabilizing Algorithm for Minimal α-Dominating Set. CoRR abs/2006.01311 (2020)
2010 – 2019
- 2019
- [j3]Tassoult Nadia, Mourad Amad, Moumen Hamouma, Hamoudi Kalla:
A Survey on Vehicular Ad-Hoc Networks Routing Protocols: Classification and Challenges. J. Digit. Inf. Manag. 17(4): 227 (2019) - [c6]Chafiq Titouna, Hamouma Moumen, Ado Adamou Abba Ari:
Cluster Head Recovery Algorithm for Wireless Sensor Networks. CoDIT 2019: 1905-1910 - 2018
- [j2]Achour Mostéfaoui, Hamouma Moumen, Michel Raynal:
Randomized k-set agreement in crash-prone and Byzantine asynchronous systems. Theor. Comput. Sci. 709: 80-97 (2018) - [c5]Chafiq Titouna, Ado Adamou Abba Ari, Hamouma Moumen:
FDRA: Fault Detection and Recovery Algorithm for Wireless Sensor Networks. MobiWIS 2018: 72-85 - 2016
- [c4]Achour Mostéfaoui, Hamouma Moumen, Michel Raynal:
Modular randomized byzantine k-set agreement in asynchronous message-passing systems. ICDCN 2016: 5:1-5:10 - 2015
- [j1]Achour Mostéfaoui, Hamouma Moumen, Michel Raynal:
Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time. J. ACM 62(4): 31:1-31:21 (2015) - [i1]Hamouma Moumen:
Time-Free and Timer-Based Assumptions Can Be Combined to Solve Authenticated Byzantine Consensus. CoRR abs/1502.00050 (2015) - 2014
- [c3]Achour Mostéfaoui, Moumen Hamouma, Michel Raynal:
Signature-free asynchronous byzantine consensus with t 2<n/3 and o(n2) messages. PODC 2014: 2-9 - 2010
- [c2]Moumen Hamouma, Achour Mostéfaoui:
Time-Free Authenticated Byzantine Consensus. NCA 2010: 140-146
2000 – 2009
- 2007
- [c1]Moumen Hamouma, Achour Mostéfaoui, Gilles Trédan:
Byzantine Consensus with Few Synchronous Links. OPODIS 2007: 76-89
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-10-07 21:16 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:
