( en | de | ru )

 

Disambiguation of "Chatterjee, Krishnendu"

Author of the publication

copydeleteadd this publication to your clipboard
Proving Expected Sensitivity of Probabilistic Programs with Randomized Execution Time.

, , , , and . CoRR, (2019)

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.

Krishnendu Mukherjee

Gudrun Chatterjee

Amitava Chatterjee

Daniel Chatterjee

Indranil Chatterjee

 

Other publications of authors with the same name

Stack Size Analysis for Interrupt-Driven Programs., , , , , and . SAS, volume 2694 of Lecture Notes in Computer Science, page 109-126. Springer, (2003)Limits on amplifiers of natural selection under death-Birth updating., , , and . PLoS Comput. Biol., (2020)Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time., , , , and . Proc. ACM Program. Lang., 4 (POPL): 25:1-25:30 (2020)Modular verification for almost-sure termination of probabilistic programs., , , and . Proc. ACM Program. Lang., 3 (OOPSLA): 129:1-129:29 (2019)The reads-from equivalence for the TSO and PSO memory models., , , , and . Proc. ACM Program. Lang., 5 (OOPSLA): 1-30 (2021)Data-centric dynamic partial order reduction., , , , and . Proc. ACM Program. Lang., 2 (POPL): 31:1-31:30 (2018)Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs., , and . Proc. ACM Program. Lang., 2 (POPL): 34:1-34:32 (2018)Sensor Synthesis for POMDPs with Reachability Objectives., , and . ICAPS, page 47-55. AAAI Press, (2018)Robustness of Structurally Equivalent Concurrent Parity Games. CoRR, (2011)Decidable Problems for Probabilistic Automata on Infinite Words, and . CoRR, (2011)