A biological solution to a fundamental distributed computing problem
From MaRDI portal
Recommendations
- Simple neural-like P systems for maximal independent set selection
- Feedback from nature, an optimal distributed algorithm for \textsc{Maximal Independent Set} selection
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
- scientific article; zbMATH DE number 2018605
- Solving maximum independent set by asynchronous distributed hopfield-type neural networks
Cited in
(37)- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- Near-optimal clustering in the \(k\)-machine model
- Noisy beeping networks
- The epigenetic consensus problem
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence
- Noisy rumor spreading and plurality consensus
- An algorithmic approach to collective behavior
- Fixed points in conjunctive networks and maximal independent sets in graph contractions
- The ANTS problem
- Searching without communicating: tradeoffs between performance and selection complexity
- A biologically motivated solution to the cocktail party problem
- An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models
- A neural algorithm for a fundamental computing problem
- Limits for rumor spreading in stochastic populations
- The Synergy of Finite State Machines
- Find Your Place: Simple Distributed Algorithms for Community Detection
- Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
- Simple neural-like P systems for maximal independent set selection
- Threshold-based network structural dynamics
- Threshold-based network structural dynamics
- Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models
- Optimal Message-Passing with Noisy Beeps
- Distributed Self-Stabilizing MIS with Few States and Weak Communication
- On bioelectric algorithms
- The hardness of local certification of finite-state dynamics
- Quasi-majority functional voting on expander graphs
- Quasi-majority functional voting on expander graphs
- On the limits of information spread by memory-less agents
- Self-stabilizing MIS computation in the beeping model
- Optimal message-passing with noisy beeps
- Brief announcement: Self-stabilizing MIS computation in the beeping model
- Generalising the maximum independent set algorithm via Boolean networks
- Beeping deterministic congest algorithms in graphs
- Multistate network model for the pathfinding problem with a self-recovery property
This page was built for publication: A biological solution to a fundamental distributed computing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3101797)
