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.
470 Publications
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: 6884 |
Avni, G., Henzinger, T. A., & Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138). 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
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 5948
Fu, H., & Chatterjee, K. (2019). Termination of nondeterministic probabilistic programs. In International Conference on Verification, Model Checking, and Abstract Interpretation (Vol. 11388, pp. 468–490). Cascais, Portugal: Springer Nature. https://doi.org/10.1007/978-3-030-11245-5_22
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6462 |
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
[Published Version]
View
| Files available
| DOI
| WoS
2019 |Published| Journal Article | IST-REx-ID: 6836 |
Hauser, O. P., Hilbe, C., Chatterjee, K., & Nowak, M. A. (2019). Social dilemmas among unequals. Nature. Springer Nature. https://doi.org/10.1038/s41586-019-1488-5
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 |Published| Conference Paper | IST-REx-ID: 6942 |
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
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 7183 |
Brázdil, T., Chatterjee, K., Kucera, A., Novotný, P., & Velan, D. (2019). Deciding fast termination for probabilistic VASS with nondeterminism. In International Symposium on Automated Technology for Verification and Analysis (Vol. 11781, pp. 462–478). Taipei, Taiwan: Springer Nature. https://doi.org/10.1007/978-3-030-31784-3_27
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 7210 |
Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2019). Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. Springer Nature. https://doi.org/10.1038/s42003-019-0373-y
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
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
2019 |Published| Conference Paper | IST-REx-ID: 7402 |
Chatterjee, K., & Doyen, L. (2019). Graph planning with expected finite horizon. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Vancouver, BC, Canada: IEEE. https://doi.org/10.1109/lics.2019.8785706
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Submitted| Preprint | IST-REx-ID: 7950 |
Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte, A. (n.d.). Token swapping on trees. arXiv.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6780 |
Huang, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (2019). 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 (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360555
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 6380 |
Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. ACM. https://doi.org/10.1145/3290366
[Published Version]
View
| Files available
| DOI
2019 |Published| Conference Paper | IST-REx-ID: 6056 |
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE. https://doi.org/10.1109/BLOC.2019.8751326
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6378 |
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). 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
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 |Published| Conference Paper | IST-REx-ID: 6175 |
Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3314221.3314581
[Submitted Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 7158 |
Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3363525
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 |Published| Journal Article | IST-REx-ID: 7014 |
Chatterjee, K., Fu, H., & Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3339984
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6490 |
Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (2019). 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
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 |Published| Conference Paper | IST-REx-ID: 10883 |
Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2018). Quasipolynomial set-based symbolic algorithms for parity games. In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57, pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k
[Published Version]
View
| Files available
| DOI
| arXiv