Nasser Saheb-Djahromi

According to our database, Nasser Saheb-Djahromi authored at least 24 papers between 1978 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

Election algorithms with random delays in trees.

Jean-François Marckert, Nasser Saheb-Djahromi, Akka Zemmari

CoRR, 2015

2013

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

2011

An optimal bit complexity randomized distributed MIS algorithm.

Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari

Distributed Comput., 2011

2010

About randomised distributed graph colouring and graph partition algorithms.

Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari

Inf. Comput., 2010

Uniform election in trees and polyominoids.

Abdelaaziz El Hibaoui, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari

Discret. Appl. Math., 2010

2009

An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract).

Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari

Proceedings of the Structural Information and Communication Complexity, 2009

Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm.

Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2006

Broadcast in the rendezvous model.

Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari

Inf. Comput., 2006

2005

Locally guided randomized elections in trees: The totally fair case.

Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari

Inf. Comput., 2005

2003

Analysis of a randomized rendezvous algorithm.

Yves Métivier, Nasser Saheb, Akka Zemmari

Inf. Comput., 2003

A uniform randomized election in trees.

Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems.

Jean-Michel Couvreur, Nasser Saheb, Grégoire Sutre

Proceedings of the Logic for Programming, 2003

2002

Randomized local elections.

Yves Métivier, Nasser Saheb, Akka Zemmari

Inf. Process. Lett., 2002

2000

Formal rational fractions and random walks on cycles.

Mohamed Mosbah, Nasser Saheb

Discret. Math., 2000

1999

Non-Uniform Random Spanning Trees on Weighted Graphs.

Mohamed Mosbah, Nasser Saheb

Theor. Comput. Sci., 1999

1997

An extension result for continuous valuations.

Maurizio Alvarez-Manilla, Abbas Edalat, Nasser Saheb-Djahromi

Proceedings of the Third Workshop on Computation and Approximation, 1997

A Syntactic Approach to Random Walks on Graphs.

Mohamed Mosbah, Nasser Saheb

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

1996

Medians and Centres of Polyominoes.

Yves Métivier, Nasser Saheb

Inf. Process. Lett., 1996

1994

Probabilistic Analysis of an Election Algorithm in a Tree.

Yves Métivier, Nasser Saheb

Proceedings of the Trees in Algebra and Programming, 1994

1989

Concurrency measure in commutation monoids.

Nasser Saheb

Discret. Appl. Math., 1989

1986

The Complexity of Generating an Exponentially Distributed Variate.

Philippe Flajolet, Nasser Saheb

J. Algorithms, 1986

1983

Digital Search Trees and the Generation of an Exponentially Distributed Variate.

Philippe Flajolet, Nasser Saheb

Proceedings of the CAAP'83, 1983

1980

CPO'S of Measures for Nondeterminism.

Nasser Saheb-Djahromi

Theor. Comput. Sci., 1980

1978

Probabilistic LCF.

Nasser Saheb-Djahromi

Proceedings of the Mathematical Foundations of Computer Science 1978, 1978