The Byzantine consensus problem involves n processes, out of which t< n could be faulty
and behave arbitrarily. Three properties characterize consensus:(1) termination, requiring …

Abstract The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy and
Shavit characterized distributed tasks that are wait-free solvable and uncovered deep …

The topological view on distributed computing represents a task T as a relation∆ between
the complex I of its inputs and the complex O of its outputs. A cornerstone result in the field is …

Modern computing systems are distributed, ranging from single-chip multi-processors to
large-scale internet systems. In this thesis, we study computability and complexity issues …

The topological view on distributed computing represents a task T as a relation∆ between
the complex I of its inputs and the complex O of its outputs. A cornerstone result in the field is …

An affine model of computation is defined as a subset of iterated immediate-snapshot runs,
capturing a wide variety of shared-memory systems, such as wait-freedom, t-resilience, k …

The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy and Shavit
characterized the distributed tasks that are wait-free solvable, and thus uncovered a deep …

Classical computability theory studies whether a problem is decidable on the Turing
machine. Whether a problem is computable does not depend on what type of Turing …

Résumé Les systemes informatiques modernes sont des systemes distribués, allant de
multiples processeurs sur une même pucea des systemes internet de large échelle. Dans …

Distributed computing is a field of computer science concerned with computation that takes
place in a distributed system consisting of a collection of autonomous agents that …