scientific article; zbMATH DE number 7651155

DOI10.4230/LIPICS.ESA.2020.16MaRDI QIDQ5874482FDOQ5874482

Authors:

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/2005.03584

Title of this publication is not available (Why is that?)

Recommendations

• The computational power of population protocols
• Time-space trade-offs in population protocols
• Fault-tolerant simulation of population protocols
• ppsim: a software package for efficiently simulating and visualizing population protocols
• scientific article; zbMATH DE number 2009954
• Time and space optimal counting in population protocols
• The Dynamics of Probabilistic Population Protocols
• Population protocols: beyond runtime analysis
• Time-space trade-offs in population protocols for the majority problem
• On parallel time in population protocols

zbMATH Keywords

simulationrandom samplingpopulation protocolsdynamic alias table

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computation in networks of passively mobile finite-state sensors
• Computation with finite stochastic chemical reaction networks
• The computational power of population protocols
• Fast computation by population protocols with a leader
• Title not available (Why is that?)
• Stably computable predicates are semilinear
• A simple population protocol for fast robust approximate majority
• Title not available (Why is that?)
• An Efficient Method for Generating Discrete Random Variables with General Distributions
• Convergence speed of binary interval consensus
• Maintaining discrete probability distributions optimally
• Fast algorithms for generating discrete random variates with changing distributions
• Algorithms – ESA 2004
• Fast and exact majority in population protocols
• Determining majority in networks with local interactions and very small local memory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polylogarithmic-Time Leader Election in Population Protocols
• Stable leader election in population protocols requires linear time
• Generating Markov-Chain Transitions Quickly: I
• Time-Space Trade-offs in Population Protocols
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States
• Brief Announcement
• Optimal time and space leader election in population protocols
• AnO(log^3/2n) Parallel Time Population Protocol for Majority withO(logn) States
• Simple and Efficient Leader Election
• Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process
• Parallel Weighted Random Sampling

Cited In (5)

• Title not available (Why is that?)
• ppsim: a software package for efficiently simulating and visualizing population protocols
• The computational power of population protocols
• Brief Announcement: Fast Graphical Population Protocols
• On parallel time in population protocols

This page was built for publication:

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