( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Polynomial reachability witnesses via Stellensätze.

, , , , и . PLDI, стр. 772-787. ACM, (2021)

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.

Krishnendu Mukherjee

Gudrun Chatterjee

Amitava Chatterjee

Daniel Chatterjee

Indranil Chatterjee

 

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

Quantitative stochastic parity games., , и . SODA, стр. 121-130. SIAM, (2004)Reduction of stochastic parity to stochastic mean-payoff games., и . Inf. Process. Lett., 106 (1): 1-7 (2008)Discounting and Averaging in Games across Time scales., и . Int. J. Found. Comput. Sci., 23 (3): 609-625 (2012)Sensor Synthesis for POMDPs with Reachability Objectives., , и . ICAPS, стр. 47-55. AAAI Press, (2018)Graph Planning with Expected Finite Horizon., и . CoRR, (2018)The Cost of Exactness in Quantitative Reachability., , и . Models, Algorithms, Logics and Tools, том 10460 из Lecture Notes in Computer Science, стр. 367-381. Springer, (2017)The Complexity of Mean-Payoff Pushdown Games., и . J. ACM, 64 (5): 34:1-34:49 (2017)Qualitative concurrent parity games., , и . ACM Trans. Comput. Log., 12 (4): 28:1-28:51 (2011)Quantitative languages., , и . ACM Trans. Comput. Log., 11 (4): 23:1-23:38 (2010)Algorithms for Omega-Regular Games with Imperfect Information, ., , , и . CSL, том 4207 из Lecture Notes in Computer Science, стр. 287-302. Springer, (2006)