Computation in networks of passively mobile finite-state sensors

Recommendations

Computation in networks of passively mobile finite-state sensors
The computational power of population protocols
Passively mobile communicating machines that use restricted space
Computational models for networks of tiny artifacts: a survey
Verification of population protocols

Cites work

Cited in

(only showing first 100 items - show all)

Distributed transformations of Hamiltonian shapes based on line moves
Distributed transformations of Hamiltonian shapes based on line moves
Stone age distributed computing
Message complexity of population protocols
A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States
Brief Announcement: Population Protocols Decide Double-exponential Thresholds
Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks
Space complexity of self-stabilizing leader election in passively-mobile anonymous agents
Temporal network optimization subject to connectivity constraints
Automatic analysis of expected termination time for population protocols
On space complexity of self-stabilizing leader election in mediated population protocol
The canonical amoebot model: algorithms and concurrency control
Centralised connectivity-preserving transformations by rotation: 3 musketeers for all orthogonal convex shapes
Data collection in population protocols with non-uniformly random scheduler
Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
Reconfigurable broadcast networks and asynchronous shared-memory systems are equivalent
Characterizing topological assumptions of distributed algorithms in dynamic networks
Anonymous asynchronous systems: the case of failure detectors
Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
Speed faults in computation by chemical reaction networks
On space and time complexity of loosely-stabilizing leader election
Privacy in population protocols with probabilistic scheduling
Early adapting to trends: self-stabilizing information spread using passive communication
Advances in parameterized verification of population protocols
Position discovery for a system of bouncing robots
Localization for a system of colliding robots
The complexity of verifying population protocols
How many cooks spoil the soup?
Computing with chemical reaction networks: a tutorial
scientific article; zbMATH DE number 7561458 (Why is no real title available?)
Fault tolerant network constructors
Noidy conmunixatipn: on the convergence of the averaging population protocol
A glimpse at Paul G. Spirakis
On the power of synchronization between two adjacent processes
On convergence and threshold properties of discrete Lotka-Volterra population protocols
On convergence and threshold properties of discrete Lotka-Volterra population protocols
Minimal output unstable configurations in chemical reaction networks and deciders
On geometric shape construction via growth operations
Logarithmic expected-time leader election in population protocol model
Determining majority in networks with local interactions and very small local memory
Time-space trade-offs in population protocols for the majority problem
Verification of Immediate Observation Population Protocols
Computing with biological switches and clocks
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
On parallel time in population protocols
New bounds for the flock-of-birds problem
Population protocols: beyond runtime analysis
Verification of population protocols
Connectivity preserving network transformers
Universal coating for programmable matter
How Many Cooks Spoil the Soup?
Self-stabilizing counting in mobile sensor networks
Tight complexity analysis of population protocols with cover times -- the ZebraNet example
The computational power of simple protocols for self-awareness on graphs
Simple and Efficient Leader Election
Controlling a random population
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
A survey of size counting in population protocols
Connectivity preserving network transformers
Theory of reaction automata: a survey
Computational models for networks of tiny artifacts: a survey
scientific article; zbMATH DE number 7449997 (Why is no real title available?)
Stochastic analysis of average-based distributed algorithms
A self-stabilizing transformer for population protocols with covering
Anonymous and fault-tolerant shared-memory computing
Synthesizing and tuning chemical reaction networks with specified behaviours
Convergecast and broadcast by power-aware mobile agents
The Synergy of Finite State Machines
Passively mobile communicating machines that use restricted space
On geometric shape construction via growth operations
Constructing self-stabilizing oscillators in population protocols
Expressive Power of Broadcast Consensus Protocols
scientific article; zbMATH DE number 7561256 (Why is no real title available?)
Information spreading by mobile particles on a line
Structural Liveness of Immediate Observation Petri Nets
How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
Fault-tolerant simulation of population protocols
A natural adaptive process for collective decision-making
Multi-scale verification of distributed synchronisation
Deterministic function computation with chemical reaction networks
Shortest, fastest, and foremost broadcast in dynamic networks
Pushing lines helps: efficient universal centralised transformations for programmable matter
Fast and succinct population protocols for Presburger arithmetic
The Power of Global Knowledge on Self-stabilizing Population Protocols
Leaderless Deterministic Chemical Reaction Networks
Stably computable predicates are semilinear
Constant-space population protocols for uniform bipartition
Threshold-based network structural dynamics
Threshold-based network structural dynamics
Approximate majority analyses using tri-molecular chemical reaction networks
Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
Leaderless deterministic chemical reaction networks
On gossip and populations
Protocols with constant local storage and unreliable communication
Strand algebras for DNA computing
Traveling salesman problems in temporal graphs
Data Collection in Population Protocols with Non-uniformly Random Scheduler
Distributed computation and reconfiguration in actively dynamic networks
Finding cut-offs in leaderless rendez-vous protocols is easy
Running time analysis of broadcast consensus protocols

Describes a project that uses

Uses Software

This page was built for publication: Computation in networks of passively mobile finite-state sensors

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