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.

459 Publications


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.
[Published Version] View | Files available | DOI | WoS
 

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.
[Published Version] View | Files available | DOI | WoS | 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.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Thesis | IST-REx-ID: 10199 | OA
Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria.
[Published Version] View | Files available | DOI
 

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

2021 | Journal Article | IST-REx-ID: 9393 | OA
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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

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

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

2021 | Research Data Reference | IST-REx-ID: 15284 | OA
Chatterjee K, Goharshady AK, Novotný P, Zikelic D. 2021. RevTerm, Association for Computing Machinery, 10.1145/3410304.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2021 | Thesis | IST-REx-ID: 8934 | OA
Goharshady AK. 2021. Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria.
[Published Version] View | Files available | DOI
 

2021 | Thesis | IST-REx-ID: 10293 | OA
Schmid L. 2021. Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria.
[Published Version] View | Files available | DOI
 

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.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

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

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.
[Preprint] View | Files available | DOI | arXiv
 

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.
[Published Version] 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.
[Published Version] 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.
[Published Version] 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.
[Published Version] View | Files available | DOI | WoS | 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.
[Published Version] View | Files available | DOI | WoS
 

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.
[Published Version] View | Files available | DOI | WoS
 

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 | WoS
 

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.
[Preprint] View | 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.
[Published Version] View | Files available | DOI | WoS
 

2020 | Research Data Reference | IST-REx-ID: 13060 | OA
Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. 2020. Social immunity modulates competition between coinfecting pathogens, Dryad, 10.5061/DRYAD.CRJDFN318.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

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.
[Published Version] View | Files available | DOI | WoS | 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.
[Submitted Version] View | Files available | DOI | arXiv
 

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.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2020 | Thesis | IST-REx-ID: 7196 | OA
Tkadlec J. 2020. A role of graphs in evolutionary processes. Institute of Science and Technology Austria.
[Published Version] View | Files available | DOI
 

2020 | Research Data Reference | IST-REx-ID: 9814 | OA
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.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2020 | Conference Paper | IST-REx-ID: 8324 | OA
Wang P, Fu H, Chatterjee K, Deng Y, Xu M. 2020. Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. Proceedings of the ACM on Programming Languages. vol. 4, 25.
[Published Version] View | Files available | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 15055 | OA
Brázdil T, Chatterjee K, Novotný P, Vahala J. 2020. Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. 34(06), 9794–9801.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2020 | Conference Paper | IST-REx-ID: 15082 | OA
Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 56.
[Published Version] View | Download Published Version (ext.)
 

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.
[Published Version] View | Files available | DOI | WoS
 

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.
[Submitted Version] View | Files available | DOI | WoS
 

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

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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | 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.
[Published Version] 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.
[Published Version] 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.
[Published Version] View | Files available | DOI
 

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.
[Published Version] View | Files available | DOI | 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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | 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.
[Published Version] View | Files available | DOI | WoS
 

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.
[Submitted Version] View | Files available | DOI | WoS
 

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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | 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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | 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.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

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.
[Published Version] 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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | 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.
[Preprint] View | Files available | 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.
[Published Version] 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.
[Published Version] 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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

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.
[Submitted Version] View | Files available | DOI | WoS
 

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.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 

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.
[Submitted Version] View | Files available | DOI | WoS
 

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.
[Submitted Version] View | Files available | DOI | WoS
 

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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | 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.
[Published Version] View | Files available | DOI | arXiv
 

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.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

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 | 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.
[Submitted Version] 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.
[Published Version] View | Files available | DOI | WoS
 

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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 

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.
[Submitted Version] View | Files available | DOI | WoS
 

2018 | Conference Paper | IST-REx-ID: 310 | OA
Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. SODA: Symposium on Discrete Algorithms, 2341–2356.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | 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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | 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.
[Submitted Version] View | Files available | DOI | WoS
 

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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

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.
[Published Version] View | Files available | DOI | WoS
 

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.
[Published Version] View | Files available | DOI | WoS
 

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.
[Submitted Version] View | Files available | DOI | WoS
 

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.
[Submitted Version] View | Files available | DOI | WoS
 

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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 

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.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 

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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | 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.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 

2018 | Conference Paper | IST-REx-ID: 35 | OA
Chatterjee K, Dvorák W, Henzinger MH, 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.) | WoS | 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.
[Published Version] View | Files available | DOI | WoS
 

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.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

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.
[Published Version] View | Files available | DOI | WoS
 

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.
[Published Version] View | Files available | DOI | arXiv
 

2018 | Conference Paper | IST-REx-ID: 311 | OA
Chatterjee K, Goharshady AK, Velner Y. 2018. Quantitative analysis of smart contracts. ESOP: European Symposium on Programming, LNCS, vol. 10801, 739–767.
[Published Version] View | Files available | DOI
 

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.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 

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

2018 | Conference Paper | IST-REx-ID: 5977 | OA
Chatterjee K, Fu H, Goharshady AK, Okati N. 2018. Computational approaches for stochastic shortest path on succinct MDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4700–4707.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | PubMed | Europe PMC
 

2017 | Journal Article | IST-REx-ID: 10418 | OA
Mciver A, Morgan C, Kaminski BL, Katoen JP. 2017. A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. 2(POPL), 33.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 464 | OA
Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.
[Published Version] View | Files available | DOI | arXiv
 

2017 | Journal Article | IST-REx-ID: 466 | OA
Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.
[Published Version] View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 467 | OA
Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 465 | OA
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).
[Published Version] View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 512 | OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1), 82.
[Published Version] View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 10416 | OA
Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2(POPL), 30.
[Published Version] View | Files available | DOI | arXiv
 

2017 | Technical Report | IST-REx-ID: 5455 | OA
Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and alias analysis, IST Austria, 37p.
[Published Version] View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 10417 | OA
Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2(POPL), 31.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2017 | Technical Report | IST-REx-ID: 5456 | OA
Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction, IST Austria, 36p.
[Published Version] View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 551 | OA
Chatterjee K, Ibsen-Jensen R, Nowak M. 2017. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 61.
[Published Version] View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 552 | OA
Chatterjee K, Henzinger MH, Svozil A. 2017. Faster algorithms for mean-payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 39.
[Published Version] View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 553 | OA
Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 55.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

Filters and Search Terms

department=KrCh

Search

Filter Publications