( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Complexity of Coverability in Depth-Bounded Processes.

. CONCUR, том 243 из LIPIcs, стр. 17:1-17:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

R. A. A. Bowler

Padmanabhan Balasubramanian

Balasubramanian Ramani

Bharat Balasubramanian

Muthuswami Balasubramanian

 

Другие публикации лиц с тем же именем

Parameterized verification of coverability in infinite state broadcast networks.. Inf. Comput., (2021)Decidability and Complexity of Decision Problems for Affine Continuous VASS.. LICS, стр. 7:1-7:13. ACM, (2024)Adaptive Synchronisation of Pushdown Automata., и . CONCUR, том 203 из LIPIcs, стр. 17:1-17:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Generalized threshold arrangements.. CoRR, (2019)Complexity of controlled bad sequences over finite sets of Nd.. LICS, стр. 130-140. ACM, (2020)Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy., , и . FoSSaCS, том 12650 из Lecture Notes in Computer Science, стр. 42-61. Springer, (2021)Parameterized Analysis of Reconfigurable Broadcast Networks., , и . FoSSaCS, том 13242 из Lecture Notes in Computer Science, стр. 61-80. Springer, (2022)Reachability in Continuous Pushdown VASS., , , и . CoRR, (2023)Complexity of Verification and Synthesis of Threshold Automata., , и . CoRR, (2020)https://arxiv.org/abs/2007.06248.Coefficient Synthesis for Threshold Automata.. RP, том 13608 из Lecture Notes in Computer Science, стр. 125-139. Springer, (2022)