Birs- 16w5152: Complexity and Analysis of Distributed Algorithms
-
Title: The Backtracking Covering Proof Technique
Speaker:
Link:
-
Title: Concurrency as an Iterated Affine Task
Speaker:
Link:
-
Title: Analysing the Average Time Complexity of Lock-Free Data Structures
Speaker:
Link:
-
Title: Indistinguishability, Duality and Necessary Conditions
Speaker:
Link:
-
Title: Lower Bound on the Step Complexity of Anonymous Binary Consensus
Speaker:
Link:
-
Title: Boundless tagging with applications to wait-free memory reclamation
Speaker:
Link: