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

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




354 Publications

2018 | Conference Paper | IST-REx-ID: 141 | OA
K. Chatterjee, M. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 143 | OA
T. Brázdil, K. Chatterjee, A. Kučera, P. Novotny, D. Velan, and F. Zuleger, “Efficient algorithms for asymptotic bounds on termination time in VASS,” presented at the LICS: Logic in Computer Science, Oxford, United Kingdom, 2018, vol. F138033, pp. 185–194.
View | DOI | Download Preprint (ext.)
 
2018 | Conference Paper | IST-REx-ID: 325 | OA
S. Agrawal, K. Chatterjee, and P. Novotny, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.
View | DOI | Download Preprint (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 34 | OA
K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.
View | Download Preprint (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 35 | OA
K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in 28th International Conference on Automated Planning and Scheduling , Delft, Netherlands, 2018.
View | Download None (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 25 | OA
K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.
View | DOI | Download Published Version (ext.)
 
2017 | Journal Article | IST-REx-ID: 716 | OA
K. Chatterjee and Y. Velner, “The complexity of mean-payoff pushdown games,” Journal of the ACM, vol. 64, no. 5, p. 34, 2017.
View | DOI | Download Preprint (ext.) | arXiv
 
2017 | Journal Article | IST-REx-ID: 717 | OA
K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” Journal of Computer and System Sciences, vol. 88, pp. 236–259, 2017.
View | Files available | DOI | Download Preprint (ext.)
 
2017 | Journal Article | IST-REx-ID: 719
K. Chatterjee and R. Ehlers, “Special issue: Synthesis and SYNT 2014,” Acta Informatica, vol. 54, no. 6, pp. 543–544, 2017.
View | DOI
 
2017 | Journal Article | IST-REx-ID: 744 | OA
T. Priklopil, K. Chatterjee, and M. Nowak, “Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma,” Journal of Theoretical Biology, vol. 433, pp. 64–72, 2017.
View | Files available | DOI | PubMed | Europe PMC
 
2017 | Journal Article | IST-REx-ID: 464 | OA
K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3, 2017.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 465 | OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3, 2017.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 466 | OA
K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2, 2017.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 467 | OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 2017.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2017 | Journal Article | IST-REx-ID: 512 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1, 2017.
View | Files available | DOI
 
2017 | Technical Report | IST-REx-ID: 5455 | OA
K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.
View | Files available | DOI
 
2017 | Technical Report | IST-REx-ID: 5456 | OA
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 551 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 552 | OA
K. Chatterjee, M. Henzinger, and A. Svozil, “Faster algorithms for mean payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 553 | OA
K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI | Download Published Version (ext.)
 

Search

Display / Sort

Citation Style: IEEE

Export / Embed