Some lower bounds in dynamic networks with oblivious adversaries

DOI10.4230/LIPICS.DISC.2017.29MaRDI QIDQ6487501zbMATH OpenFDO

Authors Irvan Jahja, Haifeng Yu, Yuda Zhao

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.DISC.2017.29

zbMATH Keywords

adaptive adversarycommunication complexitydynamic networkslower boundsoblivious adversary

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11) Graph theory (including graph drawing) in computer science (68R10)

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)

• Some lower bounds in dynamic networks with oblivious adversaries
• The cost of unknown diameter in dynamic networks

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)