Chatterjee, Krishnendu, Zuzana Ketínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.”https://doi.org/10.23638/LMCS-13(2:15)2017__Logical Methods in Computer Science. International Federation of Computational Logic, 2017.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, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.”https://doi.org/10.1145/3152769__ACM Transactions on Computational Logic (TOCL). ACM, 2017.https://doi.org/10.1145/3152769 .
LibreCat: https://research-explorer.ista.ac.at/record/467
DOI: 10.1145/3152769
arXiv: 1606.03598

Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.”https://doi.org/10.23638/LMCS-13(3:23)2017__Logical Methods in Computer Science. International Federation of Computational Logic, 2017.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, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.”https://doi.org/10.1038/s41598-017-00107-w__Scientific Reports. Nature Publishing Group, 2017.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, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.”https://doi.org/10.1145/3158118__Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017.https://doi.org/10.1145/3158118 .
LibreCat: https://research-explorer.ista.ac.at/record/10416
DOI: 10.1145/3158118
arXiv: 1910.00241

Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017.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

Petritsch, Barbara. Implementing the Institutional Data Repository IST DataRep. IST Austria, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/5450

Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.”https://doi.org/10.1145/3158119__Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017.https://doi.org/10.1145/3158119 .
LibreCat: https://research-explorer.ista.ac.at/record/10417
DOI: 10.1145/3158119
arXiv: 1610.01188

Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017.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, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.”https://doi.org/10.4230/LIPIcs.MFCS.2017.61__In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.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