Speaker: Petteri Kaski
Assistant Professor, Aalto University
Delegatable and error-tolerant algorithms
Abstract:
Is it possible to delegate a computation to an unreliable and more powerful counterparty? Can we design algorithms in such a way that not only can their execution be delegated, but a controlled number of adversarial errors can take place during the execution and yet one can recover the desired result? This talk will review theory and engineering efforts to bring such algorithm designs to the computing practice, including some of our recent work.
**
Helsinki Algorithms Seminar is a weekly meeting of researchers in the Helsinki area interested in the art of algorithms and algorithm design, broadly interpreted to cover both theoretical ideas and algorithm engineering on concrete computing platforms. In most cases we have a presentation prepared for each meeting to communicate an idea, a recent result, work-in-progress, or demo, but this should not be at the expense of discussion and simply having fun with algorithms.
Our affiliations are with Aalto University and the University of Helsinki, and accordingly our activities alternate between the Otaniemi Campus of Aalto University and the Kumpula Campus of University of Helsinki, catalyzed by the Helsinki Institute for Information Technology HIIT, under the Algorithmic Data Analysis (ADA) programme.
Welcome!
Last updated on 16 Oct 2017 by Noora Suominen de Rios - Page created on 16 Oct 2017 by Noora Suominen de Rios