Symmetry-breaking problems are among the most well studied in the field of distributed
computing and yet the most fundamental questions about their complexity remain open. In …

Distributed information processing in biological and computational systems Page 1 94
COMMUNICATIONS OF THE ACM | JANUARY 2015 | VOL. 58 | NO. 1 review articles DOI:10.1145/2678280 …

We consider the problem of computing a maximal independent set (MIS) in an extremely
harsh broadcast model that relies only on carrier sensing. The model consists of an …

A new model that depicts a network of randomized finite state machines operating in an
asynchronous environment is introduced. This model, that can be viewed as a hybrid of the …

To support analytics on massive graphs such as online social networks, RDF, Semantic
Web, etc. many new graph algorithms are designed to query graphs for a specific problem …

In this paper we present efficient distributed algorithms for classical symmetry breaking
problems, maximal independent sets (MIS) and ruling sets, in power graphs. We work in the …

Finding a maximal independent set (MIS) in a graph is a cornerstone task in distributed
computing. The local nature of an MIS allows for fast solutions in a static distributed setting …

In this paper, we study distributed graph algorithms in networks in which the nodes have a
limited communication capacity. Many distributed systems are built on top of an underlying …

The prevailing issue in multi-hop wireless networking is interference management, which
militates against the efficiency of traditional routing and scheduling algorithms. We develop …

Biological sequence families contain many sequences that are very similar to each other
because they are related by evolution, so the strategy for splitting data into separate training …