Nasser Saheb-Djahromi

12 papers B 4Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
2015 J jnl
Election algorithms with random delays in trees.
CoRR
Jean-François Marckert, Nasser Saheb-Djahromi, Akka Zemmari
2013 J jnl
On the time and the bit complexity of distributed randomised anonymous ring colouring.
Theor. Comput. Sci.
Yves Métivier, J. M. Robson, Nasser Saheb-Djahromi, Akka Zemmari
2011 J jnl
An optimal bit complexity randomized distributed MIS algorithm.
Distributed Comput.
Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
2010 J jnl
About randomised distributed graph colouring and graph partition algorithms.
Inf. Comput.
Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
2010 J jnl
Uniform election in trees and polyominoids.
Discret. Appl. Math.
Abdelaaziz El Hibaoui, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
2009 B conf
An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract).
SIROCCO
Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
2009 B conf
Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm.
OPODIS
Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
2005 J jnl
Locally guided randomized elections in trees: The totally fair case.
Inf. Comput.
Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari
2003 B conf
A uniform randomized election in trees.
SIROCCO
Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari
1997 — conf
An extension result for continuous valuations.
COMPROX
Maurizio Alvarez-Manilla, Abbas Edalat, Nasser Saheb-Djahromi
1980 J jnl
CPO'S of Measures for Nondeterminism.
Theor. Comput. Sci.
Nasser Saheb-Djahromi
1978 B conf
Probabilistic LCF.
MFCS
Nasser Saheb-Djahromi