Time+Place: | Tuesday 26/06/2012 14:30 Room 337-8 Taub Bld. |

Title: | Recursion in Distributed Computing |

Speaker: | Sergio Rajsbaum
>
http://www.matem.unam.mx/~rajsbaum/ |

Affiliation: | Instituto de Matematicas, Universidad Nacional Autonoma de Mexico |

Host: | Hagit Attiya |

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 describe a recursive distributed computing model where it easier to prove impossibility results. Short bio: Sergio Rajsbaum received a degree in Computer Engineering from the National Autonomous University of Mexico (UNAM) in 1985, and a PhD in the Computer Science from the Technion, Israel, in 1991. Since then he has been a faculty member at the Institute of Mathematics at UNAM. His research interests are in the theory of distributed computing, especially issues related to coordination, complexity and computability. He has also published in graph theory and algorithms. Refreshments served from 14:15 on, Lecture starts at 14:30