BibTeX records: Ali Mashreghi

download as .bib file

@article{DBLP:journals/dc/MashreghiK21,
  author       = {Ali Mashreghi and
                  Valerie King},
  title        = {Broadcast and minimum spanning tree with o(m) messages in the asynchronous
                  {CONGEST} model},
  journal      = {Distributed Comput.},
  volume       = {34},
  number       = {4},
  pages        = {283--299},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00446-020-00387-y},
  doi          = {10.1007/S00446-020-00387-Y},
  timestamp    = {Mon, 26 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dc/MashreghiK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcst/MashreghiN21,
  author       = {Ali Mashreghi and
                  Mehrzad Namvar},
  title        = {A Geometric Approach to Fault Detection and Isolation in a Grid-Connected
                  Inverter},
  journal      = {{IEEE} Trans. Control. Syst. Technol.},
  volume       = {29},
  number       = {6},
  pages        = {2622--2629},
  year         = {2021},
  url          = {https://doi.org/10.1109/TCST.2020.3034717},
  doi          = {10.1109/TCST.2020.3034717},
  timestamp    = {Wed, 03 Nov 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcst/MashreghiN21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/ca/Mashreghi20,
  author       = {Ali Mashreghi},
  title        = {Distributed broadcast and minimum spanning tree algorithms with low
                  communication complexity},
  school       = {University of Victoria, Canada},
  year         = {2020},
  url          = {http://hdl.handle.net/1828/11532},
  timestamp    = {Fri, 05 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/ca/Mashreghi20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wdag/MashreghiK19,
  author       = {Ali Mashreghi and
                  Valerie King},
  editor       = {Jukka Suomela},
  title        = {Brief Announcement: Faster Asynchronous {MST} and Low Diameter Tree
                  Construction with Sublinear Communication},
  booktitle    = {33rd International Symposium on Distributed Computing, {DISC} 2019,
                  October 14-18, 2019, Budapest, Hungary},
  series       = {LIPIcs},
  volume       = {146},
  pages        = {49:1--49:3},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.DISC.2019.49},
  doi          = {10.4230/LIPICS.DISC.2019.49},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/MashreghiK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1907-12152,
  author       = {Ali Mashreghi and
                  Valerie King},
  title        = {Faster asynchronous {MST} and low diameter tree construction with
                  sublinear communication},
  journal      = {CoRR},
  volume       = {abs/1907.12152},
  year         = {2019},
  url          = {http://arxiv.org/abs/1907.12152},
  eprinttype    = {arXiv},
  eprint       = {1907.12152},
  timestamp    = {Thu, 01 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1907-12152.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cdc/MashreghiN18,
  author       = {Ali Mashreghi and
                  Mehrzad Namvar},
  title        = {Geometric-Based Fault Diagnosis in a Grid-Connected Inverter},
  booktitle    = {57th {IEEE} Conference on Decision and Control, {CDC} 2018, Miami,
                  FL, USA, December 17-19, 2018},
  pages        = {3421--3426},
  publisher    = {{IEEE}},
  year         = {2018},
  url          = {https://doi.org/10.1109/CDC.2018.8619631},
  doi          = {10.1109/CDC.2018.8619631},
  timestamp    = {Fri, 04 Mar 2022 13:30:11 +0100},
  biburl       = {https://dblp.org/rec/conf/cdc/MashreghiN18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wdag/MashreghiK18,
  author       = {Ali Mashreghi and
                  Valerie King},
  editor       = {Ulrich Schmid and
                  Josef Widder},
  title        = {Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous
                  {CONGEST} Model},
  booktitle    = {32nd International Symposium on Distributed Computing, {DISC} 2018,
                  New Orleans, LA, USA, October 15-19, 2018},
  series       = {LIPIcs},
  volume       = {121},
  pages        = {37:1--37:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.DISC.2018.37},
  doi          = {10.4230/LIPICS.DISC.2018.37},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/wdag/MashreghiK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1806-04328,
  author       = {Ali Mashreghi and
                  Valerie King},
  title        = {Broadcast and minimum spanning tree with o(m) messages in the asynchronous
                  {CONGEST} model},
  journal      = {CoRR},
  volume       = {abs/1806.04328},
  year         = {2018},
  url          = {http://arxiv.org/abs/1806.04328},
  eprinttype    = {arXiv},
  eprint       = {1806.04328},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1806-04328.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icdcn/MashreghiK17,
  author       = {Ali Mashreghi and
                  Valerie King},
  title        = {Time-communication trade-offs for minimum spanning tree construction},
  booktitle    = {Proceedings of the 18th International Conference on Distributed Computing
                  and Networking, Hyderabad, India, January 5-7, 2017},
  pages        = {8},
  publisher    = {{ACM}},
  year         = {2017},
  url          = {http://dl.acm.org/citation.cfm?id=3007775},
  timestamp    = {Tue, 06 Nov 2018 11:07:44 +0100},
  biburl       = {https://dblp.org/rec/conf/icdcn/MashreghiK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/MashreghiZ16,
  author       = {Ali Mashreghi and
                  Alireza Zarei},
  title        = {When Diameter Matters: Parameterized Approximation Algorithms for
                  Bounded Diameter Minimum Steiner Tree Problem},
  journal      = {Theory Comput. Syst.},
  volume       = {58},
  number       = {2},
  pages        = {287--303},
  year         = {2016},
  url          = {https://doi.org/10.1007/s00224-015-9615-7},
  doi          = {10.1007/S00224-015-9615-7},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/MashreghiZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcam/MashreghiY14,
  author       = {Ali Mashreghi and
                  Hadi Sadoghi Yazdi},
  title        = {A recursive algorithm for optimizing differentiation},
  journal      = {J. Comput. Appl. Math.},
  volume       = {263},
  pages        = {1--13},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.cam.2013.11.022},
  doi          = {10.1016/J.CAM.2013.11.022},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcam/MashreghiY14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.