Please note that ISTA 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.

459 Publications


2015 | Journal Article | IST-REx-ID: 1598 | OA
K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” Theoretical Computer Science, vol. 573, no. 3. Elsevier, pp. 71–89, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Journal Article | IST-REx-ID: 1731 | OA
K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” Information and Computation, vol. 245, no. 12. Elsevier, pp. 3–16, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 1856 | OA
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” Journal of the ACM, vol. 62, no. 1. ACM, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2015 | Conference Paper | IST-REx-ID: 1661 | OA
K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2015 | Journal Article | IST-REx-ID: 523 | OA
K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 25–52, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2015 | Journal Article | IST-REx-ID: 524 | OA
K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 2–24, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 1481 | OA
U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative starting positions for simple traditional board games,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA, 2015, vol. 2, pp. 745–752.
View | Files available | Download None (ext.)
 

2015 | Conference Paper | IST-REx-ID: 1732 | OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis of POMDPs with temporal logic specifications for robotics applications,” presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States, 2015, pp. 325–330.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Technical Report | IST-REx-ID: 5431 | OA
K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, The patience of concurrent stochastic games with safety and reachability objectives. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1657
K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.
View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1656
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.
View | Files available | DOI | arXiv
 

2015 | Technical Report | IST-REx-ID: 5429 | OA
K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5435 | OA
K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5436 | OA
K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1610 | OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in 42nd International Colloquium, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.
View | Files available | DOI | Download None (ext.) | arXiv
 

2015 | Technical Report | IST-REx-ID: 5437 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5430 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5438 | OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance for pushdown automata. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5440 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5432 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications