The complexity of many biological, social and technological systems stems from the richness
of the interactions among their units. Over the past decades, a variety of complex systems …

Fault-Tolerant Message-Passing Distributed Systems Page 1 Michel Raynal Fault-Tolerant
Message-Passing Distributed Systems An Algorithmic Approach Page 2 Fault-Tolerant …

From the winner of the Turing Award and the Abel Prize, an introduction to computational
complexity theory, its connections and interactions with mathematics, and its central role in …

Fascinating links between the semantics of concurrent programs and algebraic topology
have been discovered and developed since the 1990s, motivated by the hope that each field …

We study the problem of solving consensus in synchronous directed dynamic networks, in
which communication is controlled by an oblivious message adversary that picks the …

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 …

review articles Page 1 90 COMMUNICATIONS OF THE ACM | MAY 2020 | VOL. 63 | NO. 5
review articles The properties commonly ascribed to any object are, in last analysis, names for …

Tasks and objects are two predominant ways of specifying distributed problems where
processes should compute outputs based on their inputs. Roughly speaking, a task …

Causal broadcast is a communication abstraction built on top of point-to-point send/receive
networks that ensures that any two messages whose broadcasts are causally related (as …

We investigate the distributed complexity of maximal matching and maximal independent set
(MIS) in hypergraphs in the LOCAL model. A maximal matching of a hypergraph H=(VH, EH) …