Murat Demirbas: Hybrid Clocks for High Auditability Friday, October 16, 2015  1:00pm to 2:30pm Work on theory of distributed systems abstract away from thewallclock/physicalclock time and use the notion of logical clocks for 

Rati Gelashvili: On the Optimal Space Complexity of Consensus for Anonymous Processes Monday, September 28, 2015  2:00pm to 3:30pm The optimal space complexity of consensus in shared memory is 

Merav Parter: "Fault Tolerant BFS Structures: A ReinforcementBackup Tradeoff Friday, September 25, 2015  1:00pm to 2:30pm 

Mohsen Ghaffari: An Improved Distributed Algorithm for Maximal Independent Set Friday, September 18, 2015  1:00pm to 2:30pm We are all familiar with Luby's seminal MIS algorithm which has a round complexity of O(log n). In this talk, I will describe a different MIS algorithm, which improves the bound to O(log Delta) + 2^{\sqrt{log log n}}. 

Rati Gelashvili: Optimal Space Complexity of Consensus for Anonymous Processes Tuesday, May 26, 2015  1:00pm to 2:30pm Abstract: 

Erez Kantor: Computing in Additive Networks with BoundedInformation Codes Friday, April 24, 2015  1:00pm to 2:30pm 

Mohsen Ghaffari: Distributed Broadcast Revisited: Towards Universal Optimality Friday, April 17, 2015  1:00pm to 2:30pm I will tell you about the good old distributed problem of broadcast and a new algorithmic approach for achieving/approximating universal optimality in this problem. 

HsinHao Su: Distributed Algorithms for the Lovász Local Lemma and Graph Coloring Friday, February 20, 2015  1:00pm to 2:30pm The Lovász Local Lemma (LLL), introduced by Erdos and Lovász in 1975, is a powerful tool of the probabilistic method that allows one to prove that a set of n "bad" events do not happen with nonzero probability, provided that the events have limited dependence. 

HsinHao Su: Distributed Algorithms for the Lovasz Local Lemma and Graph Coloring Friday, February 20, 2015  1:30pm to 3:00pm Distributed Algorithms for the Lovász Local Lemma and Graph Coloring 

Mohsen Lesani: Eventual Consistency Friday, December 5, 2014  1:00pm to 2:30pm Globally distributed systems often involve shared data that is read and modified by multiple nodes across the network. 