| Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model A Mashreghi, V King International Symposium on DIStributed Computing (DISC) 2018 121, 1-17, 2018 | 30 | 2018 |
| Time-communication trade-offs for minimum spanning tree construction A Mashreghi, V King Proceedings of the 18th International Conference on Distributed Computing …, 2017 | 20 | 2017 |
| Brief announcement: Faster asynchronous MST and low diameter tree construction with sublinear communication A Mashreghi, V King 33rd International Symposium on Distributed Computing (DISC 2019), 2019 | 14 | 2019 |
| Faster asynchronous MST and low diameter tree construction with sublinear communication A Mashreghi, V King arXiv preprint arXiv:1907.12152, 2019 | 3 | 2019 |
| When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem A Mashreghi, A Zarei Theory of Computing Systems 58, 287-303, 2016 | 2 | 2016 |
| A recursive algorithm for optimizing differentiation A Mashreghi, HS Yazdi Journal of computational and applied mathematics 263, 1-13, 2014 | 2 | 2014 |
| Distributed broadcast and minimum spanning tree algorithms with low communication complexity A Mashreghi | | 2020 |
Valerie KingProfessor of Computer Science, University of VictoriaEmail verificata su uvic.ca
