Exploring the power of shared memory communication objects and models, and the limits of
distributed computability are among the most exciting research areas of distributed …

More than two decades ago, combinatorial topology was shown to be useful for analyzing
distributed fault-tolerant algorithms in shared memory systems and in message passing …

We prove tight bounds on the time needed to solve k-set agreement. In this problem, each
processor starts with an arbitrary input value taken from a fixed set, and halts after choosing …

Towards a topological characterization of asynchronous complexity Page 1 Towards a
Topological Characterization of Asynchronous Complexity (Preliminary Version) Gunnar Hoest …

This paper presents a self-contained study of wait-free solvable tasks. A new necessary
condition for wait-free solvability, based on a restricted set of executions, is proved. This set …

In the renaming task n+ 1 processes start with unique input names taken from a large space
and must choose unique output names taken from a smaller name space, 0, 1,..., K. To rule …

In the renaming task, n+ 1 processes start with unique input names from a large space and
must choose unique output names taken from a smaller name space, 0, 1,…, K. To rule out …

We consider the models of distributed computation defined as subsets of the runs of the
iterated immediate snapshot model. Given a task T and a model M, we provide topological …

Failure patterns in modern parallel and distributed system are not necessarily uniform. The
notion of an adversary scheduler is a natural way to extend the classical wait-free and t …

In this paper we develop a novel mathematical formalism for the modeling of neural
information networks endowed with additional structure in the form of assignments of …