Probabilistic LCF. - Nasser Saheb-Djahromi (MFCS, 1978)

CPO'S of Measures for Nondeterminism. - Nasser Saheb-Djahromi (Theor. Comput. Sci., 1980)

Digital Search Trees and the Generation of an Exponentially Distributed Variate. - Philippe Flajolet; Nasser Saheb (CAAP, 1983)

The Complexity of Generating an Exponentially Distributed Variate. - Philippe Flajolet; Nasser Saheb (J. Algorithms, 1986)

Concurrency measure in commutation monoids. - Nasser Saheb (Discret. Appl. Math., 1989)

Probabilistic Analysis of an Election Algorithm in a Tree. - Yves Métivier; Nasser Saheb (CAAP, 1994)

Medians and Centres of Polyominoes. - Yves Métivier; Nasser Saheb (Inf. Process. Lett., 1996)

A Syntactic Approach to Random Walks on Graphs. - Mohamed Mosbah 001; Nasser Saheb (WG, 1997)

An extension result for continuous valuations. - Maurizio Alvarez-Manilla; Abbas Edalat; Nasser Saheb-Djahromi (COMPROX, 1997)

Non-Uniform Random Spanning Trees on Weighted Graphs. - Mohamed Mosbah 001; Nasser Saheb (Theor. Comput. Sci., 1999)

Formal rational fractions and random walks on cycles. - Mohamed Mosbah 001; Nasser Saheb (Discret. Math., 2000)

Randomized local elections. - Yves Métivier; Nasser Saheb; Akka Zemmari (Inf. Process. Lett., 2002)

An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems. - Jean-Michel Couvreur; Nasser Saheb; Grégoire Sutre (LPAR, 2003)

A uniform randomized election in trees. - Yves Métivier; Nasser Saheb-Djahromi; Akka Zemmari (SIROCCO, 2003)

Analysis of a randomized rendezvous algorithm. - Yves Métivier; Nasser Saheb; Akka Zemmari (Inf. Comput., 2003)

Broadcast in the Rendezvous Model. - Philippe Duchon; Nicolas Hanusse; Nasser Saheb; Akka Zemmari (STACS, 2004)

Locally guided randomized elections in trees: The totally fair case. - Yves Métivier; Nasser Saheb-Djahromi; Akka Zemmari (Inf. Comput., 2005)

Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm. - Yves Métivier; John Michael Robson; Nasser Saheb-Djahromi; Akka Zemmari (OPODIS, 2009)

An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract). - Yves Métivier; John Michael Robson; Nasser Saheb-Djahromi; Akka Zemmari (SIROCCO, 2009)

Uniform election in trees and polyominoids. - Abdelaaziz El Hibaoui; John Michael Robson; Nasser Saheb-Djahromi; Akka Zemmari (Discret. Appl. Math., 2010)

About randomised distributed graph colouring and graph partition algorithms. - Yves Métivier; John Michael Robson; Nasser Saheb-Djahromi; Akka Zemmari (Inf. Comput., 2010)

An optimal bit complexity randomized distributed MIS algorithm. - Yves Métivier; John Michael Robson; Nasser Saheb-Djahromi; Akka Zemmari (Distributed Comput., 2011)

On the time and the bit complexity of distributed randomised anonymous ring colouring. - Yves Métivier; J. M. Robson; Nasser Saheb-Djahromi; Akka Zemmari (Theor. Comput. Sci., 2013)

Election algorithms with random delays in trees. - Jean-François Marckert; Nasser Saheb-Djahromi; Akka Zemmari (CoRR, 2015)