AG 1   Info

AG Audience

English

30 Minutes

Saarbrücken

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.

Christoph Lenzen

--email hidden

passcode not visible

logged in users only