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.

405 Publications


2022 | Journal Article | IST-REx-ID: 10731 | OA
Svoboda J, Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2022. Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. 12(1), 1526.
View | Files available | DOI | arXiv
 

2022 | Journal Article | IST-REx-ID: 9311 | OA
Chatterjee K, Saona Urmeneta RJ, Ziliotto B. 2022. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 47(1), 100–119.
View | DOI | Download Preprint (ext.) | arXiv
 

2022 | Journal Article | IST-REx-ID: 11402 | OA
Chatterjee K, Doyen L. 2022. Graph planning with expected finite horizon. Journal of Computer and System Sciences. 129, 1–21.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2022 | Conference Paper | IST-REx-ID: 11459 | OA
Zikelic D, Chang B-YE, Bolignano P, Raimondi F. 2022. Differential cost analysis with simultaneous potentials and anti-potentials. Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 442–457.
View | Files available | DOI | arXiv
 

2022 | Journal Article | IST-REx-ID: 10770 | OA
Graham T, Kleshnina M, Filar JA. 2022. Where do mistakes lead? A survey of games with incompetent players. Dynamic Games and Applications.
View | Files available | DOI
 

2021 | Journal Article | IST-REx-ID: 10602 | OA
Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2021. Index appearance record with preorders. Acta Informatica.
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10629 | OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Quantitative verification on product graphs of small treewidth. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 42.
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10630 | OA
Arrighi E, Fernau H, Hoffmann S, Holzer M, Jecker IR, De Oliveira Oliveira M, Wolf P. 2021. On the complexity of intersection non-emptiness for star-free language classes. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 34.
View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10694 | OA
Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 8793 | OA
Zeiner M, Schmid U, Chatterjee K. 2021. Optimal strategies for selecting coordinators. Discrete Applied Mathematics. 289(1), 392–415.
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10002 | OA
Chatterjee K, Dvorak W, Henzinger M, Svozil A. 2021. Symbolic time and space tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10004 | OA
Chatterjee K, Doyen L. 2021. Stochastic processes with expected stopping time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 10191 | OA
Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 5(OOPSLA), 164.
View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee K, Goharshady EK, Novotný P, Zárevúcky J, Žikelić Đ. 2021. On lexicographic proof rules for probabilistic termination. 24th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 9293
Chatterjee K, Dvořák W, Henzinger M, Svozil A. 2021. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 297(8), 103499.
View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 9296 | OA
Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2021. On compatible matchings. 15th International Conference on Algorithms and Computation. WALCOM: Algorithms and Computation, LNCS, vol. 12635, 221–233.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Book Chapter | IST-REx-ID: 9403 | OA
Schmid L, Hilbe C. 2021.The evolution of strategic ignorance in strategic interaction. In: Deliberate Ignorance: Choosing Not To Know. vol. 29, 139–152.
View | Download Published Version (ext.)
 

2021 | Journal Article | IST-REx-ID: 9640 | OA
Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2021. Fast and strong amplifiers of natural selection. Nature Communications. 12(1), 4009.
View | Files available | DOI | PubMed | Europe PMC
 

2021 | Conference Paper | IST-REx-ID: 9644 | OA
Chatterjee K, Goharshady EK, Novotný P, Zikelic D. 2021. Proving non-termination by program reversal. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 1033–1048.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 9645 | OA
Asadi A, Chatterjee K, Fu H, Goharshady AK, Mahdavi M. 2021. Polynomial reachability witnesses via Stellensätze. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 772–787.
View | DOI | Download Submitted Version (ext.)
 

2021 | Conference Paper | IST-REx-ID: 9646 | OA
Wang J, Sun Y, Fu H, Chatterjee K, Goharshady AK. 2021. Quantitative analysis of assertion violations in probabilistic programs. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 1171–1186.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 9997 | OA
Schmid L, Shati P, Hilbe C, Chatterjee K. 2021. The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. 11(1), 17443.
View | Files available | DOI | PubMed | Europe PMC
 

2021 | Conference Paper | IST-REx-ID: 9987 | OA
Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. 2021. Stateless model checking under a reads-value-from equivalence. 33rd International Conference on Computer-Aided Verification . CAV: Computer Aided Verification , LNCS, vol. 12759, 341–366.
View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10052 | OA
Jecker IR, Mazzocchi N, Wolf P. 2021. Decomposing permutation automata. 32nd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 203, 18.
View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10075 | OA
Guha S, Jecker IR, Lehtinen K, Zimmermann M. 2021. A bit of nondeterminism makes pushdown automata expressive and succinct. 46th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 202, 53.
View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10055 | OA
Jecker IR. 2021. A Ramsey theorem for finite monoids. 38th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 187, 44.
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10667 | OA
Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, .
View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2021 | Thesis | IST-REx-ID: 10293
Schmid L. 2021. Evolution of cooperation via (in)direct reciprocity under imperfect information. IST Austria.
View | Files available | DOI
 

2021 | Journal Article | IST-REx-ID: 9402
Schmid L, Chatterjee K, Hilbe C, Nowak MA. 2021. A unified framework of direct and indirect reciprocity. Nature Human Behaviour. 5(10), 1292–1302.
View | Files available | DOI | PubMed | Europe PMC
 

2021 | Conference Paper | IST-REx-ID: 10847 | OA
Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. 2021. Solving partially observable stochastic shortest-path games. 30th International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conferences on Artificial Intelligence Organization, 4182–4189.
View | DOI | Download Published Version (ext.)
 

2021 | Thesis | IST-REx-ID: 10199 | OA
Toman V. 2021. Improved verification techniques for concurrent systems. IST Austria.
View | Files available | DOI
 

2021 | Journal Article | IST-REx-ID: 9393
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 57, 401–428.
View | DOI
 

2021 | Conference Paper | IST-REx-ID: 10054 | OA
Chatterjee K, Henzinger MH, Kale SS, Svozil A. 2021. Faster algorithms for bounded liveness in graphs and game graphs. 48th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 198, 124.
View | Files available | DOI
 

2021 | Thesis | IST-REx-ID: 8934 | OA
Goharshady AK. 2021. Parameterized and algebro-geometric advances in static program analysis. IST Austria.
View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 7955 | OA
Ashok P, Chatterjee K, Kretinsky J, Weininger M, Winkler T. 2020. Approximating values of generalized-reachability stochastic games. Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science . LICS: Symposium on Logic in Computer Science, 102–115.
View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8193
Chatterjee K, Chmelik M, Karkhanis D, Novotný P, Royer A. 2020. Multiple-environment Markov decision processes: Efficient analysis and applications. Proceedings of the 30th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 30, 48–56.
View | Files available
 

2020 | Conference Paper | IST-REx-ID: 8272 | OA
Chatterjee K, Katoen JP, Weininger M, Winkler T. 2020. Stochastic games with lexicographic reachability-safety objectives. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 12225, 398–420.
View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8533 | OA
Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 22:1-22:13.
View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8534 | OA
Jecker IR, Kupferman O, Mazzocchi N. 2020. Unary prime languages. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 51:1-51:12.
View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 8600 | OA
Chatterjee K, Henzinger TA, Otop J. 2020. Multi-dimensional long-run average problems for vector addition systems with states. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 23.
View | Files available | DOI | arXiv
 

2020 | Thesis | IST-REx-ID: 7196 | OA
Tkadlec J. 2020. A role of graphs in evolutionary processes. IST Austria.
View | Files available | DOI
 

2020 | Journal Article | IST-REx-ID: 7212 | OA
Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2020. Limits on amplifiers of natural selection under death-Birth updating. PLoS computational biology. 16, e1007494.
View | Files available | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 7343 | OA
Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. 2020. Social immunity modulates competition between coinfecting pathogens. Ecology Letters. 23(3), 565–574.
View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 7346 | OA
Schmid L, Chatterjee K, Schmid S. 2020. The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. Proceedings of the 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153, 21.
View | Files available | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 8671 | OA
Shakiba A, Goharshady AK, Hooshmandasl MR, Alambardar Meybodi M. 2020. A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. 15(2), 117–128.
View | Files available | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 8767 | OA
Kaveh K, McAvoy A, Chatterjee K, Nowak MA. 2020. The Moran process on 2-chromatic graphs. PLOS Computational Biology. 16(11), e1008402.
View | Files available | DOI
 

2020 | Journal Article | IST-REx-ID: 8788
Pavlogiannis A, Schaumberger N, Schmid U, Chatterjee K. 2020. Precedence-aware automated competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 39(11), 3981–3992.
View | DOI
 

2020 | Journal Article | IST-REx-ID: 8789 | OA
Kleshnina M, Streipert S, Filar J, Chatterjee K. 2020. Prioritised learning in snowdrift-type games. Mathematics. 8(11), 1945.
View | Files available | DOI
 

2020 | Journal Article | IST-REx-ID: 9197
Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805.
View | DOI | arXiv
 

2020 | Research Data Reference | IST-REx-ID: 9814
Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2020. Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners, Royal Society, 10.6084/m9.figshare.5973013.v1.
View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 8728 | OA
Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. 2020. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 12302, 253–270.
View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 8089 | OA
Chatterjee K, Fu H, Goharshady AK, Goharshady EK. 2020. Polynomial invariant generation for non-deterministic recursive programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 672–687.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2020 | Conference Paper | IST-REx-ID: 7810 | OA
Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2020. Optimal and perfectly parallel algorithms for on-demand data-flow analysis. European Symposium on Programming. ESOP: Programming Languages and Systems, LNCS, vol. 12075, 112–140.
View | Files available | DOI
 

2020 | Journal Article | IST-REx-ID: 6918 | OA
Goharshady AK, Mohammadi F. 2020. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 193, 106665.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2019 | Preprint | IST-REx-ID: 7950 | OA
Biniaz A, Jain K, Lubiw A, Masárová Z, Miltzow T, Mondal D, Naredla AM, Tkadlec J, Turcotte A. Token swapping on trees. arXiv, 1903.06981.
View | Files available | Download Preprint (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 5948
Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs. International Conference on Verification, Model Checking, and Abstract Interpretation. VMCAI: Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 11388, 468–490.
View | DOI | Download Preprint (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 7183 | OA
Brázdil T, Chatterjee K, Kucera A, Novotný P, Velan D. 2019. Deciding fast termination for probabilistic VASS with nondeterminism. International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated TEchnology for Verification and Analysis, LNCS, vol. 11781, 462–478.
View | DOI | Download Preprint (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 7210 | OA
Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2019. Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. 2, 138.
View | Files available | DOI | PubMed | Europe PMC
 

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 | Journal Article | IST-REx-ID: 6836 | OA
Hauser OP, Hilbe C, Chatterjee K, Nowak MA. 2019. Social dilemmas among unequals. Nature. 572(7770), 524–527.
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: 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 Preprint (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 10190 | OA
Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 124.
View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 7402 | OA
Chatterjee K, Doyen L. 2019. Graph planning with expected finite horizon. 34th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.
View | Files available | DOI | Download Preprint (ext.) | 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: 6887 | OA
Chatterjee K, Dvorák W, Henzinger MH, 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: 6378 | OA
Chatterjee K, Goharshady AK, Pourdamghani A. 2019. 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 | 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. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 204–220.
View | Files available | DOI | arXiv
 

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: 6490 | OA
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 | Files available | DOI
 

2019 | Journal Article | IST-REx-ID: 7158 | OA
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 | Files available | DOI
 

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 | Files available | DOI | Download Preprint (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 7014 | OA
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 | Files available | DOI | Download Preprint (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6780 | OA
Huang M, Fu H, Chatterjee K, Goharshady AK. 2019. 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 vol. 3, 129.
View | Files available | DOI | arXiv
 

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
 

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, Novotný P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2, 34.
View | DOI | Download Preprint (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 Preprint (ext.) | arXiv
 

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 Preprint (ext.) | arXiv
 

2018 | Book Chapter | IST-REx-ID: 86 | OA
Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time. In: Principles of Modeling. LNCS, vol. 10760, 143–161.
View | Files available | DOI
 

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 | 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 Preprint (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 | Book Chapter | IST-REx-ID: 59
Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis. In: Handbook of Model Checking. , 921–962.
View | 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 | 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 Submitted Version (ext.) | 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 | 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 | 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), 20180073.
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 143 | OA
Brázdil T, Chatterjee K, Kučera A, Novotný 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 Preprint (ext.)
 

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 Submitted Version (ext.) | PubMed | Europe PMC
 

2018 | Conference Paper | IST-REx-ID: 24 | OA
Chatterjee K, Elgyütt A, Novotný 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 Preprint (ext.) | arXiv
 

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 | Files available | Download None (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 | Conference Paper | IST-REx-ID: 25 | OA
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 | Download Published Version (ext.)
 

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, 2341–2356.
View | DOI | Download Preprint (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 10883 | OA
Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2018. Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253.
View | Files available | DOI | arXiv
 

2018 | Conference Paper | IST-REx-ID: 141 | OA
Chatterjee K, Henzinger MH, 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 | Conference Paper | IST-REx-ID: 66 | OA
Chatterjee K, Goharshady AK, 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 | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications