( en | de | ru )

 

Disambiguation of "Thejaswini, K. S."

Author of the publication

copydeleteadd this publication to your clipboard
Adaptive Synchronisation of Pushdown Automata

, and . 32nd International Conference on Concurrency Theory (CONCUR 2021), volume 203 of Leibniz International Proceedings in Informatics (LIPIcs), page 17:1--17:15. Dagstuhl, Germany, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, (2021)
DOI: 10.4230/LIPIcs.CONCUR.2021.17

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 also use the button next to the name to display some publications already assigned to the person.

Thejaswini Halethimmanahally

Chong-hy S k

Han-gil S k

i-s k Pak

n-s k Ch ng

 

Other publications of authors with the same name

Simple and tight complexity lower bounds for solving Rabin games., , , , and . CoRR, (2023)Simple and tight complexity lower bounds for solving Rabin games., , , , and . SOSA, page 160-167. SIAM, (2024)Solving Two-Player Games under Progress Assumptions., , , and . CoRR, (2023)On History-Deterministic One-Counter Nets., and . FoSSaCS, volume 13992 of Lecture Notes in Computer Science, page 218-239. Springer, (2023)Rabin Games and Colourful Universal Trees., , and . TACAS (3), volume 14572 of Lecture Notes in Computer Science, page 213-231. Springer, (2024)On History-Deterministic One-Counter Nets., and . CoRR, (2022)Universal Algorithms for Parity Games and Nested Fixpoints., , and . Principles of Systems Design, volume 13660 of Lecture Notes in Computer Science, page 252-271. Springer, (2022)The Strahler Number of a Parity Game., , and . ICALP, volume 168 of LIPIcs, page 123:1-123:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Solving Two-Player Games Under Progress Assumptions., , , and . VMCAI (1), volume 14499 of Lecture Notes in Computer Science, page 208-231. Springer, (2024)A symmetric attractor-decomposition lifting algorithm for parity games., , , and . CoRR, (2020)