Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Mashreghi, Ali"'
Autor:
Mashreghi, Ali, King, Valerie
Building a spanning tree, minimum spanning tree (MST), and BFS tree in a distributed network are fundamental problems which are still not fully understood in terms of time and communication cost. x The first work to succeed in computing a spanning tr
Externí odkaz:
http://arxiv.org/abs/1907.12152
Autor:
Mashreghi, Ali, King, Valerie
We provide the first asynchronous distributed algorithms to compute broadcast and minimum spanning tree with $o(m)$ bits of communication, in a graph with $n$ nodes and $m$ edges. For decades, it was believed that $\Omega(m)$ bits of communication ar
Externí odkaz:
http://arxiv.org/abs/1806.04328
Autor:
Kamali, Mohammad R., Mashreghi, Ali R., Karjalainen, L. Pentti, Hasani, Saeed, Javaheri, Vahid, Saukko, Sami, Kömi, Jukka
Publikováno v:
In Materialia August 2020 12
Publikováno v:
In Solar Energy 1 May 2020 201:547-554
Autor:
MAHDAVI, AZIZEH1, MASHREGHI, ALI REZA1 amashreghi@yazd.ac.ir, HASANI, SAEED1, KAMALI, MOHAMMAD REZA1
Publikováno v:
Archives of Metallurgy & Materials. 2022, Vol. 67 Issue 2, p703-717. 15p.
Autor:
Mashreghi, Ali1 (AUTHOR), King, Valerie1 (AUTHOR) val@uvic.ca
Publikováno v:
Distributed Computing. Aug2021, Vol. 34 Issue 4, p283-299. 17p.
Autor:
Mashreghi, Ali, Zare, Hajar
Publikováno v:
In Current Applied Physics May 2016 16(5):599-604
Autor:
Mashreghi, Ali, Yazdi, Hadi Sadoghi
Publikováno v:
In Journal of Computational and Applied Mathematics June 2014 263:1-13
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Mashreghi, Ali, King, Valerie
Building a spanning tree, minimum spanning tree (MST), and BFS tree in a distributed network are fundamental problems which are still not fully understood in terms of time and communication cost. The first work to succeed in computing a spanning tree
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14306d8cee57c13a72ed0137b89db38b