H. Edelsbrunner, G. Jablonski, and M. Mrozek, “The persistent homology of a self-map,” Foundations of Computational Mathematics, vol. 15, no. 5. Springer, pp. 1213–1244, 2015.

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.

P. Nam and R. Seiringer, “Collective excitations of Bose gases in the mean-field regime,” Archive for Rational Mechanics and Analysis, vol. 215, no. 2. Springer, pp. 381–417, 2015.

L. Erdös and A. Knowles, “The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case,” Communications in Mathematical Physics, vol. 333, no. 3. Springer, pp. 1365–1416, 2015.

S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” Logical Methods in Computer Science, vol. 11, no. 1. International Federation of Computational Logic, 2015.

V. Kolmogorov, J. Thapper, and S. divný, “The power of linear programming for general-valued CSPs,” SIAM Journal on Computing, vol. 44, no. 1. SIAM, pp. 1–36, 2015.

K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” Theoretical Computer Science, vol. 573, no. 3. Elsevier, pp. 71–89, 2015.

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.

K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” Journal of the ACM, vol. 62, no. 1. ACM, 2015.

K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.

M. Lewin, P. Nam, and N. Rougerie, “Derivation of nonlinear gibbs measures from many-body quantum mechanics,” Journal de l’Ecole Polytechnique - Mathematiques, vol. 2. Ecole Polytechnique, pp. 65–115, 2015.

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.

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.

U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative starting positions for simple traditional board games,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA, 2015, vol. 2, pp. 745–752.

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.

K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, The patience of concurrent stochastic games with safety and reachability objectives. IST Austria, 2015.

1 Anonymous and 2 Anonymous, Optimal cost indefinite-horizon reachability in goal DEC-POMDPs. IST Austria, 2015.

K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.

K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.

K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2015.