2 papers
cs.DC2025
Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks
Giuseppe A. Di Luna, Giovanni Viglietta
A communication network is said to be "anonymous" if its agents are indistinguishable from each other; it is "dynamic" if its communication links may appear or disappear unpredicta…
cs.DC2024
History Trees and Their Applications
Giovanni Viglietta
In the theoretical study of distributed communication networks, "history trees" are a discrete structure that naturally models the concept that anonymous agents become distinguisha…