3 citations · 7 across the 10 of their papers we have counts for
23 papers
Adaptive Self-Organization in Anonymous Dynamic Networks
Garrett Parzych, Joshua J. Daymude
We introduce the problem of adaptive self-organization in which the nodes of an anonymous, synchronous dynamic network must distributively change the collective distribution of the…
Strategic Analysis of Dissent and Self-Censorship
Joshua J. Daymude, Robert Axelrod, Stephanie Forrest
Expressions of dissent against authority are an important feature of most societies, and efforts to suppress such expressions are common. Modern digital communications, social medi…
Open, Reproducible Calculation of Assembly Indices
Devansh Vimal, Garrett Parzych, Olivia M. Smith +4
We present assembly-theory, a Rust package for computing assembly indices of covalently bonded molecular structures. This is a key complexity measure of assembly theory, a recent t…
On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks
Anya Chaturvedi, Joshua J. Daymude, Andréa W. Richa
Algorithms for mutual exclusion aim to isolate potentially concurrent accesses to the same shared resources. Motivated by distributed computing research on programmable matter and…
Unsupervised Learning of Local Updates for Maximum Independent Set in Dynamic Graphs
Devendra Parkar, Anya Chaturvedi, Joshua J. Daymude
We present the first unsupervised learning model for Maximum-Independent-Set (MaxIS) in dynamic graphs where edges change over time. Our method combines structural learning from gr…
Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast
Garrett Parzych, Joshua J. Daymude
Broadcast is a ubiquitous distributed computing problem that underpins many other system tasks. In static, connected networks, it was recently shown that broadcast is solvable with…