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.




333 Publications

2019 | Conference Paper | IST-REx-ID: 6490
Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on Applied Computing vol. Part F147772. 400–408.
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. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140. 7.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 5948
Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs (eds. C. Enea & R. Piskac). 11388, 468–490.
View | DOI
 
2019 | Journal Article | IST-REx-ID: 7014
Chatterjee K, Fu H, Goharshady AK. 2019. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 41(4), 20.
View | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 7158
Chatterjee K, Goharshady AK, 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. 41(4), 23.
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 6175   OA
Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019). 40th ACM Conference on Programming Language Design and Implementation 204–220.
View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6884   OA
Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games. MFCS: nternational Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 138. 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. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140. 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. 16th International Conference on Quantitative Evaluation of Systems. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11785. 109–128.
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6056   OA
Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Probabilistic smart contracts: Secure randomness on the blockchain. IEEE International Conference on Blockchain and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency 8751326.
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6462   OA
Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. 2019. Run-time optimization for learned controllers through quantitative games. 31st International Conference on Computer-Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 11561. 630–649.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6378   OA
Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. Proceedings of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing vol. Part F147772. 374–381.
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6380   OA
Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 3(POPL), 53.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6885   OA
Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140. 27.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6780   OA
Huang M, Fu H, Chatterjee K, Goharshady AK. Modular verification for almost-sure termination of probabilistic programs. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications
View | Files available | Download (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6836
Hauser OP, Hilbe C, Chatterjee K, Nowak MA. 2019. Social dilemmas among unequals. Nature. 572(7770), 524–527.
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6918
Goharshady AK, Mohammadi F. 2019. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 193, 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. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033. 185–194.
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).
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. 28th International Conference on Automated Planning and Scheduling . ICAPS: International Conference on Automated Planning and Scheduling
View | Download (ext.) | arXiv
 
2018 | Book Chapter | IST-REx-ID: 59
Bloem R, Chatterjee K, Jobstmann B. 2018. Graph games and reactive synthesis. Handbook of Model Checking. 921–962.
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 66   OA
Chatterjee K, Goharshady A, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 118. 11.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 24   OA
Chatterjee K, Elgyütt A, Novotny P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018. 4692–4699.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 310   OA
Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter. SODA: Symposium on Discrete Algorithms, SODA, 2341–2356.
View | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 454   OA
Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. 2018. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. 9(1), 555.
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 6009   OA
Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2018. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 40(3), 9.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5993   OA
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. 40(2), 7.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 6340   OA
Goharshady AK, Behrouz A, Chatterjee K. 2018. Secure Credit Reporting on the Blockchain. Proceedings of the IEEE International Conference on Blockchain. IEEE International Conference on Blockchain 1343–1348.
View | Files available | arXiv
 
2018 | Journal Article | IST-REx-ID: 738   OA
Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 79   OA
Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11024. 53–70.
View | DOI | Download (ext.) | arXiv
 
2018 | Book Chapter | IST-REx-ID: 86   OA
Chatterjee K, Henzinger TA, Otop J. 2018. Computing average response time. Principles of Modeling. , LNCS, vol. 10760. 143–161.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 5967   OA
Hansen KA, Ibsen-Jensen R, Neyman A. 2018. The Big Match with a clock and a bit of memory. Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18. EC: Conference on Economics and Computation 149–150.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 25
Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July. 4764–4770.
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 311   OA
Chatterjee K, Goharshady A, Velner Y. 2018. Quantitative analysis of smart contracts. ESOP: European Symposium on Programming, LNCS., vol. 10801. 739–767.
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 157   OA
Hilbe C, Šimsa Š, Chatterjee K, Nowak M. 2018. Evolution of cooperation in stochastic games. Nature. 559(7713), 246–249.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 141   OA
Chatterjee K, Henzinger M, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. CAV: Computer Aided Verification, LNCS, vol. 10982. 178–197.
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 2   OA
Hilbe C, Schmid L, Tkadlec J, Chatterjee K, Nowak M. 2018. Indirect reciprocity with private noisy and incomplete information. PNAS. 115(48), 12241–12246.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
2018 | Conference Paper | IST-REx-ID: 297   OA
Brázdil T, Chatterjee K, Kretinsky J, Toman V. 2018. Strategy representation by decision trees in reactive synthesis. TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10805. 385–407.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 325   OA
Agrawal S, Chatterjee K, Novotny P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 34   OA
Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with reachability objectives. ICAPS: International Conference on Automated Planning and Scheduling, ICAPS, vol. 2018. 47–55.
View | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 5679   OA
Huang M, Fu H, Chatterjee K. 2018. New approaches for almost-sure termination of probabilistic programs. 16th Asian Symposium on Programming Languages and Systems, APLAS, LNCS, vol. 11275. 181–201.
View | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5751   OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. 2018. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 1(1), 71.
View | Files available | DOI
 
2018 | Preprint | IST-REx-ID: 5977   OA
Chatterjee K, Fu H, Goharshady A, Okati N. Computational Approaches for Stochastic Shortest Path on Succinct MDPs. ArXiv.
View | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 419   OA
Hilbe C, Chatterjee K, Nowak M. 2018. Partners and rivals in direct reciprocity. Nature Human Behaviour. 2, 469–477.
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 293   OA
Hoffman M, Hilbe C, Nowak M. 2018. The signal-burying game can explain why we obscure positive traits and good deeds. Nature Human Behaviour. 2, 397–404.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 1065   OA
Chatterjee K, Osang GF. 2017. Pushdown reachability with constant treewidth. Information Processing Letters. 122, 25–29.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 1407
Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2017. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 23(2), 230–253.
View | Files available | DOI | Download (ext.) | arXiv
 
2017 | Journal Article | IST-REx-ID: 465
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 681   OA
Chatterjee K, Doyen L, Filiot E, Raskin J. 2017. Doomsday equilibria for omega-regular games. Information and Computation. 254, 296–315.
View | DOI | Download (ext.)
 
2017 | Thesis | IST-REx-ID: 821   OA
Pavlogiannis A. 2017. Algorithmic advances in program analysis and their applications, IST Austria, 418p.
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed