Please note that IST 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.

332 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 | 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, 41(4), 20. https://doi.org/10.1145/3339984
View | DOI | arXiv
 

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 | 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: 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: 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 | 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: 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 Model Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27
View | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed