Pages that link to "Item:Q5501509"
From MaRDI portal
The following pages link to Computation in networks of passively mobile finite-state sensors (Q5501509):
Displayed 44 items.
- The computational power of simple protocols for self-awareness on graphs (Q392008) (← links)
- Computational models for networks of tiny artifacts: a survey (Q465666) (← links)
- Verification of population protocols (Q523133) (← links)
- On the number of binary-minded individuals required to compute \(\sqrt {\frac 12}\) (Q533865) (← links)
- Mediated population protocols (Q533894) (← links)
- A self-stabilizing transformer for population protocols with covering (Q555304) (← links)
- Homonym population protocols (Q722223) (← links)
- On the convergence of population protocols when population goes to infinity (Q1036527) (← links)
- The computational power of population protocols (Q1954251) (← links)
- Time-space trade-offs in population protocols for the majority problem (Q2025852) (← links)
- The complexity of verifying population protocols (Q2025857) (← links)
- Towards efficient verification of population protocols (Q2058386) (← links)
- How many cooks spoil the soup? (Q2075625) (← links)
- Flat Petri nets (invited talk) (Q2117150) (← links)
- A counter abstraction technique for verifying properties of probabilistic swarm systems (Q2124442) (← links)
- Population protocols with unreliable communication (Q2148893) (← links)
- Data collection in population protocols with non-uniformly random scheduler (Q2285150) (← links)
- Fast computation by population protocols with a leader (Q2377254) (← links)
- Advances in parameterized verification of population protocols (Q2399358) (← links)
- Agreeing within a few writes (Q2672593) (← links)
- Population protocols: beyond runtime analysis (Q2695486) (← links)
- Protocols with constant local storage and unreliable communication (Q2699979) (← links)
- Reachability Problems for Continuous Chemical Reaction Networks (Q2819133) (← links)
- Recent Advances in Population Protocols (Q3182913) (← links)
- Plane formation by synchronous mobile robots without chirality (Q3300811) (← links)
- (Q3304110) (← links)
- (Q3385654) (← links)
- The Dynamics of Probabilistic Population Protocols (Q3540255) (← links)
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem (Q3540388) (← links)
- Verification of Immediate Observation Population Protocols (Q5009448) (← links)
- Automatic Analysis of Expected Termination Time for Population Protocols (Q5009451) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- Data Collection in Population Protocols with Non-uniformly Random Scheduler (Q5056046) (← links)
- (Q5089274) (← links)
- (Q5111624) (← links)
- Constructing Self-stabilizing Oscillators in Population Protocols (Q5207913) (← links)
- (Q5227517) (← links)
- Expressive Power of Broadcast Consensus Protocols (Q5875393) (← links)
- Lower bounds on the state complexity of population protocols (Q6096031) (← links)
- Sharp Thresholds in Random Simple Temporal Graphs (Q6131198) (← links)
- Fast and succinct population protocols for Presburger arithmetic (Q6142599) (← links)
- Parameterized Analysis of Immediate Observation Petri Nets (Q6144223) (← links)
- Brief Announcement: Population Protocols Decide Double-exponential Thresholds (Q6202218) (← links)
- Improved Tradeoffs for Leader Election (Q6202275) (← links)