136 citations · 330 across the 24 of their papers we have counts for
24 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…
A Taxonomy and Comparative Analysis of IPv4 Identifier Selection Correctness, Security, and Performance
Joshua J. Daymude, Antonio M. Espinoza, Holly Bergen +3
The battle for a more secure Internet is waged on many fronts, including the most basic of networking protocols. Our focus is the IPv4 Identifier (IPID), an IPv4 header field as ol…
Evolving Collective Behavior in Self-Organizing Particle Systems
Devendra Parkar, Kirtus G. Leyba, Raylene A. Faerber +1
Local interactions drive emergent collective behavior, which pervades biological and social complex systems. But uncovering the interactions that produce a desired behavior remains…
Energy-Constrained Programmable Matter Under Unfair Adversaries
Jamison W. Weber, Tishya Chhabra, Andréa W. Richa +1
Individual modules of programmable matter participate in their system's collective behavior by expending energy to perform actions. However, not all modules may have access to the…
Asynchronous Deterministic Leader Election in Three-Dimensional Programmable Matter
Joseph L. Briones, Tishya Chhabra, Joshua J. Daymude +1
Over three decades of scientific endeavors to realize programmable matter, a substance that can change its physical properties based on user input or responses to its environment,…
Cutting Through the Noise to Infer Autonomous System Topology
Kirtus G. Leyba, Joshua J. Daymude, Jean-Gabriel Young +3
The Border Gateway Protocol (BGP) is a distributed protocol that manages interdomain routing without requiring a centralized record of which autonomous systems (ASes) connect to wh…
Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems
Joshua J. Daymude, Andréa W. Richa, Christian Scheideler
Mutual exclusion is a classical problem in distributed computing that provides isolation among concurrent action executions that may require access to the same shared resources. In…
Deadlock and Noise in Self-Organized Aggregation Without Computation
Joshua J. Daymude, Noble C. Harasha, Andréa W. Richa +1
Aggregation is a fundamental behavior for swarm robotics that requires a system to gather together in a compact, connected cluster. In 2014, Gauci et al. proposed a surprising algo…
The Canonical Amoebot Model: Algorithms and Concurrency Control
Joshua J. Daymude, Andréa W. Richa, Christian Scheideler
The amoebot model abstracts active programmable matter as a collection of simple computational elements called amoebots that interact locally to collectively achieve tasks of coord…
Preventing Extreme Polarization of Political Attitudes
Robert Axelrod, Joshua J. Daymude, Stephanie Forrest
Extreme polarization can undermine democracy by making compromise impossible and transforming politics into a zero-sum game. Ideological polarization - the extent to which politica…
Programming Active Cohesive Granular Matter with Mechanically Induced Phase Changes
Shengkai Li, Bahnisikha Dutta, Sarah Cannon +6
Active matter physics and swarm robotics have provided powerful tools for the study and control of ensembles driven by internal sources. At the macroscale, controlling swarms typic…
Bio-Inspired Energy Distribution for Programmable Matter
Joshua J. Daymude, Andréa W. Richa, Jamison W. Weber
In systems of active programmable matter, individual modules require a constant supply of energy to participate in the system's collective behavior. These systems are often powered…
Simulation of Programmable Matter Systems Using Active Tile-Based Self-Assembly
John Calvin Alumbaugh, Joshua J. Daymude, Erik D. Demaine +2
Self-assembly refers to the process by which small, simple components mix and combine to form complex structures using only local interactions. Designed as a hybrid between tile as…
Convex Hull Formation for Programmable Matter
Joshua J. Daymude, Robert Gmyr, Kristian Hinnenthal +3
We envision programmable matter as a system of nano-scale agents (called particles) with very limited computational capabilities that move and compute collectively to achieve a des…
A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems
Sarah Cannon, Joshua J. Daymude, Cem Gokmen +2
We present and rigorously analyze the behavior of a distributed, stochastic algorithm for separation and integration in self-organizing particle systems, an abstraction of programm…
Phototactic Supersmarticles
Sarah Cannon, Joshua J. Daymude, William Savoie +5
Smarticles, or smart active particles, are small robots equipped with only basic movement and sensing abilities that are incapable of rotating or displacing individually. We study…
A Stochastic Approach to Shortcut Bridging in Programmable Matter
Marta Andrés Arroyo, Sarah Cannon, Joshua J. Daymude +2
In a self-organizing particle system, an abstraction of programmable matter, simple computational elements called particles with limited memory and communication self-organize to s…
Improved Leader Election for Self-Organizing Programmable Matter
Joshua J. Daymude, Robert Gmyr, Andrea W. Richa +2
We consider programmable matter that consists of computationally limited devices (called particles) that are able to self-organize in order to achieve some collective goal without…
A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems
Sarah Cannon, Joshua J. Daymude, Dana Randall +1
In systems of programmable matter, we are given a collection of simple computation elements (or particles) with limited (constant-size) memory. We are interested in when they can s…