The benefits of developing algorithms via recursion are well known. However, little use of recursion has been done in distributed algorithms, in spite of the fact that recursive structuring principles for distributed systems have been advocated since the beginning of the field. We present several distributed algorithms in a recursive form, which makes them easier to understand and analyze. Also, we expose several interesting issues arising in recursive distributed algorithms. Our goal is to promote the use and study of recursion in distributed algorithms. © 2010 Springer-Verlag.
CITATION STYLE
Gafni, E., & Rajsbaum, S. (2010). Recursion in distributed computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6366 LNCS, pp. 362–376). https://doi.org/10.1007/978-3-642-16023-3_30
Mendeley helps you to discover research relevant for your work.