Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
454 Publications
2020 | Published | Conference Paper | IST-REx-ID: 7346 | 
Schmid L, Chatterjee K, Schmid S. The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. In: Proceedings of the 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2019.21
[Preprint]
View
| Files available
| DOI
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 15055 |
Brázdil T, Chatterjee K, Novotný P, Vahala J. Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. 2020;34(06):9794-9801. doi:10.1609/aaai.v34i06.6531
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 15082 |
Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible plane perfect matchings. In: 36th European Workshop on Computational Geometry. ; 2020.
[Published Version]
View
| Download Published Version (ext.)
2020 | Published | Journal Article | IST-REx-ID: 9197
Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 2020;34(02):1798-1805. doi:10.1609/aaai.v34i02.5546
[Preprint]
View
| DOI
| arXiv
2020 | Research Data Reference | IST-REx-ID: 9814 |
Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. 2020. doi:10.6084/m9.figshare.5973013.v1
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2020 | Published | Conference Paper | IST-REx-ID: 7810 |
Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Optimal and perfectly parallel algorithms for on-demand data-flow analysis. In: European Symposium on Programming. Vol 12075. Springer Nature; 2020:112-140. doi:10.1007/978-3-030-44914-8_5
[Published Version]
View
| Files available
| DOI
| WoS
2020 | Published | Conference Paper | IST-REx-ID: 8728 |
Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In: Automated Technology for Verification and Analysis. Vol 12302. Springer Nature; 2020:253-270. doi:10.1007/978-3-030-59152-6_14
[Submitted Version]
View
| Files available
| DOI
| WoS
2020 | Published | Conference Paper | IST-REx-ID: 8533 |
Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Simplified game of life: Algorithms and complexity. In: 45th International Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.22
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 8089 |
Chatterjee K, Fu H, Goharshady AK, Goharshady EK. Polynomial invariant generation for non-deterministic recursive programs. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2020:672-687. doi:10.1145/3385412.3385969
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 8789 |
Kleshnina M, Streipert S, Filar J, Chatterjee K. Prioritised learning in snowdrift-type games. Mathematics. 2020;8(11). doi:10.3390/math8111945
[Published Version]
View
| Files available
| DOI
| WoS
2020 | Published | Conference Paper | IST-REx-ID: 8272 |
Chatterjee K, Katoen JP, Weininger M, Winkler T. Stochastic games with lexicographic reachability-safety objectives. In: International Conference on Computer Aided Verification. Vol 12225. Springer Nature; 2020:398-420. doi:10.1007/978-3-030-53291-8_21
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7955 |
Ashok P, Chatterjee K, Kretinsky J, Weininger M, Winkler T. Approximating values of generalized-reachability stochastic games. In: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science . Association for Computing Machinery; 2020:102-115. doi:10.1145/3373718.3394761
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 | Submitted | Preprint | IST-REx-ID: 7950 |
Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. arXiv.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 6462 |
Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. Run-time optimization for learned controllers through quantitative games. In: 31st International Conference on Computer-Aided Verification. Vol 11561. Springer; 2019:630-649. doi:10.1007/978-3-030-25540-4_36
[Published Version]
View
| Files available
| DOI
| WoS
2019 | Submitted | Conference Paper | IST-REx-ID: 6490 |
Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; :400-408. doi:10.1145/3297280.3297322
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 | Published | Journal Article | IST-REx-ID: 6836 |
Hauser OP, Hilbe C, Chatterjee K, Nowak MA. Social dilemmas among unequals. Nature. 2019;572(7770):524-527. doi:10.1038/s41586-019-1488-5
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 | Published | Conference Paper | IST-REx-ID: 6884 |
Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.MFCS.2019.11
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 6885 |
Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.27
[Published Version]
View
| Files available
| DOI
2019 | Published | Conference Paper | IST-REx-ID: 6887 |
Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.7
[Published Version]
View
| Files available
| DOI
2019 | Published | Journal Article | IST-REx-ID: 7158 |
Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 2019;41(4). doi:10.1145/3363525
[Submitted Version]
View
| Files available
| DOI
| WoS