A. R. Balasubramanian

According to our database, A. R. Balasubramanian authored at least 20 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Reachability in Continuous Pushdown VASS.

A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche

Proc. ACM Program. Lang., January, 2024

2023

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy.

A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin

Log. Methods Comput. Sci., 2023

2022

Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version).

A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy

CoRR, 2022

Coefficient Synthesis for Threshold Automata.

A. R. Balasubramanian

Proceedings of the Reachability Problems - 16th International Conference, 2022

Parameterized Analysis of Reconfigurable Broadcast Networks.

A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy

Proceedings of the Foundations of Software Science and Computation Structures, 2022

Complexity of Coverability in Depth-Bounded Processes.

A. R. Balasubramanian

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

Parameterized verification of coverability in infinite state broadcast networks.

A. R. Balasubramanian

Inf. Comput., 2021

Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent.

A. R. Balasubramanian, Chana Weil-Kennedy

Proceedings of the Proceedings 12th International Symposium on Games, 2021

Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version).

A. R. Balasubramanian, Chana Weil-Kennedy

CoRR, 2021

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics.

A. R. Balasubramanian, Timo Lang, Revantha Ramanayake

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Complexity of Coverability in Bounded Path Broadcast Networks.

A. R. Balasubramanian

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Adaptive Synchronisation of Pushdown Automata.

A. R. Balasubramanian, K. S. Thejaswini

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

Complexity of controlled bad sequences over finite sets of Nd.

A. R. Balasubramanian

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Parameterized Complexity of Safety of Threshold Automata.

A. R. Balasubramanian

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Characterizing Consensus in the Heard-Of Model.

A. R. Balasubramanian, Igor Walukiewicz

Proceedings of the 31st International Conference on Concurrency Theory, 2020

Complexity of Verification and Synthesis of Threshold Automata.

A. R. Balasubramanian, Javier Esparza, Marijana Lazic

Proceedings of the Automated Technology for Verification and Analysis, 2020

2019

Complexity of controlled bad sequences over finite sets of N^k.

A. R. Balasubramanian

CoRR, 2019

Generalized threshold arrangements.

A. R. Balasubramanian

CoRR, 2019

2018

Parameterized Verification of Coverability in Well-Structured Broadcast Networks.

A. R. Balasubramanian

Proceedings of the Proceedings Ninth International Symposium on Games, 2018

Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks.

A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018