Birs- 16w5152: Complexity and Analysis of Distributed Algorithms

  1. Title:
    The Backtracking Covering Proof Technique

    Speaker:

    Link:

  2. Title:
    Concurrency as an Iterated Affine Task

    Speaker:

    Link:

  3. Title:
    Analysing the Average Time Complexity of Lock-Free Data Structures

    Speaker:

    Link:

  4. Title:
    Indistinguishability, Duality and Necessary Conditions

    Speaker:

    Link:

  5. Title:
    Lower Bound on the Step Complexity of Anonymous Binary Consensus

    Speaker:

    Link:

  6. Title:
    Boundless tagging with applications to wait-free memory reclamation

    Speaker:

    Link: