Please note that IST Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

355 Publications


2018 | Book Chapter | IST-REx-ID: 86 | OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 143 | OA
Brázdil, T., Chatterjee, K., Kučera, A., Novotny, P., Velan, D., & Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE. https://doi.org/10.1145/3209108.3209191
View | DOI | Download Preprint (ext.)
 

2018 | Conference Paper | IST-REx-ID: 325 | OA
Agrawal, S., Chatterjee, K., & Novotny, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122
View | DOI | Download Preprint (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 34 | OA
Chatterjee, K., Chemlík, M., & Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press.
View | Download Preprint (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 35 | OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.
View | Download None (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 25 | OA
Horák, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/662
View | DOI | Download Published Version (ext.)
 

2018 | Conference Paper | IST-REx-ID: 141 | OA
Chatterjee, K., Henzinger, M., Loitzenbauer, V., Oraee, S., & Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 716 | OA
Chatterjee, K., & Velner, Y. (2017). The complexity of mean-payoff pushdown games. Journal of the ACM, 64(5), 34. https://doi.org/10.1145/3121408
View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 717 | OA
Chatterjee, K., & Velner, Y. (2017). Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences, 88, 236–259. https://doi.org/10.1016/j.jcss.2017.04.005
View | Files available | DOI | Download Preprint (ext.)
 

2017 | Journal Article | IST-REx-ID: 719
Chatterjee, K., & Ehlers, R. (2017). Special issue: Synthesis and SYNT 2014. Acta Informatica, 54(6), 543–544. https://doi.org/10.1007/s00236-017-0299-0
View | DOI
 

2017 | Journal Article | IST-REx-ID: 744 | OA
Priklopil, T., Chatterjee, K., & Nowak, M. (2017). Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology, 433, 64–72. https://doi.org/10.1016/j.jtbi.2017.08.025
View | Files available | DOI | PubMed | Europe PMC
 

2017 | Journal Article | IST-REx-ID: 464 | OA
Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science, 13(3). https://doi.org/10.23638/LMCS-13(3:26)2017
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 465 | OA
Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science, 13(3). https://doi.org/10.23638/LMCS-13(3:23)2017
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 466 | OA
Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science, 13(2). https://doi.org/10.23638/LMCS-13(2:15)2017
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 467 | OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL), 18(4). https://doi.org/10.1145/3152769
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 512 | OA
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports, 7(1). https://doi.org/10.1038/s41598-017-00107-w
View | Files available | DOI
 

2017 | Technical Report | IST-REx-ID: 5455 | OA
Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria. https://doi.org/10.15479/AT:IST-2017-870-v1-1
View | Files available | DOI
 

2017 | Technical Report | IST-REx-ID: 5456 | OA
Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. IST Austria. https://doi.org/10.15479/AT:IST-2017-872-v1-1
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 551 | OA
Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.61
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 552 | OA
Chatterjee, K., Henzinger, M., & Svozil, A. (2017). Faster algorithms for mean payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.39
View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications