Algorithms in nature: the convergence of systems biology and computational thinking
S Navlakha, Z Bar‐Joseph - Molecular systems biology, 2011 - embopress.org
Computer science and biology have enjoyed a long and fruitful relationship for decades.
Biologists rely on computational methods to analyze and integrate large data sets, while …
Biologists rely on computational methods to analyze and integrate large data sets, while …
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 …
Theoretical distributed computing meets biology: A review
O Feinerman, A Korman - International Conference on Distributed …, 2013 - Springer
In recent years, several works have demonstrated how the study of biology can benefit from
an algorithmic perspective. Since biological systems are often distributed in nature, this …
an algorithmic perspective. Since biological systems are often distributed in nature, this …
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 …
Engineering quantum states with neutral atoms
Aquila, an analog quantum simulation platform developed by QuEra Computing, supports
control of the position and coherent evolution of up to 256 neutral atoms. This study details …
control of the position and coherent evolution of up to 256 neutral atoms. This study details …
Many sequential iterative algorithms can be parallel and (nearly) work-efficient
Some recent papers showed that many sequential iterative algorithms can be directly
parallelized, by identifying the dependences between the input objects. This approach …
parallelized, by identifying the dependences between the input objects. This approach …
Rounds vs. Communication Tradeoffs for Maximal Independent Sets
We consider the problem of finding a maximal independent set (MIS) in the shared
blackboard communication model with vertex-partitioned inputs. There are players …
blackboard communication model with vertex-partitioned inputs. There are players …
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 …
Sleeping is Efficient: MIS in O(1)-rounds Node-averaged Awake Complexity
Maximal Independent Set (MIS) is one of the fundamental problems in distributed
computing. The round (time) complexity of distributed MIS has traditionally focused on the …
computing. The round (time) complexity of distributed MIS has traditionally focused on the …
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 …