Distributed Computing Through Combinatorial Topology describes techniques for analyzing
distributed algorithms based on award winning combinatorial topology research. The …

What can and cannot be computed in a distributed system is a complex function of the
system's communication model, timing model, and failure model. Considering a canonical …

In an asynchronous distributed system where any number of processes may crash, a
process may have to run solo, computing its local output without receiving any information …

For all integers m≥ 2, we construct an infinite sequence of deterministic objects of
consensus number m with strictly increasing computational power. In particular, this refutes …

If one model of computation can simulate another, then the existence (or non-existence) of
an algorithm in the simulated model reduces to a related question about the simulating …

This paper presents a simple generalization of the basic atomic read/write register object,
whose genericity parameter spans the whole set of integers and is such that its k …

Since the early days of the shared memory model for distributed computing, researchers
have sought a simple and precise characterization of an object's ability to implement other …

The state machine approach is a well-known technique for building distributed services
requiring high performance and high availability, by replicating servers, and by coordinating …

The basic read/write shared memory model where asynchronous and crash prone
processes communicate to solve a task is difficult to analyze. A more structured model is the …

As today Computer Science is more and more (driven) consumed by its applications, it
becomes more and more important to know what is and what is not computable. For a long …