| Complexity of verification and synthesis of threshold automata AR Balasubramanian, J Esparza, M Lazić International Symposium on Automated Technology for Verification and …, 2020 | 16 | 2020 |
| Parameterized verification of synchronization in constrained reconfigurable broadcast networks AR Balasubramanian, N Bertrand, N Markey Tools and Algorithms for the Construction and Analysis of Systems: 24th …, 2018 | 13 | 2018 |
| Parameterized analysis of reconfigurable broadcast networks AR Balasubramanian, L Guillou, C Weil-Kennedy International Conference on Foundations of Software Science and Computation …, 2022 | 9 | 2022 |
| Reconfigurable broadcast networks and asynchronous shared-memory systems are equivalent AR Balasubramanian, C Weil-Kennedy arXiv preprint arXiv:2109.08315, 2021 | 9 | 2021 |
| Complexity of controlled bad sequences over finite sets of Nd AR Balasubramanian Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 9 | 2020 |
| Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. AR Balasubramanian, J Esparza, MA Raskin FoSSaCS, 42-61, 2021 | 7 | 2021 |
| Decidability and complexity in weakening and contraction hypersequent substructural logics AR Balasubramanian, T Lang, R Ramanayake 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2021 | 6 | 2021 |
| Parameterized complexity of safety of threshold automata AR Balasubramanian 40th IARCS Annual Conference on Foundations of Software Technology and …, 2020 | 3 | 2020 |
| Reachability in continuous pushdown VASS AR Balasubramanian, R Majumdar, RS Thinniyam, G Zetzsche Proceedings of the ACM on Programming Languages 8 (POPL), 90-114, 2024 | 2 | 2024 |
| Complexity of coverability in depth-bounded processes AR Balasubramanian 33rd International Conference on Concurrency Theory (CONCUR 2022), 2022 | 2 | 2022 |
| Adaptive synchronisation of pushdown automata AR Balasubramanian, KS Thejaswini arXiv preprint arXiv:2102.06897, 2021 | 2 | 2021 |
| Complexity of controlled bad sequences over finite sets of AR Balasubramanian arXiv preprint arXiv:1909.01667, 2019 | 2 | 2019 |
| Generalized threshold arrangements AR Balasubramanian arXiv preprint arXiv:1904.08903, 2019 | 2 | 2019 |
| Decidability and Complexity of Decision Problems for Affine Continuous VASS AR Balasubramanian arXiv preprint arXiv:2405.11085, 2024 | 1 | 2024 |
| Parameterized analysis of reconfigurable broadcast networks (long version) AR Balasubramanian, L Guillou, C Weil-Kennedy arXiv preprint arXiv:2201.10432, 2022 | 1 | 2022 |
| Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version) AR Balasubramanian, C Weil-Kennedy arXiv preprint arXiv:2108.07510, 2021 | 1 | 2021 |
| Complexity of coverability in bounded path broadcast networks AR Balasubramanian 41st IARCS Annual Conference on Foundations of Software Technology and …, 2021 | 1 | 2021 |
| Characterizing consensus in the heard-of model AR Balasubramanian, I Walukiewicz arXiv preprint arXiv:2004.09621, 2020 | 1 | 2020 |
| Parameterized Verification of Coverability in Well-Structured Broadcast Networks AR Balasubramanian arXiv preprint arXiv:1809.03099, 2018 | 1 | 2018 |
| Coefficient Synthesis for Threshold Automata AR Balasubramanian International Conference on Reachability Problems, 125-139, 2022 | | 2022 |
Chana Weil-KennedyIMDEA Software InstituteVerified email at imdea.org