Birs- 16w5152: Complexity and Analysis of Distributed Algorithms
-
Title: Data Structures of the Future: Concurrent, Optimistic, and Relaxed
Speaker:
Link:
-
Title: Complexity of Distributed Graph Algorithms in the LOCAL model
Speaker:
Link:
-
Title: Deterministic Objects: Life Beyond Consensus
Speaker:
Link:
-
Title: Supporting and Analyzing Probabilistic Consistency in Distributed Storage Systems
Speaker:
Link:
-
Title: Asynchronous Robot Gathering
Speaker:
Link:
-
Title: A Tutorial on Applying Combinatorial Topology to Byzantine Tasks
Speaker:
Link:
-
Title: PODC - Practice of Distributed Computing
Speaker:
Link:
-
Title: Communicating with Beeps
Speaker:
Link:
-
Title: Asynchrony and Least Fixpoint Logic
Speaker:
Link:
-
Title: TBD: Three Backoff Dilemmas
Speaker:
Link:
-
Title: 3 Original Sins +
Speaker:
Link:
-
Title: Memory Management for Lock-Free Data-Structures
Speaker:
Link:
-
Title: Dynamic Memory - It's Time to Talk About Complexity
Speaker:
Link:
-
Title: Sketching Your Way Toward Greater Efficiency
Speaker:
Link:
-
Title: Gossip, Latency, and Weighted Conductance
Speaker:
Link:
-
Title: Message-Passing Implementations of Shared Data Structures
Speaker:
Link:
-
Title: CONGEST lower bounds : beyond two-party reductions
Speaker:
Link:
-
Title: The Atomic Commit Problem: A Brief History
Speaker:
Link:
-
Title: Test and Set in Optimal Space
Speaker:
Link:
-
Title: Randomized Adversary Models
Speaker:
Link: