A faster counting protocol for anonymous dynamic networks
From MaRDI portal
Recommendations
- A faster exact-counting protocol for anonymous dynamic networks
- Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
- Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
- Polynomial anonymous dynamic distributed computing without a unique leader
- Naming and counting in anonymous unknown dynamic networks
Cited in
(12)- A faster exact-counting protocol for anonymous dynamic networks
- Controller and estimator for dynamic networks
- A distributed counting architecture for exploring the structure of anonymous active-passive networks
- Polynomial anonymous dynamic distributed computing without a unique leader
- Computing in dynamic networks
- Naming and counting in anonymous unknown dynamic networks
- Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
- Polynomial anonymous dynamic distributed computing without a unique leader
- Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
- Non trivial computations in anonymous dynamic networks
- Controller and estimator for dynamic networks
- Anonymous adversarial dynamic networks with logarithmic memory and communication
This page was built for publication: A faster counting protocol for anonymous dynamic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363819)