Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Approximate Agreement on Graphs
Speaker:Joel Rybicki
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:
Event Type:AG1 Mittagsseminar (others' work)
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Tuesday, 26 February 2019
Duration:30 Minutes
Building:E1 4
The seemingly simple task of agreeing on a common value is a fundamental problem in fault-tolerant distributed computing. It is well-known that reaching exact agreement is often hard or impossible in the presence unreliable processors already when there are only two distinct values to choose from. However, in many cases approximate agreement, e.g., choosing continuous real values that are close to each other, can be done efficiently. In this talk, we consider approximate agreement in settings where the values have some discrete structure in the form of a graph.
Name(s):Christoph Lenzen
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
Christoph Lenzen, 02/22/2019 05:16 PM
Last modified:
Uwe Brahm/MPII/DE, 02/26/2019 04:01 AM
  • Christoph Lenzen, 02/22/2019 05:16 PM
  • Christoph Lenzen, 02/22/2019 05:16 PM -- Created document.