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.

498 Publications


2019 | Published | Conference Paper | IST-REx-ID: 6490 | OA
K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol. Part F147772, pp. 400–408.
[Submitted Version] View | Files available | DOI | WoS
 

2019 | Published | Journal Article | IST-REx-ID: 7158 | OA
K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.
[Submitted Version] View | Files available | DOI | WoS
 

2019 | Published | Conference Paper | IST-REx-ID: 6378 | OA
K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol. Part F147772, pp. 374–381.
[Submitted Version] View | Files available | DOI | WoS
 

2019 | Published | Conference Paper | IST-REx-ID: 6175 | OA
P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Phoenix, AZ, United States, 2019, pp. 204–220.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 

2019 | Published | Conference Paper | IST-REx-ID: 6056 | OA
K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart contracts: Secure randomness on the blockchain,” in IEEE International Conference on Blockchain and Cryptocurrency, Seoul, Korea, 2019.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2019 | Published | Journal Article | IST-REx-ID: 7014 | OA
K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis of recursive programs,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Published | Journal Article | IST-REx-ID: 6380 | OA
K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL. ACM, 2019.
[Published Version] View | Files available | DOI
 

2018 | Published | Book Chapter | IST-REx-ID: 59
R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in Handbook of Model Checking, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962.
View | DOI
 

2018 | Published | Conference Paper | IST-REx-ID: 79 | OA
S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Journal Article | IST-REx-ID: 293 | OA
M. Hoffman, C. Hilbe, and M. Nowak, “The signal-burying game can explain why we obscure positive traits and good deeds,” Nature Human Behaviour, vol. 2. Nature Publishing Group, pp. 397–404, 2018.
[Submitted Version] View | Files available | DOI | WoS
 

2018 | Published | Journal Article | IST-REx-ID: 454 | OA
J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, and M. Nowak, “Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness,” Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018.
[Published Version] View | Files available | DOI | WoS
 

2018 | Conference Paper | IST-REx-ID: 5679 | OA
M. Huang, H. Fu, and K. Chatterjee, “New approaches for almost-sure termination of probabilistic programs,” presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand, 2018, vol. 11275, pp. 181–201.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 325 | OA
S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 25 | OA
K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 24 | OA
K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 310 | OA
K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States, 2018, pp. 2341–2356.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 297 | OA
T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.
[Published Version] View | Files available | DOI | WoS
 

2018 | Published | Book Chapter | IST-REx-ID: 86 | OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161.
[Submitted Version] View | Files available | DOI
 

2018 | Published | Conference Paper | IST-REx-ID: 141 | OA
K. Chatterjee, M. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.
[Published Version] View | Files available | DOI | WoS
 

2018 | Published | Journal Article | IST-REx-ID: 419 | OA
C. Hilbe, K. Chatterjee, and M. Nowak, “Partners and rivals in direct reciprocity,” Nature Human Behaviour, vol. 2. Nature Publishing Group, pp. 469–477, 2018.
[Submitted Version] View | Files available | DOI | WoS
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed