@InProceedings{parzych_et_al:LIPIcs.DISC.2024.35,
author = {Parzych, Garrett and Daymude, Joshua J.},
title = {{Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast}},
booktitle = {38th International Symposium on Distributed Computing (DISC 2024)},
pages = {35:1--35:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-352-2},
ISSN = {1868-8969},
year = {2024},
volume = {319},
editor = {Alistarh, Dan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.35},
URN = {urn:nbn:de:0030-drops-212615},
doi = {10.4230/LIPIcs.DISC.2024.35},
annote = {Keywords: Dynamic networks, anonymity, broadcast, space complexity, lower bounds, termination detection, stabilizing termination}
}