default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDA. R. Balasubramanian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]A. R. Balasubramanian
, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Reachability in Continuous Pushdown VASS. Proc. ACM Program. Lang. 8(POPL): 90-114 (2024)- [c15]A. R. Balasubramanian:
Decidability and Complexity of Decision Problems for Affine Continuous VASS. LICS 2024: 7:1-7:13 - [i14]A. R. Balasubramanian:
Decidability and Complexity of Decision Problems for Affine Continuous VASS. CoRR abs/2405.11085 (2024) - 2023
- [j2]A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin:
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. Log. Methods Comput. Sci. 19(4) (2023) - [i13]A. R. Balasubramanian:
Coefficient Synthesis for Threshold Automata. CoRR abs/2304.08917 (2023) - [i12]A. R. Balasubramanian:
Parameterized Verification of Coverability in Infinite State Broadcast Networks. CoRR abs/2304.13065 (2023) - [i11]A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Reachability in Continuous Pushdown VASS. CoRR abs/2310.16798 (2023) - 2022
- [c14]A. R. Balasubramanian:
Complexity of Coverability in Depth-Bounded Processes. CONCUR 2022: 17:1-17:19 - [c13]A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy:
Parameterized Analysis of Reconfigurable Broadcast Networks. FoSSaCS 2022: 61-80 - [c12]A. R. Balasubramanian:
Coefficient Synthesis for Threshold Automata. RP 2022: 125-139 - [i10]A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy:
Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version). CoRR abs/2201.10432 (2022) - 2021
- [j1]A. R. Balasubramanian:
Parameterized verification of coverability in infinite state broadcast networks. Inf. Comput. 278: 104592 (2021) - [c11]A. R. Balasubramanian, K. S. Thejaswini:
Adaptive Synchronisation of Pushdown Automata. CONCUR 2021: 17:1-17:15 - [c10]A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin:
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. FoSSaCS 2021: 42-61 - [c9]A. R. Balasubramanian:
Complexity of Coverability in Bounded Path Broadcast Networks. FSTTCS 2021: 35:1-35:16 - [c8]A. R. Balasubramanian, Timo Lang, Revantha Ramanayake:
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics. LICS 2021: 1-13 - [c7]A. R. Balasubramanian, Chana Weil-Kennedy:
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent. GandALF 2021: 18-34 - [i9]A. R. Balasubramanian, K. S. Thejaswini:
Adaptive Synchronisation of Pushdown Automata. CoRR abs/2102.06897 (2021) - [i8]A. R. Balasubramanian, Timo Lang, Revantha Ramanayake:
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics. CoRR abs/2104.09716 (2021) - [i7]A. R. Balasubramanian, Chana Weil-Kennedy:
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version). CoRR abs/2108.07510 (2021) - 2020
- [c6]A. R. Balasubramanian, Javier Esparza, Marijana Lazic:
Complexity of Verification and Synthesis of Threshold Automata. ATVA 2020: 144-160 - [c5]A. R. Balasubramanian, Igor Walukiewicz:
Characterizing Consensus in the Heard-Of Model. CONCUR 2020: 9:1-9:18 - [c4]A. R. Balasubramanian:
Parameterized Complexity of Safety of Threshold Automata. FSTTCS 2020: 37:1-37:15 - [c3]A. R. Balasubramanian:
Complexity of controlled bad sequences over finite sets of Nd. LICS 2020: 130-140 - [i6]A. R. Balasubramanian, Igor Walukiewicz:
Characterizing consensus in the Heard-Of model. CoRR abs/2004.09621 (2020) - [i5]A. R. Balasubramanian, Javier Esparza, Marijana Lazic:
Complexity of Verification and Synthesis of Threshold Automata. CoRR abs/2007.06248 (2020) - [i4]A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin:
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. CoRR abs/2010.09471 (2020)
2010 – 2019
- 2019
- [i3]A. R. Balasubramanian:
Generalized threshold arrangements. CoRR abs/1904.08903 (2019) - [i2]A. R. Balasubramanian:
Complexity of controlled bad sequences over finite sets of Nk. CoRR abs/1909.01667 (2019) - 2018
- [c2]A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey:
Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks. TACAS (2) 2018: 38-54 - [c1]A. R. Balasubramanian:
Parameterized Verification of Coverability in Well-Structured Broadcast Networks. GandALF 2018: 133-146 - [i1]A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey:
Parameterized verification of synchronization in constrained reconfigurable broadcast networks. CoRR abs/1802.08469 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-07 22:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
