Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

How many bits can a flock of birds compute?

From MaRDI portal
Publication:5497119
Jump to:navigation, search

DOI10.4086/TOC.2014.V010A016zbMATH Open1319.68092OpenAlexW2403365012MaRDI QIDQ5497119FDOQ5497119


Authors: Bernard Chazelle Edit this on Wikidata


Publication date: 3 February 2015

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2014.v010a016




Recommendations

  • The Convergence of Bird Flocking
  • Natural algorithms
  • The geometry of flocking
  • On flocks influenced by closest neighbors
  • Large flocks of small birds: on the minimal size of population protocols


zbMATH Keywords

dynamical systemsnatural algorithmsbird flockingbusy-beaver function


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)


Cites Work

  • Stability of multiagent systems with time-dependent communication links
  • Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory


Cited In (2)

  • The geometry of flocking
  • Natural algorithms

Uses Software

  • Boids





This page was built for publication: How many bits can a flock of birds compute?

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5497119&oldid=30061571"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 March 2024, at 03:08. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki