5 citations · 7 across the 5 of their papers we have counts for
7 papers
Properties of k-Descending Trees
Agniv Sarkar, Eric Severson
For any real-valued , we consider the tree rooted at 0, where each positive integer has parent . The average number of children per node is $k…
ppsim: A software package for efficiently simulating and visualizing population protocols
David Doty, Eric Severson
We introduce ppsim, a software package for efficiently simulating population protocols, a widely-studied subclass of chemical reaction networks (CRNs) in which all reactions have t…
A time and space optimal stable population protocol solving exact majority
David Doty, Mahsa Eftekhari, Leszek Gąsieniec +3
We study population protocols, a model of distributed computing appropriate for modeling well-mixed chemical reaction networks and other physical systems where agents exchange info…
A stable majority population protocol using logarithmic time and states
David Doty, Mahsa Eftekhari, Eric Severson
We study population protocols, a model of distributed computing appropriate for modeling well-mixed chemical reaction networks and other physical systems where agents exchange info…
Message complexity of population protocols
Talley Amir, James Aspnes, David Doty +2
The standard population protocol model assumes that when two agents interact, each observes the entire state of the other agent. We initiate the study of $\textit{message complexit…
Time-optimal self-stabilizing leader election in population protocols
Janna Burman, Ho-Lin Chen, Hsueh-Ping Chen +4
We consider the standard population protocol model, where (a priori) indistinguishable and anonymous agents interact in pairs according to uniformly random scheduling. The self-sta…
Composable computation in discrete chemical reaction networks
Eric E. Severson, David Haley, David Doty
We study the composability of discrete chemical reaction networks (CRNs) that stably compute (i.e., with probability 0 of error) integer-valued functions $f:\mathbb{N}^d\to\mathbb{…