%0 Conference Paper %1 conf/fsttcs/Balasubramanian21 %A Balasubramanian, A. R. %B FSTTCS %D 2021 %E Bojanczyk, Mikolaj %E Chekuri, Chandra %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 35:1-35:16 %T Complexity of Coverability in Bounded Path Broadcast Networks. %U http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2021.html#Balasubramanian21 %V 213 %@ 978-3-95977-215-0

@inproceedings{conf/fsttcs/Balasubramanian21, added-at = {2024-08-04T00:00:00.000+0200}, author = {Balasubramanian, A. R.}, biburl = {https://www.bibsonomy.org/bibtex/2d95f0e59bef18d8af030cf45c2e896ab/dblp}, booktitle = {FSTTCS}, crossref = {conf/fsttcs/2021}, editor = {Bojanczyk, Mikolaj and Chekuri, Chandra}, ee = {https://doi.org/10.4230/LIPIcs.FSTTCS.2021.35}, interhash = {da3f2f656574e220958b03630f94affb}, intrahash = {d95f0e59bef18d8af030cf45c2e896ab}, isbn = {978-3-95977-215-0}, keywords = {dblp}, pages = {35:1-35:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-08-26T07:46:23.000+0200}, title = {Complexity of Coverability in Bounded Path Broadcast Networks.}, url = {http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2021.html#Balasubramanian21}, volume = 213, year = 2021 }