Computation in networks of passively mobile finite-state sensors
From MaRDI portal
Publication:2375293
DOI10.1007/S00446-005-0138-3zbMATH Open1266.68042DBLPjournals/dc/AngluinADFP06OpenAlexW2706788079WikidataQ62472222 ScholiaQ62472222MaRDI QIDQ2375293FDOQ2375293
Authors: Dana Angluin, James Aspnes, Zoë Diamadi, Michael Fischer 
Publication date: 13 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-005-0138-3
Recommendations
mobile agentdiffuse computationfinite-state agentintermittent communicationstable computationsensor net
Cites Work
- Title not available (Why is that?)
- Catalytic P systems, semilinear sets, and vector addition systems
- Semigroups, Presburger formulas, and languages
- On Context-Free Languages
- The chemical abstract machine
- On Communicating Finite-State Machines
- Nondeterministic Space is Closed under Complementation
- Title not available (Why is that?)
- The mathematics of language
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Theory of reaction automata: a survey
- Expressive Power of Broadcast Consensus Protocols
- Constructing self-stabilizing oscillators in population protocols
- Fault-tolerant simulation of population protocols
- Multi-scale verification of distributed synchronisation
- Shortest, fastest, and foremost broadcast in dynamic networks
- Approximate majority analyses using tri-molecular chemical reaction networks
- Constant-space population protocols for uniform bipartition
- On gossip and populations
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- Leaderless deterministic chemical reaction networks
- 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
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- A combinatorial characterization of self-stabilizing population protocols
- A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
- The complexity of optimal design of temporally connected graphs
- Consensus in anonymous asynchronous systems with crash-recovery and omission failures
- Leader election requires logarithmic time in population protocols
- 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
- Title not available (Why is that?)
- Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
- Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
- Improved Leader Election for Self-organizing Programmable Matter
- Clocked population protocols
- Simulating and model checking membrane systems using strategies in Maude
- Survivability of bouncing robots
- Message complexity of population protocols
- Automatic analysis of expected termination time for population protocols
- On space complexity of self-stabilizing leader election in mediated population protocol
- Data collection in population protocols with non-uniformly random scheduler
- On space and time complexity of loosely-stabilizing leader election
- Advances in parameterized verification of population protocols
- The complexity of verifying population protocols
- How many cooks spoil the soup?
- Computing with chemical reaction networks: a tutorial
- Minimal output unstable configurations in chemical reaction networks and deciders
- Verification of Immediate Observation Population Protocols
- Computing with biological switches and clocks
- Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
- Population protocols: beyond runtime analysis
- On parallel time in population protocols
- New bounds for the flock-of-birds problem
- Simple and Efficient Leader Election
- How Many Cooks Spoil the Soup?
- Controlling a random population
- Stochastic analysis of average-based distributed algorithms
- Tight complexity analysis of population protocols with cover times -- the ZebraNet example
- The computational power of simple protocols for self-awareness on graphs
- A survey of size counting in population protocols
- Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
- Computational models for networks of tiny artifacts: a survey
- Anonymous and fault-tolerant shared-memory computing
- Synthesizing and tuning chemical reaction networks with specified behaviours
- A self-stabilizing transformer for population protocols with covering
- Convergecast and broadcast by power-aware mobile agents
- Passively mobile communicating machines that use restricted space
- Information spreading by mobile particles on a line
- How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
- Leaderless Deterministic Chemical Reaction Networks
- Stably computable predicates are semilinear
- Deterministic function computation with chemical reaction networks
- Protocols with constant local storage and unreliable communication
- Strand algebras for DNA computing
- Traveling salesman problems in temporal graphs
- A calculus for collective-adaptive systems and its behavioural theory
- Mediated population protocols
- Leader election and shape formation with self-organizing programmable matter
- On the transformation capability of feasible mechanisms for programmable matter
- A simple population protocol for fast robust approximate majority
- 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
- Composable computation in discrete chemical reaction networks
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- Distributed patrolling with two-speed robots (and an application to transportation)
- Loosely-stabilizing leader election in a population protocol model
- Population protocols with unreliable communication
- Robustness of expressivity in chemical reaction networks
- Space-efficient self-stabilizing counting population protocols on mobile sensor networks
- Title not available (Why is that?)
- Computation in networks of passively mobile finite-state sensors
- Computing in social networks
- Fault tolerant network constructors
- The computational power of population protocols
- Terminating distributed construction of shapes and patterns in a fair solution of automata
- Title not available (Why is that?)
- An introduction to temporal graphs: an algorithmic perspective
- An introduction to temporal graphs: an algorithmic perspective
- How many ants does it take to find the food?
- Fast computation by population protocols with a leader
- Effective storage capacity of labeled graphs
- Stone age distributed computing
- Recent Advances in Population Protocols
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)
