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.




355 Publications

2019 | 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, 2019.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2019 | 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, 2019.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 5948
H. Fu and K. Chatterjee, “Termination of nondeterministic probabilistic programs,” in International Conference on Verification, Model Checking, and Abstract Interpretation, Cascais, Portugal, 2019, vol. 11388, pp. 468–490.
View | DOI | Download Preprint (ext.) | arXiv
 
2019 | Preprint | IST-REx-ID: 7950 | OA
A. Biniaz et al., “Token swapping on trees,” arXiv. .
View | Files available | Download Preprint (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 2 | OA
C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, and M. Nowak, “Indirect reciprocity with private, noisy, and incomplete information,” PNAS, vol. 115, no. 48, pp. 12241–12246, 2018.
View | Files available | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
2018 | Conference Paper | IST-REx-ID: 24 | OA
K. Chatterjee, A. Elgyütt, P. Novotny, 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.
View | DOI | Download Preprint (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 738 | OA
K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” Real-Time Systems, vol. 54, no. 1, pp. 166–207, 2018.
View | Files available | DOI
 
2018 | 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.
View | DOI | Download Preprint (ext.) | arXiv
 
2018 | 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, pp. 469–477, 2018.
View | Files available | DOI
 
2018 | 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, 2018.
View | Files available | DOI
 
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.
View | DOI | Download Preprint (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5751 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. A. Nowak, “Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory,” Communications Biology, vol. 1, no. 1, 2018.
View | Files available | DOI
 
2018 | 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 | Conference Paper | IST-REx-ID: 5967 | OA
K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 5977 | OA
K. Chatterjee, H. Fu, A. Goharshady, and N. Okati, “Computational approaches for stochastic shortest path on succinct MDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4700–4707.
View | DOI | Download Preprint (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5993 | OA
K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, p. 7, 2018.
View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 6009 | OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, p. 9, 2018.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2018 | 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, pp. 397–404, 2018.
View | Files available | DOI
 
2018 | 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.
View | Files available | DOI
 
2018 | 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.
View | DOI | Download Preprint (ext.) | arXiv
 

Search

Display / Sort

Citation Style: IEEE

Export / Embed