Chatterjee K, Doyen L. 2016. Perfect-information stochastic games with generalized mean-payoff objectives. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, vol. 05-08-July-2016, 247–256.
LibreCat: https://research-explorer.ista.ac.at/record/480
DOI: 10.1145/2933575.2934513

Chatterjee K, Chmelik M, Tracol M. 2016. What is decidable about partially observable Markov decision processes with <9-regular objectives. Journal of Computer and System Sciences. 82(5), 878–911.
LibreCat: https://research-explorer.ista.ac.at/record/1477
DOI: 10.1016/j.jcss.2016.02.009
arXiv: 1309.2802

Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2016. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 234, 26–48.
LibreCat: https://research-explorer.ista.ac.at/record/1529
DOI: 10.1016/j.artint.2016.01.007
arXiv: 1411.3880

Chatterjee K, Pavlogiannis A, Velner Y. 2016. Quantitative interprocedural analysis, IST Austria, 33p.
LibreCat: https://research-explorer.ista.ac.at/record/5445
DOI: 10.15479/AT:IST-2016-523-v1-1

Chatterjee K, Chmelik M, Davies J. 2016. A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2016, 3225–3232.
LibreCat: https://research-explorer.ista.ac.at/record/1166

Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Amplification on undirected population structures: Comets beat stars, IST Austria, 22p.
LibreCat: https://research-explorer.ista.ac.at/record/5449
DOI: 10.15479/AT:IST-2016-648-v1-1

Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 34p.
LibreCat: https://research-explorer.ista.ac.at/record/5453
DOI: 10.15479/AT:IST-2017-749-v3-1

Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Strong amplifiers of natural selection, IST Austria, 34p.
LibreCat: https://research-explorer.ista.ac.at/record/5451
DOI: 10.15479/AT:IST-2016-728-v1-1

Hilbe C, Hagel K, Milinski M. 2016. Experimental game instructions, Public Library of Science,10.1371/journal.pone.0163867.s008 .
LibreCat: https://research-explorer.ista.ac.at/record/9867
DOI: 10.1371/journal.pone.0163867.s008

Hilbe C, Hagel K, Milinski M. 2016. Asymmetric power boosts extortion in an economic experiment. PLoS One. 11(10), e0163867.
LibreCat: https://research-explorer.ista.ac.at/record/1322
DOI: 10.1371/journal.pone.0163867

Hilbe C, Hagel K, Milinski M. 2016. Experimental data, Public Library of Science,10.1371/journal.pone.0163867.s009 .
LibreCat: https://research-explorer.ista.ac.at/record/9868
DOI: 10.1371/journal.pone.0163867.s009

Chmelik M. 2016. Algorithms for partially observable markov decision processes. Institute of Science and Technology Austria.
LibreCat: https://research-explorer.ista.ac.at/record/1397

Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Linear distances between Markov chains. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 20.
LibreCat: https://research-explorer.ista.ac.at/record/1093
DOI: 10.4230/LIPIcs.CONCUR.2016.20

Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2016. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. ESA: European Symposium on Algorithms, LIPIcs, vol. 57, 28.
LibreCat: https://research-explorer.ista.ac.at/record/1071
DOI: 10.4230/LIPIcs.ESA.2016.28

Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL: Principles of Programming Languages, POPL, vol. 20–22, 327–342.
LibreCat: https://research-explorer.ista.ac.at/record/1438
DOI: 10.1145/2837614.2837639
arXiv: 1510.08517

Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 32p.
LibreCat: https://research-explorer.ista.ac.at/record/5452
DOI: 10.15479/AT:IST-2017-728-v2-1

Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL: Principles of Programming Languages, POPL, vol. 20–22, 733–747.
LibreCat: https://research-explorer.ista.ac.at/record/1437
DOI: 10.1145/2837614.2837624
arXiv: 1510.07565

Chatterjee K, Fu H, Goharshady AK. 2016. Termination analysis of probabilistic programs through Positivstellensatz’s. CAV: Computer Aided Verification, LNCS, vol. 9779, 3–22.
LibreCat: https://research-explorer.ista.ac.at/record/1386
DOI: 10.1007/978-3-319-41528-4_1

Chatterjee K, Ibsen-Jensen R. 2015. The value 1 problem under finite-memory strategies for concurrent mean-payoff games. Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2015, 1018–1029.
LibreCat: https://research-explorer.ista.ac.at/record/10796
DOI: 10.1137/1.9781611973730.69
arXiv: 1409.6690

Kretinsky J, Larsen K, Laursen S, Srba J. 2015. Polynomial time decidability of weighted synchronization under partial observability. CONCUR: Concurrency Theory, LIPIcs, vol. 42, 142–154.
LibreCat: https://research-explorer.ista.ac.at/record/1499
DOI: 10.4230/LIPIcs.CONCUR.2015.142