Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. Springer Nature.https://doi.org/10.1038/s42003-018-0078-7 

Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., &; Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2018.11 

Chatterjee, K., Goharshady, A. K., &; Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer.https://doi.org/10.1007/978-3-319-89884-1_26 

Goharshady, A. K., Behrouz, A., &; Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In Proceedings of the IEEE International Conference on Blockchain (pp. 1343–1348). Halifax, Canada: IEEE.https://doi.org/10.1109/Cybermatics_2018.2018.00231 

Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., &; Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM).https://doi.org/10.1145/3210257 

Chatterjee, K., Fu, H., Goharshady, A. K., &; Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI.https://doi.org/10.24963/ijcai.2018/653 

Hilbe, C., Schmid, L., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2018). Indirect reciprocity with private, noisy, and incomplete information. PNAS. National Academy of Sciences.https://doi.org/10.1073/pnas.1810565115 

Mciver, A., Morgan, C., Kaminski, B. L., &; Katoen, J. P. (2017). A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3158121 

Chatterjee, K., Henzinger, M. H., &; Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.23638/LMCS-13(3:26)2017 

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 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/3152769 

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 

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 

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 

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 

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 

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 

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 

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 

Chatterjee, K., Hansen, K., &; Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety 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.55