( en | de | ru )

 

Disambiguation of "Mashreghi, Ali"

Author of the publication

copydeleteadd this publication to your clipboard
When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem.

, and . Theory Comput. Syst., 58 (2): 287-303 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mir-Farzin Mashreghi

ali

Ali Aassie Ali

Ali Yasen Ali

Ali Ramadan Ali

 

Other publications of authors with the same name

Distributed broadcast and minimum spanning tree algorithms with low communication complexity.. University of Victoria, Canada, (2020)A recursive algorithm for optimizing differentiation., and . J. Comput. Appl. Math., (2014)When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem., and . Theory Comput. Syst., 58 (2): 287-303 (2016)Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model., and . DISC, volume 121 of LIPIcs, page 37:1-37:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Faster asynchronous MST and low diameter tree construction with sublinear communication., and . CoRR, (2019)Time-communication trade-offs for minimum spanning tree construction., and . ICDCN, page 8. ACM, (2017)Geometric-Based Fault Diagnosis in a Grid-Connected Inverter., and . CDC, page 3421-3426. IEEE, (2018)A Geometric Approach to Fault Detection and Isolation in a Grid-Connected Inverter., and . IEEE Trans. Control. Syst. Technol., 29 (6): 2622-2629 (2021)Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication., and . DISC, volume 146 of LIPIcs, page 49:1-49:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model., and . Distributed Comput., 34 (4): 283-299 (2021)