Distributed information processing in biological and computational systems
S Navlakha, Z Bar-Joseph - Communications of the ACM, 2014 - dl.acm.org
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 …
COMMUNICATIONS OF THE ACM | JANUARY 2015 | VOL. 58 | NO. 1 review articles DOI:10.1145/2678280 …
Beeping a maximal independent set
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 …
harsh broadcast model that relies only on carrier sensing. The model consists of an …
Quantum pricing-based column-generation framework for hard combinatorial problems
In this work we present a complete hybrid classical-quantum algorithm involving a quantum
sampler based on neutral-atom platforms. This approach is inspired by classical column …
sampler based on neutral-atom platforms. This approach is inspired by classical column …
Stone age distributed computing
Y Emek, R Wattenhofer - Proceedings of the 2013 ACM symposium on …, 2013 - dl.acm.org
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 …
asynchronous environment is introduced. This model, that can be viewed as a hybrid of the …
Coordinating amoebots via reconfigurable circuits
M Feldmann, A Padalkin, C Scheideler… - Journal of …, 2022 - liebertpub.com
We consider an extension to the geometric amoebot model that allows amoebots to form so-
called circuits. Given a connected amoebot structure, a circuit is a subgraph formed by the …
called circuits. Given a connected amoebot structure, a circuit is a subgraph formed by the …
Exponential separations in the energy complexity of leader election
Energy is often the most constrained resource for battery-powered wireless devices, and
most of the energy is often spent on transceiver usage (ie, transmitting and receiving …
most of the energy is often spent on transceiver usage (ie, transmitting and receiving …
Near optimal leader election in multi-hop radio networks
M Ghaffari, B Haeupler - Proceedings of the twenty-fourth annual ACM-SIAM …, 2013 - SIAM
We design leader election protocols for multi-hop radio networks that elect a leader in
almost the same time TBC that it takes for broadcasting one message (one ID). For the …
almost the same time TBC that it takes for broadcasting one message (one ID). For the …
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on
deterministic distributed algorithms, and we study models of computing that are weaker …
deterministic distributed algorithms, and we study models of computing that are weaker …
A distributed palette sparsification theorem
The celebrated palette sparsification result of [Assadi, Chen, and Khanna SODA'19] shows
that to compute a Δ+ 1 coloring of the graph, where Δ denotes the maximum degree, it …
that to compute a Δ+ 1 coloring of the graph, where Δ denotes the maximum degree, it …
Distributed MIS via all-to-all communication
M Ghaffari - Proceedings of the ACM symposium on principles of …, 2017 - dl.acm.org
Computing a Maximal Independent Set (MIS) is a central problem in distributed graph
algorithms. This paper presents an improved randomized distributed algorithm for …
algorithms. This paper presents an improved randomized distributed algorithm for …