scientific article; zbMATH DE number 7651155
From MaRDI portal
Publication:5874482
DOI10.4230/LIPIcs.ESA.2020.16MaRDI QIDQ5874482
No author found.
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2005.03584
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
ppsim: a software package for efficiently simulating and visualizing population protocols ⋮ On parallel time in population protocols
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple population protocol for fast robust approximate majority
- Computation with finite stochastic chemical reaction networks
- The computational power of population protocols
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- Fast and Exact Majority in Population Protocols
- Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process
- Convergence Speed of Binary Interval Consensus
- Polylogarithmic-Time Leader Election in Population Protocols
- An Efficient Method for Generating Discrete Random Variables with General Distributions
- Generating Markov-Chain Transitions Quickly: I
- Time-Space Trade-offs in Population Protocols
- Maintaining discrete probability distributions optimally
- Fast algorithms for generating discrete random variates with changing distributions
- Parallel Weighted Random Sampling
- A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States
- Optimal time and space leader election in population protocols
- Determining Majority in Networks with Local Interactions and Very Small Local Memory
- Stably computable predicates are semilinear
- Simple and Efficient Leader Election
- Brief Announcement
- Algorithms – ESA 2004
- AnO(log3/2n) Parallel Time Population Protocol for Majority withO(logn) States
- Stable leader election in population protocols requires linear time
