Two new algorithms efficiently explore subsets of admissible matrices to generate communication topologies enabling consensus and synchronization in finite-state multi-agent systems.
A programmable galois field processor for the internet of things
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Consensus and Synchronization of Multi-agent Systems over Finite Fields -- Graph Topologies
Two new algorithms efficiently explore subsets of admissible matrices to generate communication topologies enabling consensus and synchronization in finite-state multi-agent systems.