Moumen Hamouma

Orcid: 0000-0002-1986-7590

According to our database1, Moumen Hamouma authored at least 24 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Time-Free Assumption for Solving Signature-Free Asynchronous Multivalued Byzantine Consensus.
Int. J. Networked Distributed Comput., December, 2023

Minimal synchrony for implementing Timely Provable Reliable Send primitive with Byzantine failures.
Int. J. Parallel Emergent Distributed Syst., July, 2023

New Techniques for Limiting Misinformation Propagation.
IEEE Access, 2023

Locating the Diffusion Source in Networks by Critical Observers.
Proceedings of the IEEE Symposium on Computers and Communications, 2023

Limiting the Spread of Fake News on Social Networks by Users as Witnesses.
Proceedings of the IEEE Symposium on Computers and Communications, 2023

2022
Some Consistency Rules for Graph Matching.
SN Comput. Sci., 2022

Self-stabilizing algorithm for minimal (α, β)-dominating set.
Int. J. Comput. Math. Comput. Syst. Theory, 2022

Byzantine Fault Tolerance in Distributed Machine Learning : a Survey.
CoRR, 2022

2021
Towards Intelligent Road Traffic Management Over a Weighted Large Graphs Hybrid Meta-Heuristic-Based Approach.
J. Cases Inf. Technol., 2021

A Discrete Crow Search Algorithm for Mining Quantitative Association Rules.
Int. J. Swarm Intell. Res., 2021

Self-stabilizing Algorithm for Maximal Distance-2 Independent Set.
CoRR, 2021

2020
A Hybrid Protocol to Solve Authenticated Byzantine Consensus.
Fundam. Informaticae, 2020

Self-stabilizing Algorithm for Minimal α-Dominating Set.
CoRR, 2020

Tracking COVID-19 by Tracking Infectious Trajectories.
IEEE Access, 2020

2019
A Survey on Vehicular Ad-Hoc Networks Routing Protocols: Classification and Challenges.
J. Digit. Inf. Manag., 2019

Cluster Head Recovery Algorithm for Wireless Sensor Networks.
Proceedings of the 6th International Conference on Control, 2019

2018
Randomized k-set agreement in crash-prone and Byzantine asynchronous systems.
Theor. Comput. Sci., 2018

FDRA: Fault Detection and Recovery Algorithm for Wireless Sensor Networks.
Proceedings of the Mobile Web and Intelligent Information Systems, 2018

2016
Modular randomized byzantine k-set agreement in asynchronous message-passing systems.
Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

2015
Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time.
J. ACM, 2015

Time-Free and Timer-Based Assumptions Can Be Combined to Solve Authenticated Byzantine Consensus.
CoRR, 2015

2014
Signature-free asynchronous byzantine consensus with t 2<n/3 and o(n<sup>2</sup>) messages.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2010
Time-Free Authenticated Byzantine Consensus.
Proceedings of The Ninth IEEE International Symposium on Networking Computing and Applications, 2010

2007
Byzantine Consensus with Few Synchronous Links.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007


  Loading...