A decision task is a distributed input-output problem in which each process starts with its
input value and eventually produces its output value. Examples of such decision tasks are …

We formalize Byzantine linearizability, a correctness condition that specifies whether a
concurrent object with a sequential specification is resilient against Byzantine failures. Using …

Most modern asset transfer systems use consensus to maintain a totally ordered chain of
transactions. It was recently shown that consensus is not always necessary for implementing …

An accountable distributed system provides means to detect deviations of system
components from their expected behavior. It is natural to complement fault detection with a …

This paper introduces Carbon, a high-throughput system enabling asynchronous (safe) and
consensus-free (efficient) payments and votes within a dynamic set of clients. Carbon is …

In the Lattice Agreement (LA) problem, originally proposed by Attiya et al.[1], a set of
processes has to decide on a chain of a lattice. More precisely, each correct process …

We propose three algorithms for the Byzantine lattice agreement problem in synchronous
systems. The first algorithm runs in min {3h (X)+ 6, 6√{f_a}+ 6}) rounds and takes O (n² min …

In this thesis, we argue that (order-) lattice-based multi-agent information systems constitute
a broad class of networked multi-agent systems in which relational data is passed between …

The atomic snapshot object (ASO) can be seen as a generalization of the atomic read/write
register. ASO divides the object into n segments such that each node can update its own …

We study the lattice agreement (LA) and atomic snapshot problems in asynchronous
message-passing systems where up to $ f $ nodes may crash. Our main result is a crash …