( en | de | ru )

 

Disambiguation of "Chatterjee, Krishnendu"

Author of the publication

copydeleteadd this publication to your clipboard
What is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.

, , and . CoRR, (2013)

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

Quantitative stochastic parity games., , and . SODA, page 121-130. SIAM, (2004)Discounting and Averaging in Games across Time scales., and . Int. J. Found. Comput. Sci., 23 (3): 609-625 (2012)Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives., , , and . Formal Methods Syst. Des., 42 (3): 301-327 (2013)Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives., , and . Theor. Comput. Sci., (2015)Quantitative Analysis of Assertion Violations in Probabilistic Programs., , , , and . CoRR, (2020)Stack Size Analysis for Interrupt-Driven Programs., , , , , and . SAS, volume 2694 of Lecture Notes in Computer Science, page 109-126. Springer, (2003)Faster Algorithms for Markov Decision Processes with Low Treewidth., and . CAV, volume 8044 of Lecture Notes in Computer Science, page 543-558. Springer, (2013)Algorithms for algebraic path properties in concurrent systems of constant treewidth components., , , and . POPL, page 733-747. ACM, (2016)Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification., and . SODA, page 1318-1336. SIAM, (2011)The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games., and . SODA, page 1018-1029. SIAM, (2015)