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 | 
K. Chatterjee and L. Doyen, “Perfect-information stochastic games with generalized mean-payoff objectives,” presented at the LICS: Logic in Computer Science, New York, NY, USA, 2016, vol. 05-08-July-2016, pp. 247–256.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Journal Article | IST-REx-ID: 1477 |
K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with ω-regular objectives,” Journal of Computer and System Sciences, vol. 82, no. 5. Elsevier, pp. 878–911, 2016.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Journal Article | IST-REx-ID: 1529 |
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” Artificial Intelligence, vol. 234. Elsevier, pp. 26–48, 2016.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Technical Report | IST-REx-ID: 5445 |
K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural analysis. IST Austria, 2016.
[Published Version]
View
| Files available
| DOI
2016 | Conference Paper | IST-REx-ID: 1166
K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ, USA, 2016, vol. 2016, pp. 3225–3232.
View
| Files available
2016 | Technical Report | IST-REx-ID: 5449 |
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification on undirected population structures: Comets beat stars. IST Austria, 2016.
[Updated Version]
View
| Files available
| DOI
2016 | Technical Report | IST-REx-ID: 5453 |
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
[Published Version]
View
| Files available
| DOI
2016 | Technical Report | IST-REx-ID: 5451 |
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Strong amplifiers of natural selection. IST Austria, 2016.
[Published Version]
View
| Files available
| DOI
2016 | Research Data Reference | IST-REx-ID: 9867
C. Hilbe, K. Hagel, and M. Milinski, “Experimental game instructions.” Public Library of Science, 2016.
[Published Version]
View
| Files available
| DOI
2016 | Journal Article | IST-REx-ID: 1322 |
C. Hilbe, K. Hagel, and M. Milinski, “Asymmetric power boosts extortion in an economic experiment,” PLoS One, vol. 11, no. 10. Public Library of Science, 2016.
[Published Version]
View
| Files available
| DOI
2016 | Research Data Reference | IST-REx-ID: 9868
C. Hilbe, K. Hagel, and M. Milinski, “Experimental data.” Public Library of Science, 2016.
[Published Version]
View
| Files available
| DOI
2016 | Thesis | IST-REx-ID: 1397
M. Chmelik, “Algorithms for partially observable markov decision processes,” Institute of Science and Technology Austria, 2016.
View
2016 | Conference Paper | IST-REx-ID: 1093 |
P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City; Canada, 2016, vol. 59.
[Published Version]
View
| Files available
| DOI
2016 | Conference Paper | IST-REx-ID: 1071 |
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs,” presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
[Published Version]
View
| Files available
| DOI
2016 | Conference Paper | IST-REx-ID: 1438 |
K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 327–342.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Technical Report | IST-REx-ID: 5452 |
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
[Published Version]
View
| Files available
| DOI
2016 | Conference Paper | IST-REx-ID: 1437 |
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Conference Paper | IST-REx-ID: 1386 |
K. Chatterjee, H. Fu, and A. K. Goharshady, “Termination analysis of probabilistic programs through Positivstellensatz’s,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9779, pp. 3–22.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2015 | 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
| arXiv
2015 | Conference Paper | IST-REx-ID: 1499 |
J. Kretinsky, K. Larsen, S. Laursen, and J. Srba, “Polynomial time decidability of weighted synchronization under partial observability,” presented at the CONCUR: Concurrency Theory, Madrid, Spain, 2015, vol. 42, pp. 142–154.
[Published Version]
View
| Files available
| DOI