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.

498 Publications


2015 | Published | Journal Article | IST-REx-ID: 1698 | OA
Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., & Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.001
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Published | Conference Paper | IST-REx-ID: 1609 | OA
Chatterjee, K., Doyen, L., & Vardi, M. (2015). The complexity of synthesis from probabilistic components. In 42nd International Colloquium (Vol. 9135, pp. 108–120). Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47666-6_9
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Published | Conference Paper | IST-REx-ID: 1838 | OA
Bloem, R., Chatterjee, K., Jacobs, S., & Könighofer, R. (2015). Assume-guarantee synthesis for concurrent reactive programs with partial information (Vol. 9035, pp. 517–532). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_50
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Published | Journal Article | IST-REx-ID: 2034 | OA
Bérard, B., Chatterjee, K., & Sznajder, N. (2015). Probabilistic opacity for Markov decision processes. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2014.09.001
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Published | Journal Article | IST-REx-ID: 523 | OA
Chatterjee, K., Doyen, L., Randour, M., & Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.010
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Published | 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
 

2015 | Published | Conference Paper | IST-REx-ID: 10796 | OA
Chatterjee, K., & Ibsen-Jensen, R. (2015). The value 1 problem under finite-memory strategies for concurrent mean-payoff games. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2015, pp. 1018–1029). San Diego, CA, United States: SIAM. https://doi.org/10.1137/1.9781611973730.69
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Published | Conference Paper | IST-REx-ID: 1610 | OA
Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. In 42nd International Colloquium (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47666-6_10
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Published | Conference Paper | IST-REx-ID: 1657 | OA
Chatterjee, K., Komárková, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.32
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2015 | Published | Technical Report | IST-REx-ID: 5435 | OA
Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2015-318-v2-1
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5429 | OA
Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2015-318-v1-1
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5438 | OA
Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-334-v1-1
[Published Version] View | Files available | DOI
 

2015 | Published | Conference Paper | IST-REx-ID: 1656 | OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.72
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Published | Technical Report | IST-REx-ID: 5436 | OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-170-v2-2
[Published Version] View | Files available | DOI
 

2014 | Published | Technical Report | IST-REx-ID: 5419 | OA
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-187-v1-1
[Published Version] View | Files available | DOI
 

2014 | Published | Technical Report | IST-REx-ID: 5420 | OA
Chatterjee, K., & Ibsen-Jensen, R. (2014). The value 1 problem for concurrent mean-payoff games. IST Austria. https://doi.org/10.15479/AT:IST-2014-191-v1-1
[Published Version] View | Files available | DOI
 

2014 | Published | Technical Report | IST-REx-ID: 5421 | OA
Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2014). The complexity of evolution on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-190-v2-2
[Published Version] View | Files available | DOI
 

2014 | Published | Technical Report | IST-REx-ID: 5423 | OA
Chatterjee, K., Kössler, A., Pavlogiannis, A., & Schmid, U. (2014). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria. https://doi.org/10.15479/AT:IST-2014-300-v1-1
[Published Version] View | Files available | DOI
 

2014 | Published | Technical Report | IST-REx-ID: 5427 | OA
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-314-v1-1
[Published Version] View | Files available | DOI
 

2014 | Published | Conference Paper | IST-REx-ID: 1853
Jha, S., Tripakis, S., Seshia, S., & Chatterjee, K. (2014). Game theoretic secure localization in wireless sensor networks (pp. 85–90). Presented at the IOT: Internet of Things, Cambridge, USA: IEEE. https://doi.org/10.1109/IOT.2014.7030120
View | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed