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.
527 Publications
2015 |
Published |
Journal Article |
IST-REx-ID: 523 |
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.)
| WoS
| arXiv
2015 |
Published |
Journal Article |
IST-REx-ID: 524 |
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.)
| WoS
| arXiv
earlier version | 2015 |
Published |
Technical Report |
IST-REx-ID: 5429 |
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
earlier version | 2015 |
Published |
Technical Report |
IST-REx-ID: 5430 |
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 |
Published |
Technical Report |
IST-REx-ID: 5431 |
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
earlier version | 2015 |
Published |
Technical Report |
IST-REx-ID: 5432 |
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
earlier version | 2015 |
Published |
Technical Report |
IST-REx-ID: 5435 |
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
earlier version | 2015 |
Published |
Technical Report |
IST-REx-ID: 5436 |
K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
earlier version | 2015 |
Published |
Technical Report |
IST-REx-ID: 5437 |
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
earlier version | 2015 |
Published |
Technical Report |
IST-REx-ID: 5438 |
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 |
Published |
Technical Report |
IST-REx-ID: 5440 |
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
earlier version | 2015 |
Published |
Technical Report |
IST-REx-ID: 5441 |
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
earlier version | 2015 |
Published |
Technical Report |
IST-REx-ID: 5443 |
K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |
Published |
Technical Report |
IST-REx-ID: 5444 |
J. Reiter et al., Reconstructing robust phylogenies of metastatic cancers. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |
Research Data |
IST-REx-ID: 5549 |
A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |
Published |
Journal Article |
IST-REx-ID: 2034 |
B. Bérard, K. Chatterjee, and N. Sznajder, “Probabilistic opacity for Markov decision processes,” Information Processing Letters, vol. 115, no. 1. Elsevier, pp. 52–59, 2015.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2015 |
Published |
Conference Paper |
IST-REx-ID: 10796 |
K. Chatterjee and R. Ibsen-Jensen, “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, San Diego, CA, United States, 2015, vol. 2015, no. 1, pp. 1018–1029.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 |
Published |
Journal Article |
IST-REx-ID: 1731 |
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.)
| WoS
| arXiv
2015 |
Published |
Conference Paper |
IST-REx-ID: 1732 |
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
earlier version | 2015 |
Published |
Conference Paper |
IST-REx-ID: 1820 |
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , Austin, TX, USA, 2015, vol. 5, pp. 3496–3502.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| WoS
| arXiv