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

In this paper, we weaken the nice condition of an n-dimensional rendezvous task defined in
the work of X. Liu et al [11]. Then we introduce the definition of evolution of non-degenerate …

Loop agreement is a family of distributed tasks that includes set agreement and simplex
agreement, and was used to prove the undecidability of wait-free solvability of distributed …

We consider the problem of fusing measurements in a sensor network, where the sensing
regions overlap and data are nonnegative real numbers, possibly resulting from a count of …

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 …

Loop agreement is a family of wait-free tasks that includes set agreement and simplex
agreement, and was used to prove the undecidability of wait-free solvability of distributed …