scientific article
From MaRDI portal
Publication:3396623
zbMath1169.68326MaRDI QIDQ3396623
Publication date: 19 September 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (41)
Distributed computation and reconfiguration in actively dynamic networks ⋮ Deterministic function computation with chemical reaction networks ⋮ Amorphous computing: examples, mathematics and theory ⋮ Population protocols with faulty interactions: the impact of a leader ⋮ On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols ⋮ Simple and fast approximate counting and leader election in populations ⋮ Recent Advances in Population Protocols ⋮ A simple population protocol for fast robust approximate majority ⋮ The computational power of simple protocols for self-awareness on graphs ⋮ Unnamed Item ⋮ Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication ⋮ Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony ⋮ On space complexity of self-stabilizing leader election in mediated population protocol ⋮ Computing with chemical reaction networks: a tutorial ⋮ Unnamed Item ⋮ Passively mobile communicating machines that use restricted space ⋮ Computational models for networks of tiny artifacts: a survey ⋮ Fault-tolerant simulation of population protocols ⋮ On the power of synchronization between two adjacent processes ⋮ Running time analysis of broadcast consensus protocols ⋮ How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model ⋮ Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits ⋮ Mediated population protocols ⋮ Unnamed Item ⋮ Time-space trade-offs in population protocols for the majority problem ⋮ Homonym population protocols ⋮ Connectivity Preserving Network Transformers ⋮ Dynamic networks of finite state machines ⋮ Space-efficient self-stabilizing counting population protocols on mobile sensor networks ⋮ Minimal output unstable configurations in chemical reaction networks and deciders ⋮ Probability 1 computation with chemical reaction networks ⋮ A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States ⋮ Noisy rumor spreading and plurality consensus ⋮ How Many Cooks Spoil the Soup? ⋮ On the convergence of population protocols when population goes to infinity ⋮ On Gossip and Populations ⋮ Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents ⋮ How many cooks spoil the soup? ⋮ On parallel time in population protocols ⋮ New bounds for the flock-of-birds problem ⋮ A Survey on Analog Models of Computation
This page was built for publication:
