Complexity of Coverability in Bounded Path Broadcast Networks
A. Balasubramanian. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), том 213 из Leibniz International Proceedings in Informatics (LIPIcs), стр. 35:1--35:16. Dagstuhl, Germany, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, (2021)
DOI: 10.4230/LIPIcs.FSTTCS.2021.35
Please choose a person to relate this publication to
To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.
You can add a new person with the name "Balasubramanian, A. R.", or you can "Balasubramanian, A. R." with a person entry that is so far only been referred to by another name (such as a former name or an alias name).
Your choice of the person associated to the publication can be saved in our system, so that no other have to make this choice again. Do you want to save your choice?