Complexity and Analysis of Distributed Algorithms
Videos from CMO Workshop
Dan Alistarh, Microsoft Research
Monday Nov 28, 2016 09:00 - 10:09
Data Structures of the Future: Concurrent, Optimistic, and Relaxed
Fabian Kuhn, University of Freiburg
Monday Nov 28, 2016 11:00 - 11:46
Complexity of Distributed Graph Algorithms in the LOCAL model
Faith Ellen, University of Toronto
Monday Nov 28, 2016 12:10 - 12:59
Deterministic Objects: Life Beyond Consensus
Wojciech Golab, University of Waterloo
Monday Nov 28, 2016 13:00 - 13:46
Supporting and Analyzing Probabilistic Consistency in Distributed Storage Systems
Armando Castañeda, Universidad Nacional Autónoma de México
Monday Nov 28, 2016 15:00 - 16:06
Asynchronous Robot Gathering
Maurice Herlihy, Brown University
Monday Nov 28, 2016 16:15 - 17:06
A Tutorial on Applying Combinatorial Topology to Byzantine Tasks
Dahlia Malkhi, Calibra
Tuesday Nov 29, 2016 09:00 - 10:03
PODC - Practice of Distributed Computing
Avery Miller, University of Manitoba
Tuesday Nov 29, 2016 10:09 - 10:31
Communicating with Beeps
Fabian Reiter, Institut de Recherche en Informatique Fondamentale
Tuesday Nov 29, 2016 11:00 - 11:40
Asynchrony and Least Fixpoint Logic
Michael Bender, Department of CS, Stony Brook University
Tuesday Nov 29, 2016 11:47 - 12:41
TBD: Three Backoff Dilemmas
Eli Gafni, University of California Los Angeles
Tuesday Nov 29, 2016 12:40 - 13:36
3 Original Sins +
Erez Petrank, Technion
Tuesday Nov 29, 2016 15:00 - 16:01
Memory Management for Lock-Free Data-Structures
Idit Keidar, Technion
Wednesday Nov 30, 2016 09:00 - 09:55
Dynamic Memory - It's Time to Talk About Complexity
Anne-Marie Kermarrec, INRIA Rennes
Wednesday Nov 30, 2016 10:00 - 10:32
Sketching Your Way Toward Greater Efficiency
Seth Gilbert, National University of Singapore
Wednesday Nov 30, 2016 11:00 - 11:29
Gossip, Latency, and Weighted Conductance
Jennifer Welch, Texas A & M University
Wednesday Nov 30, 2016 11:35 - 11:57
Message-Passing Implementations of Shared Data Structures
Rotem Oshman, Tel-Aviv University
Thursday Dec 1, 2016 09:00 - 10:06
CONGEST lower bounds : beyond two-party reductions
Rachid Guerraoui, Ecole Polytechnique Federale de Lausanne
Thursday Dec 1, 2016 10:14 - 10:45
The Atomic Commit Problem: A Brief History
Lisa Higham, University of Calgary
Thursday Dec 1, 2016 11:00 - 11:48
Test and Set in Optimal Space
George Giakkoupis, INRIA
Thursday Dec 1, 2016 12:01 - 12:50
Randomized Adversary Models
Danny Hendler, Ben-Gurion University of the Negev
Thursday Dec 1, 2016 12:55 - 13:33
The Backtracking Covering Proof Technique
Petr Kuznetsov, Telecom ParisTech
Thursday Dec 1, 2016 15:44 - 16:28
Concurrency as an Iterated Affine Task
Eric Ruppert, York University
Thursday Dec 1, 2016 16:30 - 17:06
Analysing the Average Time Complexity of Lock-Free Data Structures
Yoram Moses, Technion -- Israel Institute of Technology
Friday Dec 2, 2016 09:00 - 10:02
Indistinguishability, Duality and Necessary Conditions
Ohad Ben Baruch, Ben Guruion University of the Negev
Friday Dec 2, 2016 10:08 - 10:31
Lower Bound on the Step Complexity of Anonymous Binary Consensus
Zahra Aghazadeh, University of Calgary
Friday Dec 2, 2016 11:00 - 11:44
Boundless tagging with applications to wait-free memory reclamation
