Distributed Graph Coloring by Leonid Barenboim

Distributed Graph Coloring by Leonid Barenboim

The focus of this monograph is on symmetry breaking problems in the message-passing model of distributed computing. Other typical symmetry-breaking problems are the problems of computing a maximal independent set (MIS) and a maximal matching (MM).

Michael Elkin received his Ph.D. in Computer Science and Mathemat ics from the Weizmann Institute, Rehovot, Israel, in 2002. He held po sitions in the Institute for Advanced Study in Princeton and in Yale Uni versity, before joining the Ben-Gurion University of the Negev in 2004. He is an Associate Professor in the Computer Science department in the Ben-Gurion University. His main research interests are distributed algorithms, graph algorithms and metric embeddings. Leonid Barenboim performed his Ph.D. research in Computer Science in Ben-Gurion University of the Negev. His research deals with dis tributed algorithms for symmetry-breaking and synchronization. His re search interests also include graph theory, randomized algorithms and approximation algorithms. He served as a lecturer of a course on im plementation of distributed algorithms and a course on object oriented programming. In 2013 he was accepted to the joint research program of Berkeley and I-CORE that deals with the theoryof big data analysis and large-scale networks

SKU	Unavailable
ISBN 13	9783031008818
ISBN 10	3031008812
Title	Distributed Graph Coloring
Author	Leonid Barenboim
Series	Synthesis Lectures On Distributed Computing Theory
Condition	Unavailable
Binding Type	Paperback
Publisher	Springer International Publishing AG
Year published	2013-08-07
Number of pages	157
Cover note	Book picture is for illustrative purposes only, actual binding, cover or edition may vary.