Some lower bounds in dynamic networks with oblivious adversaries
From MaRDI portal
(Redirected from Some lower bounds in dynamic networks with oblivious adversaries)
Some lower bounds in dynamic networks with oblivious adversaries (scientific article; zbMATH DE number 7650037)
Some lower bounds in dynamic networks with oblivious adversaries (scientific article; zbMATH DE number 7650037)
Recommendations
- Some lower bounds in dynamic networks with oblivious adversaries
- Information spreading in dynamic networks under oblivious adversaries
- Lower bounds on information dissemination in dynamic networks
- Lower bounds for dynamic connectivity
- Lower bounds for randomized consensus under a weak adversary
- Lower bounds for randomized consensus under a weak adversary
- Lower bounds on communication overlap of networks
- Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds
Cited in
(2)
This page was built for publication: Some lower bounds in dynamic networks with oblivious adversaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487501)