3 papers
cs.CR2026
How to reconstruct (anonymously) a secret cellular automaton
Luca Mariot, Federico Mazzone, Luca Manzoni +1
We consider threshold secret sharing schemes based on cellular automata (CA) that allows for anonymous reconstruction, meaning that the secret can be recovered only as a function o…
math.CO2025
Combinatorial Designs and Cellular Automata: A Survey
Luca Manzoni, Luca Mariot, Giuliamaria Menara
Cellular Automata (CA) are commonly investigated as a particular type of dynamical systems, defined by shift-invariant local rules. In this paper, we consider instead CA as algebra…
cs.CC2024
Computing eulerian magnitude homology
Giuliamaria Menara, Luca Manzoni
In this paper tackle the problem of computing the ranks of certain eulerian magnitude homology groups of a graph G. First, we analyze the computational cost of our problem and prov…