Chatterjee, K., Ketínská, Z., &; Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.23638/LMCS-13(2:15)2017 
LibreCat: https://research-explorer.ista.ac.at/record/466
DOI: 10.23638/LMCS-13(2:15)2017

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/3152769 
LibreCat: https://research-explorer.ista.ac.at/record/467
DOI: 10.1145/3152769
arXiv: 1606.03598

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &; Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.23638/LMCS-13(3:23)2017 
LibreCat: https://research-explorer.ista.ac.at/record/465
DOI: 10.23638/LMCS-13(3:23)2017

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports. Nature Publishing Group.https://doi.org/10.1038/s41598-017-00107-w 
LibreCat: https://research-explorer.ista.ac.at/record/512
DOI: 10.1038/s41598-017-00107-w

Chatterjee, K., Choudhary, B., &; Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3158118 
LibreCat: https://research-explorer.ista.ac.at/record/10416
DOI: 10.1145/3158118
arXiv: 1910.00241

Chatterjee, K., Choudhary, B., &; Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria.https://doi.org/10.15479/AT:IST-2017-870-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5455
DOI: 10.15479/AT:IST-2017-870-v1-1

Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., &; Vaidya, K. (2017). Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3158119 
LibreCat: https://research-explorer.ista.ac.at/record/10417
DOI: 10.1145/3158119
arXiv: 1610.01188

Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., &; Vaidya, K. (2017). Data-centric dynamic partial order reduction. IST Austria.https://doi.org/10.15479/AT:IST-2017-872-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5456
DOI: 10.15479/AT:IST-2017-872-v1-1

Chatterjee, K., Ibsen-Jensen, R., &; Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2017.61 
LibreCat: https://research-explorer.ista.ac.at/record/551
DOI: 10.4230/LIPIcs.MFCS.2017.61

Chatterjee, K., Henzinger, M. H., &; Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2017.39 
LibreCat: https://research-explorer.ista.ac.at/record/552
DOI: 10.4230/LIPIcs.MFCS.2017.39