Martin Chmelik

Chatterjee Group

30 Publications

Mark all

[30]
2020 | Conference Paper | IST-REx-ID: 8193
Chatterjee, K., Chmelik, M., Karkhanis, D., Novotný, P., & Royer, A. (2020). Multiple-environment Markov decision processes: Efficient analysis and applications. In Proceedings of the 30th International Conference on Automated Planning and Scheduling (Vol. 30, pp. 48–56). Nancy, France: Association for the Advancement of Artificial Intelligence.
View | Files available
 
[29]
2017 | Journal Article | IST-REx-ID: 1407 | OA
Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier. 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, K., & Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling (Vol. 2016–January, pp. 88–96). London, United Kingdom: AAAI Press.
View | Download None (ext.)
 
[27]
2016 | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., & Novotný, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 1465–1466). Singapore: ACM.
[Preprint] View | Download Preprint (ext.)
 
[26]
2016 | Journal Article | IST-REx-ID: 1518 | OA
Lohse, K., Chmelik, M., Martin, S., & Barton, N. H. (2016). Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. Genetics Society of America. 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, K., Chmelik, M., & Tracol, M. (2016). What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. Elsevier. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. Elsevier. 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, K., Chmelik, M., & Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.
View | Files available
 
[22]
2016 | Thesis | IST-REx-ID: 1397
Chmelik, M. (2016). Algorithms for partially observable markov decision processes. Institute of Science and Technology Austria.
View
 
[21]
2015 | Conference Paper | IST-REx-ID: 1691
Svoreňová, M., Chmelik, M., Leahy, K., Eniser, H., Chatterjee, K., Cěrná, I., & Belta, C. (2015). 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 (pp. 233–238). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728617
View | DOI
 
[20]
2015 | Conference Paper | IST-REx-ID: 1820 | OA
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Optimal cost almost-sure reachability in POMDPs. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3496–3502). Austin, TX, USA: AAAI Press.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[19]
2015 | Journal Article | IST-REx-ID: 1873 | OA
Chatterjee, K., & Chmelik, M. (2015). POMDPs under probabilistic semantics. Artificial Intelligence. Elsevier. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE. 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, K., Chmelik, M., & Davies, J. (2015). A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria. 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, K., Chmelik, M., & Daca, P. (2015). CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. Springer. 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., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2015). 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 (pp. 259–268). Seattle, WA, United States: ACM. 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, T., Chatterjee, K., Chmelik, M., Fellner, A., & Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. 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, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez & J.-F. Raskin (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 98–114). Sydney, Australia: Society of Industrial and Applied Mathematics. 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, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science. Elsevier. 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, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. 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, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. 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, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. 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, K., Chmelik, M., & Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. 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, M., & Řehák, V. (2013). Controllable-choice message sequence graphs. Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Znojmo, Czech Republic: Springer. 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, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with ω-regular objectives. IST Austria. 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, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2012). Interface Simulation Distances. In Electronic Proceedings in Theoretical Computer Science (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. 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, K., Chmelik, M., & Majumdar, R. (2012). Equivalence of games with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399). Presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India: Springer. https://doi.org/10.1007/978-3-642-33386-6_30
[Preprint] View | DOI | Download Preprint (ext.)
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: APA

    Export / Embed

30 Publications

Mark all

[30]
2020 | Conference Paper | IST-REx-ID: 8193
Chatterjee, K., Chmelik, M., Karkhanis, D., Novotný, P., & Royer, A. (2020). Multiple-environment Markov decision processes: Efficient analysis and applications. In Proceedings of the 30th International Conference on Automated Planning and Scheduling (Vol. 30, pp. 48–56). Nancy, France: Association for the Advancement of Artificial Intelligence.
View | Files available
 
[29]
2017 | Journal Article | IST-REx-ID: 1407 | OA
Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier. 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, K., & Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling (Vol. 2016–January, pp. 88–96). London, United Kingdom: AAAI Press.
View | Download None (ext.)
 
[27]
2016 | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., & Novotný, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 1465–1466). Singapore: ACM.
[Preprint] View | Download Preprint (ext.)
 
[26]
2016 | Journal Article | IST-REx-ID: 1518 | OA
Lohse, K., Chmelik, M., Martin, S., & Barton, N. H. (2016). Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. Genetics Society of America. 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, K., Chmelik, M., & Tracol, M. (2016). What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. Elsevier. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. Elsevier. 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, K., Chmelik, M., & Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.
View | Files available
 
[22]
2016 | Thesis | IST-REx-ID: 1397
Chmelik, M. (2016). Algorithms for partially observable markov decision processes. Institute of Science and Technology Austria.
View
 
[21]
2015 | Conference Paper | IST-REx-ID: 1691
Svoreňová, M., Chmelik, M., Leahy, K., Eniser, H., Chatterjee, K., Cěrná, I., & Belta, C. (2015). 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 (pp. 233–238). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728617
View | DOI
 
[20]
2015 | Conference Paper | IST-REx-ID: 1820 | OA
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Optimal cost almost-sure reachability in POMDPs. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3496–3502). Austin, TX, USA: AAAI Press.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[19]
2015 | Journal Article | IST-REx-ID: 1873 | OA
Chatterjee, K., & Chmelik, M. (2015). POMDPs under probabilistic semantics. Artificial Intelligence. Elsevier. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE. 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, K., Chmelik, M., & Davies, J. (2015). A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria. 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, K., Chmelik, M., & Daca, P. (2015). CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. Springer. 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., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2015). 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 (pp. 259–268). Seattle, WA, United States: ACM. 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, T., Chatterjee, K., Chmelik, M., Fellner, A., & Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. 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, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez & J.-F. Raskin (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 98–114). Sydney, Australia: Society of Industrial and Applied Mathematics. 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, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science. Elsevier. 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, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. 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, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. 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, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. 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, K., Chmelik, M., & Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. 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, M., & Řehák, V. (2013). Controllable-choice message sequence graphs. Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Znojmo, Czech Republic: Springer. 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, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with ω-regular objectives. IST Austria. 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, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2012). Interface Simulation Distances. In Electronic Proceedings in Theoretical Computer Science (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. 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, K., Chmelik, M., & Majumdar, R. (2012). Equivalence of games with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399). Presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India: Springer. https://doi.org/10.1007/978-3-642-33386-6_30
[Preprint] View | DOI | Download Preprint (ext.)
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: APA

    Export / Embed