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
2016 | Conference Paper | IST-REx-ID: 480 | 
Chatterjee, K., & Doyen, L. (2016). Perfect-information stochastic games with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934513
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Journal Article | IST-REx-ID: 1477 |
Chatterjee, K., Chmelik, M., & Tracol, M. (2016). What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2016.02.009
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Journal Article | IST-REx-ID: 1529 |
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2016.01.007
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Technical Report | IST-REx-ID: 5445 |
Chatterjee, K., Pavlogiannis, A., & Velner, Y. (2016). Quantitative interprocedural analysis. IST Austria. https://doi.org/10.15479/AT:IST-2016-523-v1-1
[Published Version]
View
| Files available
| DOI
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee, K., Chmelik, M., & Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.
View
| Files available
2016 | Technical Report | IST-REx-ID: 5449 |
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Amplification on undirected population structures: Comets beat stars. IST Austria. https://doi.org/10.15479/AT:IST-2016-648-v1-1
[Updated Version]
View
| Files available
| DOI
2016 | Technical Report | IST-REx-ID: 5453 |
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-749-v3-1
[Published Version]
View
| Files available
| DOI
2016 | Technical Report | IST-REx-ID: 5451 |
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2016-728-v1-1
[Published Version]
View
| Files available
| DOI
2016 | Research Data Reference | IST-REx-ID: 9867
Hilbe, C., Hagel, K., & Milinski, M. (2016). Experimental game instructions. Public Library of Science. https://doi.org/10.1371/journal.pone.0163867.s008
[Published Version]
View
| Files available
| DOI
2016 | Journal Article | IST-REx-ID: 1322 |
Hilbe, C., Hagel, K., & Milinski, M. (2016). Asymmetric power boosts extortion in an economic experiment. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0163867
[Published Version]
View
| Files available
| DOI
2016 | Research Data Reference | IST-REx-ID: 9868
Hilbe, C., Hagel, K., & Milinski, M. (2016). Experimental data. Public Library of Science. https://doi.org/10.1371/journal.pone.0163867.s009
[Published Version]
View
| Files available
| DOI
2016 | Thesis | IST-REx-ID: 1397
Chmelik, M. (2016). Algorithms for partially observable markov decision processes. Institute of Science and Technology Austria.
View
2016 | Conference Paper | IST-REx-ID: 1093 |
Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2016). Linear distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2016.20
[Published Version]
View
| Files available
| DOI
2016 | Conference Paper | IST-REx-ID: 1071 |
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs (Vol. 57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ESA.2016.28
[Published Version]
View
| Files available
| DOI
2016 | Conference Paper | IST-REx-ID: 1438 |
Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837639
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Technical Report | IST-REx-ID: 5452 |
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-728-v2-1
[Published Version]
View
| Files available
| DOI
2016 | Conference Paper | IST-REx-ID: 1437 |
Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837624
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Conference Paper | IST-REx-ID: 1386 |
Chatterjee, K., Fu, H., & Goharshady, A. K. (2016). Termination analysis of probabilistic programs through Positivstellensatz’s (Vol. 9779, pp. 3–22). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. https://doi.org/10.1007/978-3-319-41528-4_1
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2015 | Conference Paper | IST-REx-ID: 10796
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
| arXiv
2015 | Conference Paper | IST-REx-ID: 1499 |
Kretinsky, J., Larsen, K., Laursen, S., & Srba, J. (2015). Polynomial time decidability of weighted synchronization under partial observability (Vol. 42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142
[Published Version]
View
| Files available
| DOI