scientific article; zbMATH DE number 7651155

DOI10.4230/LIPICS.ESA.2020.16MaRDI QIDQ5874482FDO

Authors

Publication date 7 February 2023

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

zbMATH Keywords

simulationrandom samplingpopulation protocolsdynamic alias table

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

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

Cites work

• scientific article; zbMATH DE number 437561 (Why is no real title available?)
• scientific article; zbMATH DE number 5605125 (Why is no real title available?)
• scientific article; zbMATH DE number 3815002 (Why is no real title available?)
• scientific article; zbMATH DE number 3954145 (Why is no real title available?)
• scientific article; zbMATH DE number 4086850 (Why is no real title available?)
• scientific article; zbMATH DE number 6850453 (Why is no real title available?)
• scientific article; zbMATH DE number 2085207 (Why is no real title available?)
• A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
• A simple population protocol for fast robust approximate majority
• Algorithms – ESA 2004
• An Efficient Method for Generating Discrete Random Variables with General Distributions
• AnO(log^3/2n) Parallel Time Population Protocol for Majority withO(logn) States
• Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process
• Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time
• Computation in networks of passively mobile finite-state sensors
• Computation with finite stochastic chemical reaction networks
• Convergence speed of binary interval consensus
• Determining majority in networks with local interactions and very small local memory
• Fast algorithms for generating discrete random variates with changing distributions
• Fast and exact majority in population protocols
• Fast computation by population protocols with a leader
• Fast space optimal leader election in population protocols
• Generating Markov-Chain Transitions Quickly: I
• Maintaining discrete probability distributions optimally
• Optimal time and space leader election in population protocols
• Parallel Weighted Random Sampling
• Polylogarithmic-time leader election in population protocols
• Recent results in population protocols for exact majority and leader election
• Simple and Efficient Leader Election
• Stably computable predicates are semilinear
• The computational power of population protocols
• Time-space trade-offs in population protocols

Cited in

(5)

• On parallel time in population protocols
• ppsim: a software package for efficiently simulating and visualizing population protocols
• The computational power of population protocols
• Brief Announcement: Fast Graphical Population Protocols
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)

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)