Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Towards a complexity theory for local distributed computing
Fraigniaud P., Korman A., Peleg D. Journal of the ACM60 (5):1-26,2013.Type:Article
Date Reviewed: Apr 24 2014

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.

Reviewer:  Yaser Miaji Review #: CR142212 (1407-0565)
Bookmark and Share
 
Complexity Measures And Classes (F.1.3 )
 
 
Distributed Systems (C.2.4 )
 
 
Graph Theory (G.2.2 )
 
 
Network Protocols (C.2.2 )
 
 
Reliability, Testing, And Fault-Tolerance (B.8.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Complexity Measures And Classes": Date
Nonuniform proof systems
Kämper J. Theoretical Computer Science 85(2): 305-331, 1991. Type: Article
Feb 1 1993
Reversal complexity
Chen J., Yap C. SIAM Journal on Computing 20(4): 622-638, 1991. Type: Article
Oct 1 1992
Lower bounds for algebraic computation trees with integer inputs
Yao A. (ed) SIAM Journal on Computing 20(4): 655-668, 1991. Type: Article
Jul 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy