A note on relative neighborhood graphs
SCG '87 Proceedings of the third annual symposium on Computational geometry
A fully pipelined minimum-spanning-tree constructor
Journal of Parallel and Distributed Computing
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
Journal of the ACM (JACM)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing in nonlinear media and automata collectives
Computing in nonlinear media and automata collectives
Collision-based computing
Reference machines require non-linear time to maintain disjoint sets
Reference machines require non-linear time to maintain disjoint sets
Reaction-Diffusion Computers
Robot control: from silicon circuitry to cells
BioADIT'06 Proceedings of the Second international conference on Biologically Inspired Approaches to Advanced Information Technology
Fault tolerant network design inspired by Physarum polycephalum
Natural Computing: an international journal
| Hi-index | 0.00 |
We experimentally demonstrate that computation of spanning trees and implementation of general purpose storage-modification machines can be executed by a vegetative state of the slime mold Physarum polycephalum. We advance theory and practice of reaction-diffusion computing by studying a biological model of reaction-diffusion encapsulated in a membrane.