Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Mehri Javanian"'
Autor:
Mehri Javanian, Rafik Aguech
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:2, Iss Combinatorics (2024)
The exponential recursive trees model several kinds of networks. At each step of growing of these trees, each node independently attracts a new node with probability p, or fails to do with probability 1 − p. Here, we investigate the number of prote
Externí odkaz:
https://doaj.org/article/423db1134d2b4f38ac4ee307ab9ceb3c
Autor:
Mehri Javanian, Ali Mosammam
Publikováno v:
Mathematics Interdisciplinary Research, Vol 7, Iss 4, Pp 357-375 (2022)
This paper investigates the asymptotic behavior of the number of recalls Xn of the Random Median Quicksort algorithm in order to sort a list of n distinct numbers. As n→∞, we provide the asymptotics of the expectation and variance of the recalls.
Externí odkaz:
https://doaj.org/article/0b40cf1ecba3432f81503e1d4b2a3104
Autor:
Mehri Javanian
Publikováno v:
پژوهشهای ریاضی, Vol 6, Iss 2, Pp 169-182 (2020)
Introduction Tries (from retrieval) are one of the most practical data structures with a tree construction in computer science. Tries store string data in leaves of tree. They are often used to store such data so that future retrieval can be made eff
Externí odkaz:
https://doaj.org/article/4519313baeda4a3e883fca300d0fe0fb
Autor:
Mehri Javanian
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 20 no. 1, Iss Analysis of Algorithms (2018)
In a rooted tree, protected nodes are neither leaves nor parents of any leaves. They have some practical motivations, e.g., in organizational schemes, security models and social-network models. Protected node profile measures the number of protected
Externí odkaz:
https://doaj.org/article/08f2422e9170435bbe8cfb71dbc7839f
Publikováno v:
Teoriya Veroyatnostei i ee Primeneniya. 67:563-578
Защищенные вершины, т.е. вершины с расстоянием не менее $2$ до ближайшего листа, были изучены для различных классов случайных корневых дер
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5582e9e568d7198e78d508877b7ee440
https://doi.org/10.4213/tvp5455
https://doi.org/10.4213/tvp5455
Autor:
Mehri Javanian
Publikováno v:
National Academy Science Letters. 42:441-444
In this paper, we investigate leaves for random paged digital search trees, an important and generalized version of digital search trees.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::104a695caeb26600cba16f2a92b7b45b
https://doi.org/10.1007/s40009-018-0778-z
https://doi.org/10.1007/s40009-018-0778-z
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 56:2
Here, we derive the exact mean and variance of the number of weakly protected nodes (the nodes that are not leaves and at least one of their children is not a leaf) in binary search trees grown from random permutations. Furthermore, by using contract
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a3b73564fa7f7e2502a95276aebbb35
https://doi.org/10.1051/ita/2022002
https://doi.org/10.1051/ita/2022002
Autor:
Mohammad Q. Vahidi-Asl, Mehri Javanian
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 51:7-15
Ordinary digital search trees (DSTs) stores one word in each of its internal nodes and leaves, but a DST with paging size b allows storing b words in the leaves, which corresponds to pages in auxiliary storage. In this paper, we analyse the average n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::752be6c834616acbf6fceb3a9bbd28fd
https://doi.org/10.1051/ita/2017002
https://doi.org/10.1051/ita/2017002
Autor:
Michael Fuchs, Mehri Javanian
Publikováno v:
Applicable Analysis and Discrete Mathematics. 9:313-331
We consider geometric words ?1....?n with letters satisfying the restricted growth property ?k ? d + max{?0,...,?k-1}, where ?0 := 0 and d ? 1. For d = 1 these words are in 1-to-1 correspondence with set partitions and for this case, we show that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::793a4b5486e6e49a74d1a03fc37c19c2
https://doi.org/10.2298/aadm150619013f
https://doi.org/10.2298/aadm150619013f
Autor:
Mehri Javanian, Mohammad Q. Vahidi-Asl
Publikováno v:
Journal of Applied Mathematics, Statistics and Informatics. 8:67-72
Let Nt be the total number of nodes in a Yule m-oriented recursive tree at time t. Then {Nt : t ∈ [0;1)} is a Yule process with birth rates λn = (m(n - 1) + 1)λ for n ≥ 1, where N0 = 1. In this paper, we first give the exact distribution of Nt,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53ad3896bc8fc29864976c2bf7dd47f6
https://doi.org/10.2478/v10294-012-0015-1
https://doi.org/10.2478/v10294-012-0015-1