The focus of this monograph is on symmetry breaking problems in the message-passing model of distributed computing. In this model a communication network is represented by a n-vertex graph G = (V,E), whose vertices host autonomous processors. The processors communicate over the edges of G in discrete rounds. The goal is to devise algorithms that use as few rounds as possible. A typical symmetry-breaking problem is the problem of graph coloring. Denote by ? the maximum degree of G. While coloring G with ? + 1 colors is trivial in the centralized setting, the problem becomes much more challenging in the distributed one. One can also compromise on the number of colors, if this allows for more efficient algorithms. Other typical symmetry-breaking problems are the problems of computing a maximal independent set (MIS) and a maximal matching (MM). The study of these problems dates back to the very early days of distributed computing. The founding fathers of distributed computing laid firm foundations for the area of distributed symmetry breaking already in the eighties. In particular, they showed that all these problems can be solved in randomized logarithmic time. Also, Linial showed that an O(?2)-coloring can be solved very efficiently deterministically. However, fundamental questions were left open for decades. In particular, it is not known if the MIS or the (? + 1)-coloring can be solved in deterministic polylogarithmic time. Moreover, until recently it was not known if in deterministic polylogarithmic time one can color a graph with significantly fewer than ?2 colors. Additionally, it was open (and still open to some extent) if one can have sublogarithmic randomized algorithms for the symmetry breaking problems. Recently, significant progress was achieved in the study of these questions. More efficient deterministic and randomized (? + 1)-coloring algorithms were achieved. Deterministic ?1 + o(1)-coloring algorithms with polylogarithmic running time were devised. Improved (and often sublogarithmic-time) randomized algorithms were devised. Drastically improved lower bounds were given. Wide families of graphs in which these problems are solvable much faster than on general graphs were identified. The objective of our monograph is to cover most of these developments, and as a result to provide a treatise on theoretical foundations of distributed symmetry breaking in the message-passing model. We hope that our monograph will stimulate further progress in this exciting area.

Crime drama based on the life of Scottish gangster Paul Ferris. Martin Compston stars as Ferris, who was brought up on Glasgow's notorious Black Hill estate in the 1960s. As a young man Ferris starts out working for two rival gang bosses, The Godfather and The Snake, but after a brutal betrayal he decides to go it alone. Carving out a dangerous and bloody career defined by violence, corruption and murder, Paul 'The Wee Man' Ferris ends up becoming the most feared man in Glasgow.

A realistic view of babies and parenting, from a mom of 6 with 23 years experience as a nurse and lactation consultant. My style of parenting is always happy mom equals happy baby, regardless of how you choose to feed or parent. There is no one right way. My views are based on my observations and experiences both in the hospital and in my own life. I have taught and taken care of a ton of new parents, my views are based on this, with a touch of humor thrown in.

Drunkenness is powerful behavior. In time, families and friends will react to it in predictable ways. Working from this premise, family therapist Michael Elkin shows how alcoholic families develop, how they train their members, and how a therapist can interrupt their lemminglike march to disaster. The book is written for people who work with alcoholics and their families. Its informal style and commonsense approach, however, make it enlightening reading for anyone interested in America s number-one health problem."

Crime drama based on the life of Scottish gangster Paul Ferris. Martin Compston stars as Ferris, who was brought up on Glasgow's notorious Black Hill estate in the 1960s. As a young man Ferris starts out working for two rival gang bosses, The Godfather and The Snake, but after a brutal betrayal he decides to go it alone. Carving out a dangerous and bloody career defined by violence, corruption and murder, Paul 'The Wee Man' Ferris ends up becoming the most feared man in Glasgow.