Christoph Lenzen TDS Seminar Friday, May 3, 2013  1:00pm to 2:30pm 

Information Complexity Lower Bounds in Communication Complexity Friday, April 5, 2013  1:00pm to 2:30pm I will describe the informationcomplexity approach to proving lower bounds in communication complexity. 

The Locality of Distributed Symmetry Breaking Friday, April 19, 2013  1:00pm to 2:30pm How do two pathologically polite people decide who should walk through a doorway first? After some number of iterations of "After you", "No, after you", surely one of them will have the courage to just walk through the damn doorway! But who wants to depend on human courage? 

A new Perspective on Vertex Connectivity Friday, April 12, 2013  1:00pm to 2:30pm Edge connectivity and vertex connectivity are two fundamental concepts in graph theory. Although by now there is a good understanding of the structure of graphs based on their edge connectivity, our knowledge in the case of vertex connectivity is much more limited. 

EarlyDeciding Consensus is Expensive and Efficient Distributed Source Detection with Limited Bandwidth Friday, March 8, 2013  1:00pm to 2:30pm In consensus, the n nodes of a distributed system seek to take a consistent decision on some output, despite up to t of them crashing or even failing maliciously, i.e., behaving “Byzantine”. 

Dan Alistarh Talk Friday, March 15, 2013  1:00pm to 2:30pm 