30 Publications

Mark all

[30]
2020 | Conference Paper | IST-REx-ID: 8193
Chatterjee, Krishnendu, Martin Chmelik, Deep Karkhanis, Petr Novotný, and Amélie Royer. “Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.” In Proceedings of the 30th International Conference on Automated Planning and Scheduling, 30:48–56. Association for the Advancement of Artificial Intelligence, 2020.
View | Files available
 
[29]
2017 | Journal Article | IST-REx-ID: 1407 | OA
Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid Systems. Elsevier, 2017. https://doi.org/10.1016/j.nahs.2016.04.006.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[28]
2016 | Conference Paper | IST-REx-ID: 1324
Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, 2016–January:88–96. AAAI Press, 2016.
View | Download None (ext.)
 
[27]
2016 | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, and Petr Novotný. “Stochastic Shortest Path with Energy Constraints in POMDPs.” In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, 1465–66. ACM, 2016.
[Preprint] View | Download Preprint (ext.)
 
[26]
2016 | Journal Article | IST-REx-ID: 1518 | OA
Lohse, Konrad, Martin Chmelik, Simon Martin, and Nicholas H Barton. “Efficient Strategies for Calculating Blockwise Likelihoods under the Coalescent.” Genetics. Genetics Society of America, 2016. https://doi.org/10.1534/genetics.115.183814.
[Preprint] View | Files available | DOI | PubMed | Europe PMC
 
[25]
2016 | Journal Article | IST-REx-ID: 1477 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.” Journal of Computer and System Sciences. Elsevier, 2016. https://doi.org/10.1016/j.jcss.2016.02.009.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[24]
2016 | Journal Article | IST-REx-ID: 1529 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” Artificial Intelligence. Elsevier, 2016. https://doi.org/10.1016/j.artint.2016.01.007.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[23]
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016:3225–32. AAAI Press, 2016.
View | Files available
 
[22]
2016 | Thesis | IST-REx-ID: 1397
Chmelik, Martin. “Algorithms for Partially Observable Markov Decision Processes.” Institute of Science and Technology Austria, 2016.
View
 
[21]
2015 | Conference Paper | IST-REx-ID: 1691
Svoreňová, Mária, Martin Chmelik, Kevin Leahy, Hasan Eniser, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Motion Planning Using POMDPs with Parity Objectives: Case Study Paper.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 233–38. ACM, 2015. https://doi.org/10.1145/2728606.2728617.
View | DOI
 
[20]
2015 | Conference Paper | IST-REx-ID: 1820 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , 5:3496–3502. AAAI Press, 2015.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[19]
2015 | Journal Article | IST-REx-ID: 1873 | OA
Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.” Artificial Intelligence. Elsevier, 2015. https://doi.org/10.1016/j.artint.2014.12.009.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[18]
2015 | Conference Paper | IST-REx-ID: 1732 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications,” 325–30. IEEE, 2015. https://doi.org/10.1109/ICRA.2015.7139019.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[17]
2015 | Technical Report | IST-REx-ID: 5443 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-325-v2-1.
[Published Version] View | Files available | DOI
 
[16]
2015 | Journal Article | IST-REx-ID: 1501 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.” Formal Methods in System Design. Springer, 2015. https://doi.org/10.1007/s10703-015-0235-2.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[15]
2015 | Conference Paper | IST-REx-ID: 1689 | OA
Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 259–68. ACM, 2015. https://doi.org/10.1145/2728606.2728608.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[14]
2015 | Conference Paper | IST-REx-ID: 1603 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in Markov Decision Processes,” 9206:158–77. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_10.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[13]
2014 | Conference Paper | IST-REx-ID: 2027 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Vojtěch Forejt, Jan Kretinsky, Marta Kwiatkowska, David Parker, and Mateusz Ujma. “Verification of Markov Decision Processes Using Learning Algorithms.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, 8837:98–114. Society of Industrial and Applied Mathematics, 2014. https://doi.org/10.1007/978-3-319-11936-6_8.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[12]
2014 | Journal Article | IST-REx-ID: 1733 | OA
Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” Theoretical Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.08.019.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[11]
2014 | Technical Report | IST-REx-ID: 5413 | OA
Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v2-2.
[Published Version] View | Files available | DOI
 
[10]
2014 | Technical Report | IST-REx-ID: 5414 | OA
Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v3-1.
[Published Version] View | Files available | DOI
 
[9]
2014 | Technical Report | IST-REx-ID: 5412 | OA
Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v1-1.
[Published Version] View | Files available | DOI
 
[8]
2014 | Technical Report | IST-REx-ID: 5424 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v1-1.
[Published Version] View | Files available | DOI
 
[7]
2014 | Technical Report | IST-REx-ID: 5426 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v2-1.
[Published Version] View | Files available | DOI
 
[6]
2014 | Conference Paper | IST-REx-ID: 2063
Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,” 8559:473–90. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_31.
View | Files available | DOI
 
[5]
2013 | Conference Paper | IST-REx-ID: 2886 | OA
Chmelik, Martin, and Vojtěch Řehák. “Controllable-Choice Message Sequence Graphs.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-36046-6_12.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[4]
2013 | Conference Paper | IST-REx-ID: 2295 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.165.
[Published Version] View | Files available | DOI
 
[3]
2013 | Technical Report | IST-REx-ID: 5400 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-109-v1-1.
[Published Version] View | Files available | DOI
 
[2]
2012 | Conference Paper | IST-REx-ID: 2916 | OA
Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” In Electronic Proceedings in Theoretical Computer Science, 96:29–42. EPTCS, 2012. https://doi.org/10.4204/EPTCS.96.3.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[1]
2012 | Conference Paper | IST-REx-ID: 2947 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Ritankar Majumdar. “Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games,” 7561:385–99. Springer, 2012. https://doi.org/10.1007/978-3-642-33386-6_30.
[Preprint] View | DOI | Download Preprint (ext.)
 

Search

Filter Publications

30 Publications

Mark all

[30]
2020 | Conference Paper | IST-REx-ID: 8193
Chatterjee, Krishnendu, Martin Chmelik, Deep Karkhanis, Petr Novotný, and Amélie Royer. “Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.” In Proceedings of the 30th International Conference on Automated Planning and Scheduling, 30:48–56. Association for the Advancement of Artificial Intelligence, 2020.
View | Files available
 
[29]
2017 | Journal Article | IST-REx-ID: 1407 | OA
Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid Systems. Elsevier, 2017. https://doi.org/10.1016/j.nahs.2016.04.006.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[28]
2016 | Conference Paper | IST-REx-ID: 1324
Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, 2016–January:88–96. AAAI Press, 2016.
View | Download None (ext.)
 
[27]
2016 | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, and Petr Novotný. “Stochastic Shortest Path with Energy Constraints in POMDPs.” In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, 1465–66. ACM, 2016.
[Preprint] View | Download Preprint (ext.)
 
[26]
2016 | Journal Article | IST-REx-ID: 1518 | OA
Lohse, Konrad, Martin Chmelik, Simon Martin, and Nicholas H Barton. “Efficient Strategies for Calculating Blockwise Likelihoods under the Coalescent.” Genetics. Genetics Society of America, 2016. https://doi.org/10.1534/genetics.115.183814.
[Preprint] View | Files available | DOI | PubMed | Europe PMC
 
[25]
2016 | Journal Article | IST-REx-ID: 1477 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.” Journal of Computer and System Sciences. Elsevier, 2016. https://doi.org/10.1016/j.jcss.2016.02.009.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[24]
2016 | Journal Article | IST-REx-ID: 1529 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” Artificial Intelligence. Elsevier, 2016. https://doi.org/10.1016/j.artint.2016.01.007.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[23]
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016:3225–32. AAAI Press, 2016.
View | Files available
 
[22]
2016 | Thesis | IST-REx-ID: 1397
Chmelik, Martin. “Algorithms for Partially Observable Markov Decision Processes.” Institute of Science and Technology Austria, 2016.
View
 
[21]
2015 | Conference Paper | IST-REx-ID: 1691
Svoreňová, Mária, Martin Chmelik, Kevin Leahy, Hasan Eniser, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Motion Planning Using POMDPs with Parity Objectives: Case Study Paper.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 233–38. ACM, 2015. https://doi.org/10.1145/2728606.2728617.
View | DOI
 
[20]
2015 | Conference Paper | IST-REx-ID: 1820 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , 5:3496–3502. AAAI Press, 2015.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[19]
2015 | Journal Article | IST-REx-ID: 1873 | OA
Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.” Artificial Intelligence. Elsevier, 2015. https://doi.org/10.1016/j.artint.2014.12.009.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[18]
2015 | Conference Paper | IST-REx-ID: 1732 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications,” 325–30. IEEE, 2015. https://doi.org/10.1109/ICRA.2015.7139019.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[17]
2015 | Technical Report | IST-REx-ID: 5443 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-325-v2-1.
[Published Version] View | Files available | DOI
 
[16]
2015 | Journal Article | IST-REx-ID: 1501 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.” Formal Methods in System Design. Springer, 2015. https://doi.org/10.1007/s10703-015-0235-2.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[15]
2015 | Conference Paper | IST-REx-ID: 1689 | OA
Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 259–68. ACM, 2015. https://doi.org/10.1145/2728606.2728608.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[14]
2015 | Conference Paper | IST-REx-ID: 1603 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in Markov Decision Processes,” 9206:158–77. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_10.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[13]
2014 | Conference Paper | IST-REx-ID: 2027 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Vojtěch Forejt, Jan Kretinsky, Marta Kwiatkowska, David Parker, and Mateusz Ujma. “Verification of Markov Decision Processes Using Learning Algorithms.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, 8837:98–114. Society of Industrial and Applied Mathematics, 2014. https://doi.org/10.1007/978-3-319-11936-6_8.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[12]
2014 | Journal Article | IST-REx-ID: 1733 | OA
Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” Theoretical Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.08.019.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[11]
2014 | Technical Report | IST-REx-ID: 5413 | OA
Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v2-2.
[Published Version] View | Files available | DOI
 
[10]
2014 | Technical Report | IST-REx-ID: 5414 | OA
Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v3-1.
[Published Version] View | Files available | DOI
 
[9]
2014 | Technical Report | IST-REx-ID: 5412 | OA
Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v1-1.
[Published Version] View | Files available | DOI
 
[8]
2014 | Technical Report | IST-REx-ID: 5424 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v1-1.
[Published Version] View | Files available | DOI
 
[7]
2014 | Technical Report | IST-REx-ID: 5426 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v2-1.
[Published Version] View | Files available | DOI
 
[6]
2014 | Conference Paper | IST-REx-ID: 2063
Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,” 8559:473–90. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_31.
View | Files available | DOI
 
[5]
2013 | Conference Paper | IST-REx-ID: 2886 | OA
Chmelik, Martin, and Vojtěch Řehák. “Controllable-Choice Message Sequence Graphs.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-36046-6_12.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[4]
2013 | Conference Paper | IST-REx-ID: 2295 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.165.
[Published Version] View | Files available | DOI
 
[3]
2013 | Technical Report | IST-REx-ID: 5400 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-109-v1-1.
[Published Version] View | Files available | DOI
 
[2]
2012 | Conference Paper | IST-REx-ID: 2916 | OA
Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” In Electronic Proceedings in Theoretical Computer Science, 96:29–42. EPTCS, 2012. https://doi.org/10.4204/EPTCS.96.3.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[1]
2012 | Conference Paper | IST-REx-ID: 2947 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Ritankar Majumdar. “Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games,” 7561:385–99. Springer, 2012. https://doi.org/10.1007/978-3-642-33386-6_30.
[Preprint] View | DOI | Download Preprint (ext.)
 

Search

Filter Publications