%0 Conference Paper %1 balasubramanian:LIPIcs.FSTTCS.2021.35 %A Balasubramanian, A. R. %B 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021) %C Dagstuhl, Germany %D 2021 %E Bojańczy, Mikołaj %E Chekuri, Chandra %I Schloss Dagstuhl -- Leibniz-Zentrum für Informatik %K conference %P 35:1--35:16 %R 10.4230/LIPIcs.FSTTCS.2021.35 %T Complexity of Coverability in Bounded Path Broadcast Networks %U https://drops.dagstuhl.de/opus/volltexte/2021/15546 %V 213 %Z Keywords: Parameterized verification, Bounded path networks, Fast-growing complexity classes %@ 978-3-95977-215-0

@inproceedings{balasubramanian:LIPIcs.FSTTCS.2021.35, added-at = {2023-09-24T18:48:25.000+0200}, address = {Dagstuhl, Germany}, annote = {Keywords: Parameterized verification, Bounded path networks, Fast-growing complexity classes}, author = {Balasubramanian, A. R.}, biburl = {https://www.bibsonomy.org/bibtex/26ace6497614043ba9731e5a546fc69ba/paves}, booktitle = {41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)}, doi = {10.4230/LIPIcs.FSTTCS.2021.35}, editor = {Boja\'{n}czy, Miko{\l}aj and Chekuri, Chandra}, interhash = {da3f2f656574e220958b03630f94affb}, intrahash = {6ace6497614043ba9731e5a546fc69ba}, isbn = {978-3-95977-215-0}, issn = {1868-8969}, keywords = {conference}, pages = {35:1--35:16}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum für Informatik}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, timestamp = {2023-09-24T18:48:25.000+0200}, title = {{Complexity of Coverability in Bounded Path Broadcast Networks}}, url = {https://drops.dagstuhl.de/opus/volltexte/2021/15546}, urn = {urn:nbn:de:0030-drops-155466}, volume = 213, year = 2021 }