Chakraborty, S., Henzinger, T. A., Sezgin, A., &; Vafeiadis, V. (2015). Aspect-oriented linearizability proofs. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-11(1:20)2015 
LibreCat: https://research-explorer.ista.ac.at/record/1832
DOI: 10.2168/LMCS-11(1:20)2015

Kolmogorov, V., Thapper, J., &; divný, S. (2015). The power of linear programming for general-valued CSPs. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/130945648 
LibreCat: https://research-explorer.ista.ac.at/record/2271
DOI: 10.1137/130945648
arXiv: 1311.4219

Chatterjee, K., Joglekar, M., &; Shah, N. (2015). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2015.01.050 
LibreCat: https://research-explorer.ista.ac.at/record/1598
DOI: 10.1016/j.tcs.2015.01.050
arXiv: 1202.4175

Chatterjee, K., Doyen, L., Gimbert, H., &; Henzinger, T. A. (2015). Randomness for free. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.06.003 
LibreCat: https://research-explorer.ista.ac.at/record/1731
DOI: 10.1016/j.ic.2015.06.003

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. ACM.https://doi.org/10.1145/2699430 
LibreCat: https://research-explorer.ista.ac.at/record/1856
DOI: 10.1145/2699430

Chatterjee, K., Henzinger, M. H., &; Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.34 
LibreCat: https://research-explorer.ista.ac.at/record/1661
DOI: 10.1109/LICS.2015.34

Lewin, M., Nam, P., &; Rougerie, N. (2015). Derivation of nonlinear gibbs measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. Ecole Polytechnique.https://doi.org/10.5802/jep.18 
LibreCat: https://research-explorer.ista.ac.at/record/473
DOI: 10.5802/jep.18

Chatterjee, K., Doyen, L., Randour, M., &; Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.03.010 
LibreCat: https://research-explorer.ista.ac.at/record/523
DOI: 10.1016/j.ic.2015.03.010

Chatterjee, K., &; Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.03.009 
LibreCat: https://research-explorer.ista.ac.at/record/524
DOI: 10.1016/j.ic.2015.03.009
arXiv: 1409.5306

Ahmed, U., Chatterjee, K., &; Gulwani, S. (2015). Automatic generation of alternative starting positions for simple traditional board games. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 2, pp. 745–752). Austin, TX, USA: AAAI Press.
LibreCat: https://research-explorer.ista.ac.at/record/1481

Chatterjee, K., Chmelik, M., Gupta, R., &; Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE.https://doi.org/10.1109/ICRA.2015.7139019 
LibreCat: https://research-explorer.ista.ac.at/record/1732
DOI: 10.1109/ICRA.2015.7139019
arXiv: 1409.3360

Chatterjee, K., Ibsen-Jensen, R., &; Hansen, K. (2015). The patience of concurrent stochastic games with safety and reachability objectives. IST Austria.https://doi.org/10.15479/AT:IST-2015-322-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5431
DOI: 10.15479/AT:IST-2015-322-v1-1

Anonymous, 1, &; Anonymous, 2. (2015). Optimal cost indefinite-horizon reachability in goal DEC-POMDPs. IST Austria.
LibreCat: https://research-explorer.ista.ac.at/record/5434

Chatterjee, K., Komarkova, Z., &; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2015-318-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5429
DOI: 10.15479/AT:IST-2015-318-v1-1

Chatterjee, K., Komarkova, Z., &; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2015-318-v2-1 
LibreCat: https://research-explorer.ista.ac.at/record/5435
DOI: 10.15479/AT:IST-2015-318-v2-1

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2015). Nested weighted automata. IST Austria.https://doi.org/10.15479/AT:IST-2015-170-v2-2 
LibreCat: https://research-explorer.ista.ac.at/record/5436
DOI: 10.15479/AT:IST-2015-170-v2-2

Boker, U., Henzinger, T. A., &; Otop, J. (2015). The target discounted-sum problem. In LICS (pp. 750–761). Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.74 
LibreCat: https://research-explorer.ista.ac.at/record/1659
DOI: 10.1109/LICS.2015.74

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &; Otop, J. (2015). Edit distance for pushdown automata. In 42nd International Colloquium (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature.https://doi.org/10.1007/978-3-662-47666-6_10 
LibreCat: https://research-explorer.ista.ac.at/record/1610
DOI: 10.1007/978-3-662-47666-6_10
arXiv: 1504.08259

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria.https://doi.org/10.15479/AT:IST-2015-330-v2-1 
LibreCat: https://research-explorer.ista.ac.at/record/5437
DOI: 10.15479/AT:IST-2015-330-v2-1

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria.https://doi.org/10.15479/AT:IST-2015-319-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5430
DOI: 10.15479/AT:IST-2015-319-v1-1