( en | de | ru )

 

Disambiguation of "Chadha, Rohit"

Author of the publication

copydeleteadd this publication to your clipboard
Towards a Domain-Agnostic Knowledge Graph-as-a-Service Infrastructure for Active Cyber Defense with Intelligent Agents.

, , , , , , , , , , , , , , , , , , , , , , , , and . AIPR, page 1-8. IEEE, (2023)

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.

Rohit Sinha

Rohit Gupta

Rohit Ghai

Rohit Soni

Rohit Datta

 

Other publications of authors with the same name

Reasoning About States of Probabilistic Sequential Programs., , and . CSL, volume 4207 of Lecture Notes in Computer Science, page 240-255. Springer, (2006)Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability., , , and . ACM Trans. Comput. Log., 21 (1): 2:1-2:44 (2020)Exact quantitative probabilistic model checking through rational search., , , , and . FMCAD, page 92-99. IEEE, (2017)Contract signing, optimism, and advantage., , , and . J. Log. Algebraic Methods Program., 64 (2): 189-218 (2005)Deciding accuracy of differential privacy schemes., , , , and . Proc. ACM Program. Lang., 5 (POPL): 1-30 (2021)Enhancing Computing Curricular Outcomes and Student Accomplishments Through Collegiate Competitions., , , , , and . CompEd (1), page 22-28. ACM, (2023)Stack-Aware Hyperproperties., , , and . TACAS (1), volume 13993 of Lecture Notes in Computer Science, page 308-325. Springer, (2023)Model Checking Concurrent Programs with Nondeterminism and Randomization., , and . FSTTCS, volume 8 of LIPIcs, page 364-375. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)The Complexity of Quantitative Information Flow in Recursive Programs., and . FSTTCS, volume 18 of LIPIcs, page 534-545. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Deciding branching time properties for asynchronous programs., and . Theor. Comput. Sci., 410 (42): 4169-4179 (2009)