default search action
Nasser Saheb-Djahromi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [i1]Jean-François Marckert, Nasser Saheb-Djahromi, Akka Zemmari:
Election algorithms with random delays in trees. CoRR abs/1507.04909 (2015) - 2013
- [j14]Yves Métivier, J. M. Robson, Nasser Saheb-Djahromi, Akka Zemmari
:
On the time and the bit complexity of distributed randomised anonymous ring colouring. Theor. Comput. Sci. 502: 64-75 (2013) - 2011
- [j13]Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
An optimal bit complexity randomized distributed MIS algorithm. Distributed Comput. 23(5-6): 331-340 (2011) - 2010
- [j12]Abdelaaziz El Hibaoui
Uniform election in trees and polyominoids. Discret. Appl. Math. 158(9): 981-987 (2010) - [j11]Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
About randomised distributed graph colouring and graph partition algorithms. Inf. Comput. 208(11): 1296-1304 (2010)
2000 – 2009
- 2009
- [c10]Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm. OPODIS 2009: 359-364 - [c9]Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract). SIROCCO 2009: 323-337 - 2006
- [j10]Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari
Broadcast in the rendezvous model. Inf. Comput. 204(5): 697-712 (2006) - 2005
- [j9]Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari
Locally guided randomized elections in trees: The totally fair case. Inf. Comput. 198(1): 40-55 (2005) - 2004
- [c8]Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari
Broadcast in the Rendezvous Model. STACS 2004: 559-570 - 2003
- [j8]Yves Métivier, Nasser Saheb, Akka Zemmari
Analysis of a randomized rendezvous algorithm. Inf. Comput. 184(1): 109-128 (2003) - [c7]Jean-Michel Couvreur, Nasser Saheb, Grégoire Sutre:
An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems. LPAR 2003: 361-375 - [c6]Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari:
A uniform randomized election in trees. SIROCCO 2003: 259-274 - 2002
- [j7]Yves Métivier, Nasser Saheb, Akka Zemmari
Randomized local elections. Inf. Process. Lett. 82(6): 313-320 (2002) - 2000
- [j6]Mohamed Mosbah
Formal rational fractions and random walks on cycles. Discret. Math. 217(1-3): 301-313 (2000)
1990 – 1999
- 1999
- [j5]Mohamed Mosbah
Non-Uniform Random Spanning Trees on Weighted Graphs. Theor. Comput. Sci. 218(2): 263-271 (1999) - 1997
- [c5]Mohamed Mosbah
A Syntactic Approach to Random Walks on Graphs. WG 1997: 258-272 - [c4]Maurizio Alvarez-Manilla, Abbas Edalat, Nasser Saheb-Djahromi:
An extension result for continuous valuations. COMPROX 1997: 2-11 - 1996
- [j4]Yves Métivier, Nasser Saheb:
Medians and Centres of Polyominoes. Inf. Process. Lett. 57(4): 175-181 (1996) - 1994
- [c3]Yves Métivier, Nasser Saheb:
Probabilistic Analysis of an Election Algorithm in a Tree. CAAP 1994: 234-245
1980 – 1989
- 1989
- [j3]Nasser Saheb:
Concurrency measure in commutation monoids. Discret. Appl. Math. 24(1-3): 223-236 (1989) - 1986
- [j2]Philippe Flajolet, Nasser Saheb:
The Complexity of Generating an Exponentially Distributed Variate. J. Algorithms 7(4): 463-488 (1986) - 1983
- [c2]Philippe Flajolet, Nasser Saheb:
Digital Search Trees and the Generation of an Exponentially Distributed Variate. CAAP 1983: 221-235 - 1980
- [j1]Nasser Saheb-Djahromi:
CPO'S of Measures for Nondeterminism. Theor. Comput. Sci. 12: 19-37 (1980)
1970 – 1979
- 1978
- [c1]Nasser Saheb-Djahromi:
Probabilistic LCF. MFCS 1978: 442-451
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: