Natural algorithms

MaRDI QIDQ4633851zbMATH OpenFDO

Authors Bernard Chazelle

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496817

Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01) Ecology (92D40) Animal behavior (92D50)

Recommendations

• The Convergence of Bird Flocking
• How many bits can a flock of birds compute?
• The geometry of flocking
• An algorithmic approach to collective behavior
• On the mathematics of emergence

Cited in

(19)

• Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
• On the emergence of regularities on one-dimensional decreasing sandpiles
• Noisy rumor spreading and plurality consensus
• An algorithmic approach to collective behavior
• The ANTS problem
• \textit{Physarum} can compute shortest paths
• Emergence on decreasing sandpile models
• Leader election and shape formation with self-organizing programmable matter
• The computational beauty of flocking: boids revisited
• scientific article; zbMATH DE number 1131220 (Why is no real title available?)
• Limits for rumor spreading in stochastic populations
• Amortized Analysis of Asynchronous Price Dynamics
• A Survey on Analog Models of Computation
• On the Algorithmic Power of Spiking Neural Networks
• Mathematical Foundations of Nature-Inspired Algorithms
• How many bits can a flock of birds compute?
• \textit{Physarum} can compute shortest paths
• On the use of naturality in algorithmic resolution
• Process algebras and flocks of birds

This page was built for publication: Natural algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633851)