Andrew Drucker

  1. Title:
    An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature

    Speaker:

    Link:

  2. Title:
    Do NP-Hard Problems Require Exponential Time?

    Speaker:

    Link:

  3. Title:
    Exponential-time algorithms for NP problems: prospects and limits

    Speaker:

    Link:

  4. Title:
    Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers

    Speaker:

    Link:

  5. Title:
    On the AND- and OR-Conjectures: Limits to Efficient Preprocessing

    Speaker:

    Link:

  6. Title:
    The Complexity of Transforming Problem Instances

    Speaker:

    Link:

  7. Title:
    High-Confidence Predictions under Adversarial Uncertainty

    Speaker:

    Link: