| 2006 |
|---|
| 13 | EE | Philippe Duchon,
Nicolas Hanusse,
Nasser Saheb,
Akka Zemmari:
Broadcast in the rendezvous model.
Inf. Comput. 204(5): 697-712 (2006) |
| 2004 |
|---|
| 12 | EE | Philippe Duchon,
Nicolas Hanusse,
Nasser Saheb,
Akka Zemmari:
Broadcast in the Rendezvous Model.
STACS 2004: 559-570 |
| 2003 |
|---|
| 11 | EE | Jean-Michel Couvreur,
Nasser Saheb,
Grégoire Sutre:
An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems.
LPAR 2003: 361-375 |
| 10 | EE | Yves Métivier,
Nasser Saheb,
Akka Zemmari:
Analysis of a randomized rendezvous algorithm.
Inf. Comput. 184(1): 109-128 (2003) |
| 2002 |
|---|
| 9 | EE | Yves Métivier,
Nasser Saheb,
Akka Zemmari:
Randomized local elections.
Inf. Process. Lett. 82(6): 313-320 (2002) |
| 2000 |
|---|
| 8 | EE | Mohamed Mosbah,
Nasser Saheb:
Formal rational fractions and random walks on cycles.
Discrete Mathematics 217(1-3): 301-313 (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 | EE | Yves Métivier,
Nasser Saheb:
Medians and Centres of Polyominoes.
Inf. Process. Lett. 57(4): 175-181 (1996) |
| 1994 |
|---|
| 4 | | Yves Métivier,
Nasser Saheb:
Probabilistic Analysis of an Election Algorithm in a Tree.
CAAP 1994: 234-245 |
| 1989 |
|---|
| 3 | EE | Nasser Saheb:
Concurrency measure in commutation monoids.
Discrete Applied Mathematics 24(1-3): 223-236 (1989) |
| 1986 |
|---|
| 2 | | Philippe Flajolet,
Nasser Saheb:
The Complexity of Generating an Exponentially Distributed Variate.
J. Algorithms 7(4): 463-488 (1986) |
| 1983 |
|---|
| 1 | | Philippe Flajolet,
Nasser Saheb:
Digital Search Trees and the Generation of an Exponentially Distributed Variate.
CAAP 1983: 221-235 |
