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)

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
Uniform bipartition in the population protocol model with arbitrary graphs
Wait-free solvability of colorless tasks in anonymous shared-memory model
A calculus for collective-adaptive systems and its behavioural theory
Pushing lines helps: efficient universal centralised transformations for programmable matter
Mediated population protocols
A combinatorial characterization of self-stabilizing population protocols
Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures
A simple population protocol for fast robust approximate majority
On the transformation capability of feasible mechanisms for programmable matter
Leader election and shape formation with self-organizing programmable matter
Loosely-stabilizing leader election with polylogarithmic convergence time
Loosely-stabilizing leader election in population protocol model
Polylogarithmic-time leader election in population protocols
Mediated population protocols: leader election and applications
Consensus in anonymous asynchronous systems with crash-recovery and omission failures
The complexity of optimal design of temporally connected graphs
Causality, influence, and computation in possibly disconnected synchronous dynamic networks
Composable computation in discrete chemical reaction networks
A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
Loosely-stabilizing leader election in a population protocol model
Leader election requires logarithmic time in population protocols
Distributed patrolling with two-speed robots (and an application to transportation)
Search by a metamorphic robotic system in a finite 2D square grid
Simple and fast approximate counting and leader election in populations
ppsim: a software package for efficiently simulating and visualizing population protocols
Population protocols with unreliable communication
scientific article; zbMATH DE number 7651155 (Why is no real title available?)
Robustness of expressivity in chemical reaction networks
Space-efficient self-stabilizing counting population protocols on mobile sensor networks
On verifying and maintaining connectivity of interval temporal networks
scientific article; zbMATH DE number 7561451 (Why is no real title available?)
Computing in social networks
Parameterized analysis of reconfigurable broadcast networks
Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
Computation in networks of passively mobile finite-state sensors
Improved Leader Election for Self-organizing Programmable Matter
The computational power of population protocols
Fault tolerant network constructors
Stateless computation
Terminating distributed construction of shapes and patterns in a fair solution of automata
Clocked population protocols
scientific article; zbMATH DE number 7559466 (Why is no real title available?)
An introduction to temporal graphs: an algorithmic perspective
How many ants does it take to find the food?
Network Constructors: A Model for Programmable Matter
An introduction to temporal graphs: an algorithmic perspective
Fast computation by population protocols with a leader
Effective storage capacity of labeled graphs
Simulating and model checking membrane systems using strategies in Maude
Survivability of bouncing robots
Recent Advances in Population 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)