| 2008 |
|---|
| 45 | EE | M. A. Haddar,
Ahmed Hadj Kacem,
Yves Métivier,
Mohamed Mosbah,
Mohamed Jmaiel:
Electing a leader in the local computation model using mobile agents.
AICCSA 2008: 473-480 |
| 44 | EE | Med Amine Haddar,
Ahmed Hadj Kacem,
Yves Métivier,
Mohamed Mosbah,
Mohamed Jmaiel:
Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks.
ICDCN 2008: 286-291 |
| 43 | EE | Mohamed Mosbah,
Annegret Habel:
Workshop on Graph Computation Models.
ICGT 2008: 460-462 |
| 42 | EE | Bilel Derbel,
Mohamed Mosbah,
Stefan Gruner:
Mobile Agents Implementing Local Computations in Graphs.
ICGT 2008: 99-114 |
| 41 | | Imen Jemili,
Abdelfattah Belghith,
Mohamed Mosbah:
Evaluating the Efficiency of Clustering on Routing and Network Performance.
ICWN 2008: 634-639 |
| 40 | EE | Imen Jemili,
Abdelfattah Belghith,
Mohamed Mosbah:
A Synchronous Tiered Based Clustering Algorithm for large-scale Ad hoc Networks.
MWCN/PWC 2008: 41-55 |
| 2007 |
|---|
| 39 | EE | Hédi Hamdi,
Mohamed Mosbah,
Adel Bouhoula:
A Domain Specific Language for Securing Distributed Systems.
ICSNC 2007: 76 |
| 38 | EE | Brahim Hamid,
Bertrand Le Saëc,
Mohamed Mosbah:
Distributed Local 2-Connectivity Test of Graphs and Applications.
ISPA 2007: 195-207 |
| 37 | EE | Brahim Hamid,
Mohamed Mosbah,
Akka Zemmari:
A Self-stabilizing Distributed Algorithm for Resolving Conflicts.
OTM Workshops (2) 2007: 1042-1051 |
| 36 | EE | Shehla Abbas,
Mohamed Mosbah,
Akka Zemmari:
A Generic Distributed Algorithm for Computing by Random Mobile Agents.
PRIMA 2007: 392-397 |
| 35 | EE | Med Amine Haddar,
Ahmed Hadj Kacem,
Yves Métivier,
Mohamed Mosbah,
Mohamed Jmaiel:
A Distributed Computational Model for Mobile Agents.
PRIMA 2007: 416-421 |
| 34 | EE | Hédi Hamdi,
Adel Bouhoula,
Mohamed Mosbah:
A Software Architecture for Automatic Security Policy Enforcement in Distributed Systems.
SECURWARE 2007: 187-192 |
| 33 | EE | Nicolas Bonichon,
Stefan Felsner,
Mohamed Mosbah:
Convex Drawings of 3-Connected Plane Graphs.
Algorithmica 47(4): 399-420 (2007) |
| 2006 |
|---|
| 32 | EE | Brahim Hamid,
Mohamed Mosbah:
A Local Self-stabilizing Enumeration Algorithm.
DAIS 2006: 289-302 |
| 31 | EE | Yves Métivier,
Mohamed Mosbah:
Workshop on Graph Computation Models.
ICGT 2006: 463-464 |
| 30 | EE | Bilel Derbel,
Mohamed Mosbah,
Akka Zemmari:
Fast distributed graph partition and application.
IPDPS 2006 |
| 29 | EE | Bilel Derbel,
Mohamed Mosbah:
Distributed Graph Traversals by Relabelling Systems with Applications.
Electr. Notes Theor. Comput. Sci. 154(2): 79-94 (2006) |
| 28 | EE | Brahim Hamid,
Mohamed Mosbah:
A Local Enumeration Protocol in Spite of Corrupted Data.
JCP 1(7): 9-20 (2006) |
| 2005 |
|---|
| 27 | EE | Brahim Hamid,
Mohamed Mosbah:
Visualization of Self-Stabilizing Distributed Algorithms.
IV 2005: 550-555 |
| 26 | | Brahim Hamid,
Mohamed Mosbah:
An Implementation of a Failure Detector for Local Computations in Graphs.
Parallel and Distributed Computing and Networks 2005: 473-478 |
| 25 | EE | Brahim Hamid,
Mohamed Mosbah:
A Formal Model for Fault-Tolerance in Distributed Systems.
SAFECOMP 2005: 108-121 |
| 24 | EE | Brahim Hamid,
Mohamed Mosbah:
An Automatic Approach to Self-Stabilization.
SNPD 2005: 123-128 |
| 2004 |
|---|
| 23 | EE | Mohamed Mosbah,
Rodrigue Ossamy:
A Programming Language for Local Computations in Graphs: Computational Completeness.
ENC 2004: 12-19 |
| 22 | EE | Mohamed Mosbah,
Rodrigue Ossamy:
Checking Global Properties for Local Computations in Graphs with Applications to Invariant Testing.
ENC 2004: 35-42 |
| 21 | EE | Nicolas Bonichon,
Stefan Felsner,
Mohamed Mosbah:
Convex Drawings of 3-Connected Plane Graphs.
Graph Drawing 2004: 60-70 |
| 20 | EE | Yves Métivier,
Mohamed Mosbah,
Rodrigue Ossamy,
Afif Sellami:
Synchronizers for Local Computations.
ICGT 2004: 271-286 |
| 19 | EE | Nicolas Bonichon,
Bertrand Le Saëc,
Mohamed Mosbah:
Orthogonal drawings based on the stratification of planar graphs.
Discrete Mathematics 276(1-3): 43-57 (2004) |
| 2003 |
|---|
| 18 | EE | Bilel Derbel,
Mohamed Mosbah:
Distributing the Execution of a Distributed Algorithm over a Network.
IV 2003: 485-490 |
| 17 | EE | Michel Bauderon,
Mohamed Mosbah:
A Unified Framework for Designing, Implementing and Visualizing Distributed Algorithms.
Electr. Notes Theor. Comput. Sci. 72(3): (2003) |
| 16 | EE | Nicolas Bonichon,
Mohamed Mosbah:
Watermelon uniform random generation with applications.
Theor. Comput. Sci. 307(2): 241-256 (2003) |
| 2002 |
|---|
| 15 | EE | Nicolas Bonichon,
Bertrand Le Saëc,
Mohamed Mosbah:
Wagner's Theorem on Realizers.
ICALP 2002: 1043-1053 |
| 14 | EE | Emmanuel Godard,
Yves Métivier,
Mohamed Mosbah,
Afif Sellami:
Termination Detection of Distributed Algorithms by Graph Relabelling Systems.
ICGT 2002: 106-119 |
| 13 | EE | Nicolas Bonichon,
Bertrand Le Saëc,
Mohamed Mosbah:
Optimal Area Algorithm for Planar Polyline Drawings.
WG 2002: 35-46 |
| 2001 |
|---|
| 12 | | Yves Métivier,
Mohamed Mosbah,
Pierre-André Wacrenier,
Stefan Gruner:
A Distributed Algorithm for Computing a Spanning Tree in Anonymous Tprime Graph.
OPODIS 2001: 141-158 |
| 11 | EE | Michel Bauderon,
Stefan Gruner,
Yves Métivier,
Mohamed Mosbah,
Afif Sellami:
Visualization of Distributed Algorithms Based on Graph Relabelling Systems.
Electr. Notes Theor. Comput. Sci. 50(3): (2001) |
| 10 | EE | Michel Bauderon,
Yves Métivier,
Mohamed Mosbah,
Afif Sellami:
Graph Relabelling Systems: a Tool for Encoding, Proving, Studying and Visualizing - Distributed Algorithms.
Electr. Notes Theor. Comput. Sci. 51: (2001) |
| 2000 |
|---|
| 9 | EE | Mohamed Mosbah,
Nasser Saheb:
Formal rational fractions and random walks on cycles.
Discrete Mathematics 217(1-3): 301-313 (2000) |
| 8 | EE | Nicolas Bonichon,
Bertrand Le Saëc,
Mohamed Mosbah:
Orthogonal Drawings Based On The Stratification Of Planar Graphs.
Electronic Notes in Discrete Mathematics 5: 35-37 (2000) |
| 1999 |
|---|
| 7 | EE | Mohamed Mosbah,
Nasser Saheb:
Non-Uniform Random Spanning Trees on Weighted Graphs.
Theor. Comput. Sci. 218(2): 263-271 (1999) |
| 1997 |
|---|
| 6 | | Mohamed Mosbah,
Nasser Saheb:
A Syntactic Approach to Random Walks on Graphs.
WG 1997: 258-272 |
| 1996 |
|---|
| 5 | | Mohamed Mosbah:
Probabilistic Graph Grammars.
Fundam. Inform. 26(3/4): 341-362 (1996) |
| 4 | EE | Mohamed Mosbah:
Probabilistic Hyperedge Replacement Grammars.
Theor. Comput. Sci. 159(1): 81-102 (1996) |
| 1993 |
|---|
| 3 | | Bruno Courcelle,
Mohamed Mosbah:
Monadic Second-Order Evaluations on Tree-Decomposable Graphs.
Theor. Comput. Sci. 109(1&2): 49-82 (1993) |
| 1992 |
|---|
| 2 | | Mohamed Mosbah:
Probabilistic Graph Grammars.
WG 1992: 236-247 |
| 1991 |
|---|
| 1 | | Bruno Courcelle,
Mohamed Mosbah:
Monadic Second-Order Evaluations on Tree-Decomposable Graphs.
WG 1991: 13-24 |
