23 citations · 42 across the 19 of their papers we have counts for
21 papers
Privacy in Population Protocols with Probabilistic Scheduling
Talley Amir, James Aspnes
The population protocol model introduced by Angluin et al. in 2006 offers a theoretical framework for designing and analyzing distributed algorithms among limited-resource mobile a…
Fast Convergence of -Opinion Undecided State Dynamics in the Population Protocol Model
Talley Amir, James Aspnes, Petra Berenbrink +4
We analyze the convergence of the -opinion Undecided State Dynamics (USD) in the population protocol model. For =2 opinions it is well known that the USD reaches consensus wi…
Approximate Majority With Catalytic Inputs
Talley Amir, James Aspnes, John Lazarsfeld
Population protocols are a class of algorithms for modeling distributed computation in networks of finite-state agents communicating through pairwise interactions. Their suitabilit…
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…
Notes on Theory of Distributed Systems
James Aspnes
Notes for the Yale course CPSC 465/565 Theory of Distributed Systems. Table of Contents: 1 Introduction, 2 Model, 3 Broadcast and convergecast, 4 Distributed breadth-first search,…
Why Extension-Based Proofs Fail
Dan Alistarh, James Aspnes, Faith Ellen +2
We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using pro…