Feedback from nature

DOI10.1145/2484239.2484247zbMath1323.68560arXiv1211.0235OpenAlexW2158711252MaRDI QIDQ5176090

Lei Xu, Peter G. Jeavons, Alexander D. Scott

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.0235

zbMATH Keywords

feedbackexpected complexityrandomised algorithmsmessage complexityintercellular signallingbeeping modelmis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Cell biology (92C37) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (8)

Design patterns in beeping algorithms: examples, emulation, and analysis ⋮ Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds ⋮ Counting in one-hop beeping networks ⋮ Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge ⋮ Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring ⋮ Unnamed Item ⋮ The k-Observer Problem on d-regular Graphs ⋮ Dynamic networks of finite state machines

This page was built for publication: Feedback from nature