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.
454 Publications
2019 |
Published |
Conference Paper |
IST-REx-ID: 6887 |
Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7
[Published Version]
View
| Files available
| DOI
2019 |
Published |
Conference Paper |
IST-REx-ID: 6889 |
Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). 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
[Published Version]
View
| Files available
| DOI
2019 |
Published |
Conference Paper |
IST-REx-ID: 10190 |
Chatterjee, K., Pavlogiannis, A., & Toman, V. (2019). Value-centric dynamic partial order reduction. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360550
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2018 |
Published |
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
[Submitted Version]
View
| Files available
| DOI
2018 |
Published |
Journal Article |
IST-REx-ID: 738 |
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
[Published Version]
View
| Files available
| DOI
| WoS
2018 |
Published |
Conference Paper |
IST-REx-ID: 79 |
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
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Journal Article |
IST-REx-ID: 157 |
Hilbe, C., Šimsa, Š., Chatterjee, K., & Nowak, M. (2018). Evolution of cooperation in stochastic games. Nature. Nature Publishing Group. https://doi.org/10.1038/s41586-018-0277-x
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 |
Published |
Journal Article |
IST-REx-ID: 198 |
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
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2018 |
Published |
Journal Article |
IST-REx-ID: 2 |
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
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| PubMed | Europe PMC
2018 |
Published |
Conference Paper |
IST-REx-ID: 141 |
Chatterjee, K., Henzinger, M. H., 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
[Published Version]
View
| Files available
| DOI
| WoS
2018 |
Published |
Conference Paper |
IST-REx-ID: 143 |
Brázdil, T., Chatterjee, K., Kučera, A., Novotný, 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
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2018 |
Conference Paper |
IST-REx-ID: 5679 |
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
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Journal Article |
IST-REx-ID: 5751 |
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
[Published Version]
View
| Files available
| DOI
| WoS
2018 |
Published |
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 Model Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27
View
| DOI
2018 |
Published |
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
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 |
Published |
Conference Paper |
IST-REx-ID: 5977 |
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
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Journal Article |
IST-REx-ID: 5993 |
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. Association for Computing Machinery (ACM). https://doi.org/10.1145/3174800
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2018 |
Published |
Journal Article |
IST-REx-ID: 6009 |
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
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 6340 |
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
[Submitted Version]
View
| Files available
| DOI
| WoS
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 66 |
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
[Published Version]
View
| Files available
| DOI
| arXiv