Chatterjee, K., Elgyütt, A., Novotný, P., &; Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI.https://doi.org/10.24963/ijcai.2018/652 
LibreCat: https://research-explorer.ista.ac.at/record/24
DOI: 10.24963/ijcai.2018/652
WoS: 000764175404117
arXiv: 1804.10601

Chatterjee, K., Chemlík, M., &; Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press.
LibreCat: https://research-explorer.ista.ac.at/record/34
WoS: 000492986200006
arXiv: 1710.00675

Chatterjee, K., Dvorák, W., Henzinger, M. H., &; Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.
LibreCat: https://research-explorer.ista.ac.at/record/35
WoS: 000492986200007
arXiv: 1804.07031

Chatterjee, K., Pavlogiannis, A., Kößler, A., &; Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. Springer.https://doi.org/10.1007/s11241-017-9293-4 
LibreCat: https://research-explorer.ista.ac.at/record/738
DOI: 10.1007/s11241-017-9293-4
WoS: 000419955500006

Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., &; Nowak, M. (2018). Language acquisition with communication between learners. Journal of the Royal Society Interface. The Royal Society.https://doi.org/10.1098/rsif.2018.0073 
LibreCat: https://research-explorer.ista.ac.at/record/198
DOI: 10.1098/rsif.2018.0073
WoS: 000428576200023
PMID: 29593089

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 
LibreCat: https://research-explorer.ista.ac.at/record/5751
DOI: 10.1038/s42003-018-0078-7
WoS: 000461126500071

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 
LibreCat: https://research-explorer.ista.ac.at/record/66
DOI: 10.4230/LIPIcs.CONCUR.2018.11
arXiv: 1806.03108

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 
LibreCat: https://research-explorer.ista.ac.at/record/311
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/6340
DOI: 10.1109/Cybermatics_2018.2018.00231
WoS: 000481634500196
arXiv: 1805.09104

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 
LibreCat: https://research-explorer.ista.ac.at/record/6009
DOI: 10.1145/3210257
WoS: 000444694800001
arXiv: 1510.07565

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 
LibreCat: https://research-explorer.ista.ac.at/record/5977
DOI: 10.24963/ijcai.2018/653
WoS: 000764175404118
arXiv: 1804.08984

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 
LibreCat: https://research-explorer.ista.ac.at/record/2
DOI: 10.1073/pnas.1810565115
WoS: 000451351000063
PMID: 30429320

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 
LibreCat: https://research-explorer.ista.ac.at/record/10418
DOI: 10.1145/3158121
arXiv: 1711.03588

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 
LibreCat: https://research-explorer.ista.ac.at/record/464
DOI: 10.23638/LMCS-13(3:26)2017
arXiv: 1410.0833

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