Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




331 Publications

2019 | Conference Paper | IST-REx-ID: 6490
Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 6887   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140, p. 7). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 5948
Fu, H., & Chatterjee, K. (2019). Termination of nondeterministic probabilistic programs. (C. Enea & R. Piskac, Eds.). Presented at the Verification, Model Checking, and Abstract Interpretation, VMCAI, Cascais, Portugal: Springer. https://doi.org/10.1007/978-3-030-11245-5_22
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 6175   OA
Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019) (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3314221.3314581
View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6884   OA
Avni, G., Henzinger, T. A., & Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138, p. 11). Presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.11
View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6889   OA
Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140, p. 6). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6942   OA
Ashok, P., Brázdil, T., Chatterjee, K., Křetínský, J., Lampert, C., & Toman, V. (2019). Strategy representation by decision trees with linear classifiers. In 16th International Conference on Quantitative Evaluation of Systems (Vol. 11785, pp. 109–128). Glasgow, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-030-30281-8_7
View | DOI | Download (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6380   OA
Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages, 3(POPL), 53. https://doi.org/10.1145/3290366
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6378   OA
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (n.d.). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6462   OA
Avni, G., Bloem, R., Chatterjee, K., Henzinger, T. A., Konighofer, B., & Pranger, S. (2019). Run-time optimization for learned controllers through quantitative games. In 31st International Conference on Computer-Aided Verification (Vol. 11561, pp. 630–649). New York, NY, United States: Springer. https://doi.org/10.1007/978-3-030-25540-4_36
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6056   OA
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency (p. 8751326). Seoul, Korea: IEEE. https://doi.org/10.1109/BLOC.2019.8751326
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6885   OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140, p. 27). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6780   OA
Huang, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (n.d.). Modular verification for almost-sure termination of probabilistic programs. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . Athens, Greece: ACM.
View | Files available | Download (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6836
Hauser, O. P., Hilbe, C., Chatterjee, K., & Nowak, M. A. (2019). Social dilemmas among unequals. Nature, 572(7770), 524–527. https://doi.org/10.1038/s41586-019-1488-5
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6918
Goharshady, A. K., & Mohammadi, F. (2019). An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety, 193, 106665. https://doi.org/10.1016/j.ress.2019.106665
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 143   OA
Brázdil, T., Chatterjee, K., Kučera, A., Novotny, P., Velan, D., & Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE. https://doi.org/10.1145/3209108.3209191
View | DOI | Download (ext.)
 
2018 | Journal Article | IST-REx-ID: 198   OA
Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Language acquisition with communication between learners. Journal of the Royal Society Interface, 15(140). https://doi.org/10.1098/rsif.2018.0073
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 35   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.
View | Download (ext.) | arXiv
 
2018 | Book Chapter | IST-REx-ID: 59
Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.), Handbook of Modeling Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 66   OA
Chatterjee, K., Goharshady, A., Ibsen-Jensen, R., & Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. (Vol. 118, p. 11). 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
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 24   OA
Chatterjee, K., Elgyütt, A., Novotny, 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
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 310   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Loitzenbauer, V. (2018). Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter (pp. 2341–2356). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, USA: ACM. https://doi.org/10.1137/1.9781611975031.151
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 5967
Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2018). The Big Match with a clock and a bit of memory. In Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18 (pp. 149–150). Ithaca, NY, United States: ACM Press. https://doi.org/10.1145/3219166.3219198
View | DOI
 
2018 | Journal Article | IST-REx-ID: 6009   OA
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, 40(3), 9. https://doi.org/10.1145/3210257
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5993   OA
Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2018). Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. ACM Transactions on Programming Languages and Systems, 40(2), 7. https://doi.org/10.1145/3174800
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 6340   OA
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.
View | Files available | arXiv
 
2018 | Conference Paper | IST-REx-ID: 79   OA
Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., & Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. https://doi.org/10.1007/978-3-319-99154-2_4
View | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 738   OA
Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. Real-Time Systems, 54(1), 166–207. https://doi.org/10.1007/s11241-017-9293-4
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 454   OA
Reiter, J., Hilbe, C., Rand, D., Chatterjee, K., & Nowak, M. (2018). Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications, 9(1), 555. https://doi.org/10.1038/s41467-017-02721-8
View | Files available | DOI
 
2018 | Book Chapter | IST-REx-ID: 86
Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9
View | DOI
 
2018 | Journal Article | IST-REx-ID: 157
Hilbe, C., Šimsa, Š., Chatterjee, K., & Nowak, M. (2018). Evolution of cooperation in stochastic games. Nature, 559(7713), 246–249. https://doi.org/10.1038/s41586-018-0277-x
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 25
Horák, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/662
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 311   OA
Chatterjee, K., Goharshady, A., & 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
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 141   OA
Chatterjee, K., Henzinger, M., Loitzenbauer, V., Oraee, S., & Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 2   OA
Hilbe, C., Schmid, L., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Indirect reciprocity with private noisy and incomplete information. PNAS, 115(48), 12241–12246. https://doi.org/10.1073/pnas.1810565115
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
2018 | Conference Paper | IST-REx-ID: 297   OA
Brázdil, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89960-2_21
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 293
Hoffman, M., Hilbe, C., & Nowak, M. (2018). The signal-burying game can explain why we obscure positive traits and good deeds. Nature Human Behaviour, 2, 397–404. https://doi.org/10.1038/s41562-018-0354-z
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 325   OA
Agrawal, S., Chatterjee, K., & Novotny, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 34   OA
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.
View | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 419
Hilbe, C., Chatterjee, K., & Nowak, M. (2018). Partners and rivals in direct reciprocity. Nature Human Behaviour, 2, 469–477. https://doi.org/10.1038/s41562-018-0320-9
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 5679   OA
Huang, M., Fu, H., & Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. https://doi.org/10.1007/978-3-030-02768-1_11
View | DOI | Download (ext.) | arXiv
 
2018 | Preprint | IST-REx-ID: 5977   OA
Chatterjee, K., Fu, H., Goharshady, A., & Okati, N. (n.d.). Computational Approaches for Stochastic Shortest Path on Succinct MDPs. ArXiv. ArXiv.
View | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5751   OA
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology, 1(1), 71. https://doi.org/10.1038/s42003-018-0078-7
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 681   OA
Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J. (2017). Doomsday equilibria for omega-regular games. Information and Computation, 254, 296–315. https://doi.org/10.1016/j.ic.2016.10.012
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 744
Priklopil, T., Chatterjee, K., & Nowak, M. (2017). Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology, 433, 64–72. https://doi.org/10.1016/j.jtbi.2017.08.025
View | DOI
 
2017 | Thesis | IST-REx-ID: 821   OA
Pavlogiannis, A. (2017). Algorithmic advances in program analysis and their applications. IST Austria. https://doi.org/10.15479/AT:ISTA:th_854
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 465   OA
Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science, 13(3). https://doi.org/10.23638/LMCS-13(3:23)2017
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 1407   OA
Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems, 23(2), 230–253. https://doi.org/10.1016/j.nahs.2016.04.006
View | Files available | DOI | Download (ext.) | arXiv
 
2017 | Journal Article | IST-REx-ID: 1065   OA
Chatterjee, K., & Osang, G. F. (2017). Pushdown reachability with constant treewidth. Information Processing Letters, 122, 25–29. https://doi.org/10.1016/j.ipl.2017.02.003
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1009   OA
Chatterjee, K., Novotny, P., Pérez, G., Raskin, J., & Zikelic, D. (2017). Optimizing expectation with guarantees in POMDPs. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3725–3732). San Francisco, CA, United States: AAAI Press.
View | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed