Towards a complexity theory for local distributed computing

Reviewer: Yaser Miaji

Background on the topic of distributed local computing is given in great detail in this paper. Most of the papers mentioned in the motivation section are recent and valuable in the area. Furthermore, some of the mathematical analysis in the first section reflects the authors' thorough coverage and understanding of the topic. Although I would like a more comprehensive analysis of the background (for example, the critiques of local distribution are not adequately justified), their framework is acceptable. The authors successfully illuminate their contributions. Moreover, the formulas they use highlight their work. As mentioned earlier, the related works section is very strong and relevant to the material covered by the paper. The flow of the presentation of the related works is smooth, and the authors comprehensively cover the literature critique and highlight the gaps. The summary of the decision issues and their complexity is subtle. No improvement is required, although some secondary issues are not mentioned. The elaboration of the computation is well organized and easy to understand. The authors are successful in their analytical and mathematical approaches, both in presenting previous work and in their new contributions. Finally, the results show a strong and complete study. Online Computing Reviews Service