Krishnendu Chatterjee

Chatterjee Group

431 Publications

Mark all

[431]
2024 | Conference Paper | IST-REx-ID: 15006 | OA
Hirvonen, Juho, Laura Schmid, Krishnendu Chatterjee, and Stefan Schmid. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.” In 27th International Conference on Principles of Distributed Systems, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.OPODIS.2023.11.
[Published Version] View | Files available | DOI | arXiv
 
[430]
2024 | Journal Article | IST-REx-ID: 15083 | OA
Hübner, Valentin, Manuel Staab, Christian Hilbe, Krishnendu Chatterjee, and Maria Kleshnina. “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.” Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences, 2024. https://doi.org/10.1073/pnas.2315558121.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
[429]
2024 | Journal Article | IST-REx-ID: 15297 | OA
Svoboda, Jakub, Soham Shrikant Joshi, Josef Tkadlec, and Krishnendu Chatterjee. “Amplifiers of Selection for the Moran Process with Both Birth-Death and Death-Birth Updating.” PLoS Computational Biology. Public Library of Science, 2024. https://doi.org/10.1371/journal.pcbi.1012008.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[428]
2023 | Conference Paper | IST-REx-ID: 12676 | OA
Chatterjee, Krishnendu, Tobias Meggendorfer, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Faster Algorithm for Turn-Based Stochastic Games with Bounded Treewidth.” In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, 4590–4605. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/1.9781611977554.ch173.
[Published Version] View | DOI | Download Published Version (ext.)
 
[427]
2023 | Conference Paper | IST-REx-ID: 13142 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.” In Tools and Algorithms for the Construction and Analysis of Systems , 13993:3–25. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30823-9_1.
[Published Version] View | Files available | DOI
 
[426]
2023 | Journal Article | IST-REx-ID: 12787 | OA
Svoboda, Jakub, Josef Tkadlec, Kamran Kaveh, and Krishnendu Chatterjee. “Coexistence Times in the Moran Process with Environmental Heterogeneity.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. The Royal Society, 2023. https://doi.org/10.1098/rspa.2022.0685.
[Published Version] View | Files available | DOI | WoS
 
[425]
2023 | Journal Article | IST-REx-ID: 12861 | OA
Schmid, Laura, Farbod Ekbatani, Christian Hilbe, and Krishnendu Chatterjee. “Quantitative Assessment Can Stabilize Indirect Reciprocity under Imperfect Information.” Nature Communications. Springer Nature, 2023. https://doi.org/10.1038/s41467-023-37817-x.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[424]
2023 | Conference Paper | IST-REx-ID: 14242 | OA
Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, Thomas A Henzinger, and Daniela Rus. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.” In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 37:14964–73. Association for the Advancement of Artificial Intelligence, 2023. https://doi.org/10.1609/aaai.v37i12.26747.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[423]
2023 | Conference Paper | IST-REx-ID: 14318 | OA
Sun, Yican, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.” In Computer Aided Verification, 13966:16–39. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37709-9_2.
[Published Version] View | Files available | DOI
 
[422]
2023 | Conference Paper | IST-REx-ID: 14317 | OA
Akshay, S., Krishnendu Chatterjee, Tobias Meggendorfer, and Dorde Zikelic. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.” In International Conference on Computer Aided Verification, 13966:86–112. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37709-9_5.
[Published Version] View | Files available | DOI
 
[421]
2023 | Journal Article | IST-REx-ID: 12738 | OA
Chatterjee, Krishnendu, Joost P Katoen, Stefanie Mohr, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Objectives.” Formal Methods in System Design. Springer Nature, 2023. https://doi.org/10.1007/s10703-023-00411-4.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 
[420]
2023 | Conference Paper | IST-REx-ID: 14417 | OA
Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Entropic Risk for Turn-Based Stochastic Games.” In 48th International Symposium on Mathematical Foundations of Computer Science, Vol. 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.MFCS.2023.15.
[Published Version] View | Files available | DOI | arXiv
 
[419]
2023 | Conference Paper | IST-REx-ID: 14559
Ansaripour, Matin, Krishnendu Chatterjee, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.” In 21st International Symposium on Automated Technology for Verification and Analysis, 14215:357–79. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-45329-8_17.
View | DOI
 
[418]
2023 | Journal Article | IST-REx-ID: 14657 | OA
Tkadlec, Josef, Kamran Kaveh, Krishnendu Chatterjee, and Martin A. Nowak. “Evolutionary Dynamics of Mutants That Modify Population Structure.” Journal of the Royal Society, Interface. The Royal Society, 2023. https://doi.org/10.1098/rsif.2023.0355.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
[417]
2023 | Journal Article | IST-REx-ID: 13258 | OA
Kleshnina, Maria, Christian Hilbe, Stepan Simsa, Krishnendu Chatterjee, and Martin A. Nowak. “The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games.” Nature Communications. Springer Nature, 2023. https://doi.org/10.1038/s41467-023-39625-9.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[416]
2023 | Conference Paper | IST-REx-ID: 14736
Bastankhah, Mahsa, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control.” In 27th International Conference on Financial Cryptography and Data Security, 13950:309–25. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-47754-6_18.
View | DOI
 
[415]
2023 | Journal Article | IST-REx-ID: 14778 | OA
Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.” Formal Aspects of Computing. Association for Computing Machinery, 2023. https://doi.org/10.1145/3585391.
[Published Version] View | Files available | DOI | arXiv
 
[414]
2023 | Conference Paper | IST-REx-ID: 14830
Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 37:11926–35. Association for the Advancement of Artificial Intelligence, 2023. https://doi.org/10.1609/aaai.v37i10.26407.
[Preprint] View | Files available | DOI | arXiv
 
[413]
2023 | Conference Paper | IST-REx-ID: 15023 | OA
Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” In 37th Conference on Neural Information Processing Systems, 2023.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[412]
2022 | Conference Paper | IST-REx-ID: 12102 | OA
Ahmadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi Hemami, and Dorde Zikelic. “Algorithms and Hardness Results for Computing Cores of Markov Chains.” In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29.
[Published Version] View | Files available | DOI
 
[411]
2022 | Conference Paper | IST-REx-ID: 12101 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Complexity of Spatial Games.” In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11.
[Published Version] View | Files available | DOI
 
[410]
2022 | Preprint | IST-REx-ID: 12677 | OA
Chatterjee, Krishnendu, Mona Mohammadi, and Raimundo J Saona Urmeneta. “Repeated Prophet Inequality with Near-Optimal Bounds.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2209.14368.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[409]
2022 | Journal Article | IST-REx-ID: 10731 | OA
Svoboda, Jakub, Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Infection Dynamics of COVID-19 Virus under Lockdown and Reopening.” Scientific Reports. Springer Nature, 2022. https://doi.org/10.1038/s41598-022-05333-5.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[408]
2022 | Journal Article | IST-REx-ID: 12257 | OA
Chatterjee, Krishnendu, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, and Josef Tkadlec. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.” Physical Review E. American Physical Society, 2022. https://doi.org/10.1103/physreve.106.034321.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[407]
2022 | Journal Article | IST-REx-ID: 12280 | OA
Schmid, Laura, Christian Hilbe, Krishnendu Chatterjee, and Martin Nowak. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.” PLOS Computational Biology. Public Library of Science, 2022. https://doi.org/10.1371/journal.pcbi.1010149.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[406]
2022 | Journal Article | IST-REx-ID: 9311 | OA
Chatterjee, Krishnendu, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics of Operations Research. Institute for Operations Research and the Management Sciences, 2022. https://doi.org/10.1287/moor.2020.1116.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[405]
2022 | Journal Article | IST-REx-ID: 11402 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” Journal of Computer and System Sciences. Elsevier, 2022. https://doi.org/10.1016/j.jcss.2022.04.003.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[404]
2022 | Conference Paper | IST-REx-ID: 12000 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Tobias Meggendorfer, and Dorde Zikelic. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.” In Proceedings of the 34th International Conference on Computer Aided Verification, 13371:55–78. Springer, 2022. https://doi.org/10.1007/978-3-031-13185-1_4.
[Published Version] View | Files available | DOI | WoS
 
[403]
2022 | Journal Article | IST-REx-ID: 12511 | OA
Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, and Thomas A Henzinger. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i7.20695.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[402]
2022 | Preprint | IST-REx-ID: 14601 | OA
Zikelic, Dorde, Mathias Lechner, Krishnendu Chatterjee, and Thomas A Henzinger. “Learning Stabilizing Policies in Stochastic Control Systems.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2205.11991.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[401]
2022 | Preprint | IST-REx-ID: 14600 | OA
Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2210.05308.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[400]
2021 | Conference Paper | IST-REx-ID: 10054 | OA
Chatterjee, Krishnendu, Monika H Henzinger, Sagar Sudhir Kale, and Alexander Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” In 48th International Colloquium on Automata, Languages, and Programming, Vol. 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.ICALP.2021.124.
[Published Version] View | Files available | DOI
 
[399]
2021 | Conference Paper | IST-REx-ID: 10629 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Quantitative Verification on Product Graphs of Small Treewidth.” In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42.
[Published Version] View | Files available | DOI
 
[398]
2021 | Conference Paper | IST-REx-ID: 10847 | OA
Tomášek, Petr, Karel Horák, Aditya Aradhye, Branislav Bošanský, and Krishnendu Chatterjee. “Solving Partially Observable Stochastic Shortest-Path Games.” In 30th International Joint Conference on Artificial Intelligence, 4182–89. International Joint Conferences on Artificial Intelligence, 2021. https://doi.org/10.24963/ijcai.2021/575.
[Published Version] View | DOI | Download Published Version (ext.)
 
[397]
2021 | Conference Paper | IST-REx-ID: 12767 | OA
Bansal, Suguman, Krishnendu Chatterjee, and Moshe Y. Vardi. “On Satisficing in Quantitative Games.” In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12651:20–37. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-72016-2.
[Published Version] View | Files available | DOI | arXiv
 
[396]
2021 | Conference Paper | IST-REx-ID: 10667 | OA
Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In 35th Conference on Neural Information Processing Systems, 2021. https://doi.org/10.48550/arXiv.2111.03165.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[395]
2021 | Journal Article | IST-REx-ID: 8793 | OA
Zeiner, Martin, Ulrich Schmid, and Krishnendu Chatterjee. “Optimal Strategies for Selecting Coordinators.” Discrete Applied Mathematics. Elsevier, 2021. https://doi.org/10.1016/j.dam.2020.10.022.
[Published Version] View | Files available | DOI | WoS
 
[394]
2021 | Journal Article | IST-REx-ID: 9381 | OA
Kleshnina, Maria, Sabrina S. Streipert, Jerzy A. Filar, and Krishnendu Chatterjee. “Mistakes Can Stabilise the Dynamics of Rock-Paper-Scissors Games.” PLoS Computational Biology. Public Library of Science, 2021. https://doi.org/10.1371/journal.pcbi.1008523.
[Published Version] View | Files available | DOI | WoS
 
[393]
2021 | Journal Article | IST-REx-ID: 9640 | OA
Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Fast and Strong Amplifiers of Natural Selection.” Nature Communications. Springer Nature, 2021. https://doi.org/10.1038/s41467-021-24271-w.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[392]
2021 | Conference Paper | IST-REx-ID: 9646 | OA
Wang, Jinyi, Yican Sun, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 1171–86. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454102.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[391]
2021 | Conference Paper | IST-REx-ID: 9645 | OA
Asadi, Ali, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, and Mohammad Mahdavi. “Polynomial Reachability Witnesses via Stellensätze.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 772–87. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454076.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[390]
2021 | Conference Paper | IST-REx-ID: 10002 | OA
Chatterjee, Krishnendu, Wolfgang Dvorak, Monika H Henzinger, and Alexander Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470739.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[389]
2021 | Conference Paper | IST-REx-ID: 10004 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470595.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[388]
2021 | Conference Paper | IST-REx-ID: 9987 | OA
Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.” In 33rd International Conference on Computer-Aided Verification , 12759:341–66. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-81685-8_16.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[387]
2021 | Journal Article | IST-REx-ID: 10191 | OA
Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2021. https://doi.org/10.1145/3485541.
[Published Version] View | Files available | DOI | arXiv
 
[386]
2021 | Journal Article | IST-REx-ID: 9293 | OA
Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” Artificial Intelligence. Elsevier, 2021. https://doi.org/10.1016/j.artint.2021.103499.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[385]
2021 | Journal Article | IST-REx-ID: 9393 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design. Springer, 2021. https://doi.org/10.1007/s10703-021-00373-5.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[384]
2021 | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.” In 24th International Symposium on Formal Methods, 13047:619–39. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90870-6_33.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[383]
2021 | Conference Paper | IST-REx-ID: 9644 | OA
Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “Proving Non-Termination by Program Reversal.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 1033–48. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454093.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[382]
2021 | Research Data Reference | IST-REx-ID: 15284 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “RevTerm.” Association for Computing Machinery, 2021. https://doi.org/10.1145/3410304.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[381]
2021 | Journal Article | IST-REx-ID: 9997 | OA
Schmid, Laura, Pouya Shati, Christian Hilbe, and Krishnendu Chatterjee. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” Scientific Reports. Springer Nature, 2021. https://doi.org/10.1038/s41598-021-96932-1.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[380]
2021 | Journal Article | IST-REx-ID: 9402 | OA
Schmid, Laura, Krishnendu Chatterjee, Christian Hilbe, and Martin A. Nowak. “A Unified Framework of Direct and Indirect Reciprocity.” Nature Human Behaviour. Springer Nature, 2021. https://doi.org/10.1038/s41562-021-01114-8.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[379]
2020 | Conference Paper | IST-REx-ID: 7346 | OA
Schmid, Laura, Krishnendu Chatterjee, and Stefan Schmid. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” In Proceedings of the 23rd International Conference on Principles of Distributed Systems, Vol. 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21.
[Preprint] View | Files available | DOI | arXiv
 
[378]
2020 | Conference Paper | IST-REx-ID: 8600 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23.
[Published Version] View | Files available | DOI | arXiv
 
[377]
2020 | Conference Paper | IST-REx-ID: 8533 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.22.
[Published Version] View | Files available | DOI | arXiv
 
[376]
2020 | Conference Paper | IST-REx-ID: 7955 | OA
Ashok, Pranav, Krishnendu Chatterjee, Jan Kretinsky, Maximilian Weininger, and Tobias Winkler. “Approximating Values of Generalized-Reachability Stochastic Games.” In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , 102–15. Association for Computing Machinery, 2020. https://doi.org/10.1145/3373718.3394761.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[375]
2020 | Journal Article | IST-REx-ID: 8767 | OA
Kaveh, Kamran, Alex McAvoy, Krishnendu Chatterjee, and Martin A. Nowak. “The Moran Process on 2-Chromatic Graphs.” PLOS Computational Biology. Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1008402.
[Published Version] View | Files available | DOI | WoS
 
[374]
2020 | Journal Article | IST-REx-ID: 8789 | OA
Kleshnina, Maria, Sabrina Streipert, Jerzy Filar, and Krishnendu Chatterjee. “Prioritised Learning in Snowdrift-Type Games.” Mathematics. MDPI, 2020. https://doi.org/10.3390/math8111945.
[Published Version] View | Files available | DOI | WoS
 
[373]
2020 | Journal Article | IST-REx-ID: 8788
Pavlogiannis, Andreas, Nico Schaumberger, Ulrich Schmid, and Krishnendu Chatterjee. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE, 2020. https://doi.org/10.1109/TCAD.2020.3012803.
View | DOI | WoS
 
[372]
2020 | Conference Paper | IST-REx-ID: 8193
Chatterjee, Krishnendu, Martin Chmelik, Deep Karkhanis, Petr Novotný, and Amélie Royer. “Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.” In Proceedings of the 30th International Conference on Automated Planning and Scheduling, 30:48–56. Association for the Advancement of Artificial Intelligence, 2020.
View | Files available
 
[371]
2020 | Conference Paper | IST-REx-ID: 8272 | OA
Chatterjee, Krishnendu, Joost P Katoen, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” In International Conference on Computer Aided Verification, 12225:398–420. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-53291-8_21.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[370]
2020 | Journal Article | IST-REx-ID: 7212 | OA
Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.” PLoS Computational Biology. Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1007494.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[369]
2020 | Research Data Reference | IST-REx-ID: 9814 | OA
Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners.” Royal Society, 2020. https://doi.org/10.6084/m9.figshare.5973013.v1.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[368]
2020 | Conference Paper | IST-REx-ID: 8324 | OA
Wang, Peixin, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, and Ming Xu. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.” In Proceedings of the ACM on Programming Languages, Vol. 4. ACM, 2020. https://doi.org/10.1145/3371093.
[Published Version] View | Files available | DOI | arXiv
 
[367]
2020 | Journal Article | IST-REx-ID: 15055 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Petr Novotný, and Jiří Vahala. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” Proceedings of the 34th AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i06.6531.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[366]
2020 | Conference Paper | IST-REx-ID: 7810 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.” In European Symposium on Programming, 12075:112–40. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-44914-8_5.
[Published Version] View | Files available | DOI | WoS
 
[365]
2020 | Conference Paper | IST-REx-ID: 8728 | OA
Asadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.” In Automated Technology for Verification and Analysis, 12302:253–70. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-59152-6_14.
[Submitted Version] View | Files available | DOI | WoS
 
[364]
2020 | Conference Paper | IST-REx-ID: 8089 | OA
Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “Polynomial Invariant Generation for Non-Deterministic Recursive Programs.” In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, 672–87. Association for Computing Machinery, 2020. https://doi.org/10.1145/3385412.3385969.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[363]
2019 | Conference Paper | IST-REx-ID: 6887 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7.
[Published Version] View | Files available | DOI
 
[362]
2019 | Conference Paper | IST-REx-ID: 6885 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27.
[Published Version] View | Files available | DOI
 
[361]
2019 | Conference Paper | IST-REx-ID: 6889 | OA
Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6.
[Published Version] View | Files available | DOI
 
[360]
2019 | Conference Paper | IST-REx-ID: 5948
Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.” In International Conference on Verification, Model Checking, and Abstract Interpretation, 11388:468–90. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-11245-5_22.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[359]
2019 | Conference Paper | IST-REx-ID: 6462 | OA
Avni, Guy, Roderick Bloem, Krishnendu Chatterjee, Thomas A Henzinger, Bettina Konighofer, and Stefan Pranger. “Run-Time Optimization for Learned Controllers through Quantitative Games.” In 31st International Conference on Computer-Aided Verification, 11561:630–49. Springer, 2019. https://doi.org/10.1007/978-3-030-25540-4_36.
[Published Version] View | Files available | DOI | WoS
 
[358]
2019 | Journal Article | IST-REx-ID: 6836 | OA
Hauser, Oliver P., Christian Hilbe, Krishnendu Chatterjee, and Martin A. Nowak. “Social Dilemmas among Unequals.” Nature. Springer Nature, 2019. https://doi.org/10.1038/s41586-019-1488-5.
[Submitted Version] View | Files available | DOI | WoS
 
[357]
2019 | Conference Paper | IST-REx-ID: 6942 | OA
Ashok, Pranav, Tomáš Brázdil, Krishnendu Chatterjee, Jan Křetínský, Christoph Lampert, and Viktor Toman. “Strategy Representation by Decision Trees with Linear Classifiers.” In 16th International Conference on Quantitative Evaluation of Systems, 11785:109–28. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-30281-8_7.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[356]
2019 | Conference Paper | IST-REx-ID: 7183 | OA
Brázdil, Tomás, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, and Dominik Velan. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.” In International Symposium on Automated Technology for Verification and Analysis, 11781:462–78. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-31784-3_27.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[355]
2019 | Journal Article | IST-REx-ID: 7210 | OA
Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.” Communications Biology. Springer Nature, 2019. https://doi.org/10.1038/s42003-019-0373-y.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[354]
2019 | Conference Paper | IST-REx-ID: 10190 | OA
Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric Dynamic Partial Order Reduction.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Vol. 3. ACM, 2019. https://doi.org/10.1145/3360550.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[353]
2019 | Conference Paper | IST-REx-ID: 7402 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” In 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. IEEE, 2019. https://doi.org/10.1109/lics.2019.8785706.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[352]
2019 | Conference Paper | IST-REx-ID: 6780 | OA
Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Vol. 3. ACM, 2019. https://doi.org/10.1145/3360555.
[Published Version] View | Files available | DOI | arXiv
 
[351]
2019 | Journal Article | IST-REx-ID: 6380 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.” Proceedings of the ACM on Programming Languages. ACM, 2019. https://doi.org/10.1145/3290366.
[Published Version] View | Files available | DOI
 
[350]
2019 | Conference Paper | IST-REx-ID: 6056 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” In IEEE International Conference on Blockchain and Cryptocurrency. IEEE, 2019. https://doi.org/10.1109/BLOC.2019.8751326.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[349]
2019 | Conference Paper | IST-REx-ID: 6378 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:374–81. ACM, 2019. https://doi.org/10.1145/3297280.3297319.
[Submitted Version] View | Files available | DOI | WoS
 
[348]
2019 | Conference Paper | IST-REx-ID: 6175 | OA
Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.” In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 204–20. Association for Computing Machinery, 2019. https://doi.org/10.1145/3314221.3314581.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[347]
2019 | Conference Paper | IST-REx-ID: 6490 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “The Treewidth of Smart Contracts.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:400–408. ACM, n.d. https://doi.org/10.1145/3297280.3297322.
[Submitted Version] View | Files available | DOI | WoS
 
[346]
2019 | Journal Article | IST-REx-ID: 7158 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3363525.
[Submitted Version] View | Files available | DOI | WoS
 
[345]
2019 | Journal Article | IST-REx-ID: 7014 | OA
Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3339984.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[344]
2018 | Conference Paper | IST-REx-ID: 10883 | OA
Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k.
[Published Version] View | Files available | DOI | arXiv
 
[343]
2018 | Conference Paper | IST-REx-ID: 325 | OA
Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,” Vol. 2. ACM, 2018. https://doi.org/10.1145/3158122.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[342]
2018 | Book Chapter | IST-REx-ID: 59
Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.” In Handbook of Model Checking, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_27.
View | DOI
 
[341]
2018 | Book Chapter | IST-REx-ID: 86 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.” In Principles of Modeling, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. https://doi.org/10.1007/978-3-319-95246-8_9.
[Submitted Version] View | Files available | DOI
 
[340]
2018 | Journal Article | IST-REx-ID: 454 | OA
Reiter, Johannes, Christian Hilbe, David Rand, Krishnendu Chatterjee, and Martin Nowak. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-017-02721-8.
[Published Version] View | Files available | DOI | WoS
 
[339]
2018 | Conference Paper | IST-REx-ID: 143 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Antonín Kučera, Petr Novotný, Dominik Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS,” F138033:185–94. IEEE, 2018. https://doi.org/10.1145/3209108.3209191.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[338]
2018 | Journal Article | IST-REx-ID: 157 | OA
Hilbe, Christian, Štepán Šimsa, Krishnendu Chatterjee, and Martin Nowak. “Evolution of Cooperation in Stochastic Games.” Nature. Nature Publishing Group, 2018. https://doi.org/10.1038/s41586-018-0277-x.
[Submitted Version] View | Files available | DOI | WoS
 
[337]
2018 | Conference Paper | IST-REx-ID: 310 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter,” 2341–56. ACM, 2018. https://doi.org/10.1137/1.9781611975031.151.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[336]
2018 | Conference Paper | IST-REx-ID: 5679 | OA
Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.” edited by Sukyoung Ryu, 11275:181–201. Springer, 2018. https://doi.org/10.1007/978-3-030-02768-1_11.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[335]
2018 | Journal Article | IST-REx-ID: 419 | OA
Hilbe, Christian, Krishnendu Chatterjee, and Martin Nowak. “Partners and Rivals in Direct Reciprocity.” Nature Human Behaviour. Nature Publishing Group, 2018. https://doi.org/10.1038/s41562-018-0320-9.
[Submitted Version] View | Files available | DOI | WoS
 
[334]
2018 | Conference Paper | IST-REx-ID: 79 | OA
Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,” 11024:53–70. Springer, 2018. https://doi.org/10.1007/978-3-319-99154-2_4.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[333]
2018 | Conference Paper | IST-REx-ID: 297 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407. Springer, 2018. https://doi.org/10.1007/978-3-319-89960-2_21.
[Published Version] View | Files available | DOI | WoS
 
[332]
2018 | Conference Paper | IST-REx-ID: 141 | OA
Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,” 10982:178–97. Springer, 2018. https://doi.org/10.1007/978-3-319-96142-2_13.
[Published Version] View | Files available | DOI | WoS
 
[331]
2018 | Journal Article | IST-REx-ID: 5993 | OA
Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3174800.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
[330]
2018 | Conference Paper | IST-REx-ID: 25 | OA
Horák, Karel, Branislav Bošanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018–July:4764–70. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/662.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
[329]
2018 | Conference Paper | IST-REx-ID: 24 | OA
Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[328]
2018 | Conference Paper | IST-REx-ID: 34 | OA
Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[327]
2018 | Conference Paper | IST-REx-ID: 35 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In 28th International Conference on Automated Planning and Scheduling . AAAI Press, 2018.
View | Files available | Download None (ext.) | WoS | arXiv
 
[326]
2018 | Journal Article | IST-REx-ID: 738 | OA
Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4.
[Published Version] View | Files available | DOI | WoS
 
[325]
2018 | Journal Article | IST-REx-ID: 198 | OA
Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface. The Royal Society, 2018. https://doi.org/10.1098/rsif.2018.0073.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[324]
2018 | Journal Article | IST-REx-ID: 5751 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin A. Nowak. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology. Springer Nature, 2018. https://doi.org/10.1038/s42003-018-0078-7.
[Published Version] View | Files available | DOI | WoS
 
[323]
2018 | Conference Paper | IST-REx-ID: 66 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11.
[Published Version] View | Files available | DOI | arXiv
 
[322]
2018 | Conference Paper | IST-REx-ID: 311 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Yaron Velner. “Quantitative Analysis of Smart Contracts,” 10801:739–67. Springer, 2018. https://doi.org/10.1007/978-3-319-89884-1_26.
[Published Version] View | Files available | DOI
 
[321]
2018 | Conference Paper | IST-REx-ID: 6340 | OA
Goharshady, Amir Kafshdar, Ali Behrouz, and Krishnendu Chatterjee. “Secure Credit Reporting on the Blockchain.” In Proceedings of the IEEE International Conference on Blockchain, 1343–48. IEEE, 2018. https://doi.org/10.1109/Cybermatics_2018.2018.00231.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[320]
2018 | Journal Article | IST-REx-ID: 6009 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3210257.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[319]
2018 | Conference Paper | IST-REx-ID: 5977 | OA
Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Nastaran Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018:4700–4707. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/653.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[318]
2018 | Journal Article | IST-REx-ID: 2 | OA
Hilbe, Christian, Laura Schmid, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.” PNAS. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1810565115.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | PubMed | Europe PMC
 
[317]
2017 | Journal Article | IST-REx-ID: 464 | OA
Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.
[Published Version] View | Files available | DOI | arXiv
 
[316]
2017 | Journal Article | IST-REx-ID: 466 | OA
Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(2:15)2017.
[Published Version] View | Files available | DOI
 
[315]
2017 | Journal Article | IST-REx-ID: 467 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3152769.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[314]
2017 | Journal Article | IST-REx-ID: 465 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.
[Published Version] View | Files available | DOI
 
[313]
2017 | Journal Article | IST-REx-ID: 512 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports. Nature Publishing Group, 2017. https://doi.org/10.1038/s41598-017-00107-w.
[Published Version] View | Files available | DOI
 
[312]
2017 | Journal Article | IST-REx-ID: 10416 | OA
Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158118.
[Published Version] View | Files available | DOI | arXiv
 
[311]
2017 | Technical Report | IST-REx-ID: 5455 | OA
Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-870-v1-1.
[Published Version] View | Files available | DOI
 
[310]
2017 | Journal Article | IST-REx-ID: 10417 | OA
Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158119.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[309]
2017 | Technical Report | IST-REx-ID: 5456 | OA
Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-872-v1-1.
[Published Version] View | Files available | DOI
 
[308]
2017 | Conference Paper | IST-REx-ID: 551 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.
[Published Version] View | Files available | DOI
 
[307]
2017 | Conference Paper | IST-REx-ID: 552 | OA
Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39.
[Published Version] View | Files available | DOI
 
[306]
2017 | Conference Paper | IST-REx-ID: 553 | OA
Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[305]
2017 | Book Chapter | IST-REx-ID: 625 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.” In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017. https://doi.org/10.1007/978-3-319-63121-9_18.
[Submitted Version] View | Files available | DOI
 
[304]
2017 | Conference Paper | IST-REx-ID: 628 | OA
Chatterjee, Krishnendu, Hongfei Fu, and Aniket Murhekar. “Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds.” edited by Rupak Majumdar and Viktor Kunčak, 10426:118–39. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_6.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[303]
2017 | Conference Paper | IST-REx-ID: 645 | OA
Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_10.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[302]
2017 | Conference Paper | IST-REx-ID: 6519 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. https://doi.org/10.4230/LIPICS.CSL.2017.18.
[Published Version] View | Files available | DOI
 
[301]
2017 | Journal Article | IST-REx-ID: 653 | OA
Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Božić, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics. Nature Publishing Group, 2017. https://doi.org/10.1038/ng.3764.
[Submitted Version] View | Files available | DOI | PubMed | Europe PMC
 
[300]
2017 | Journal Article | IST-REx-ID: 671 | OA
Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak. “Memory-n Strategies of Direct Reciprocity.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1621239114.
[Published Version] View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 
[299]
2017 | Journal Article | IST-REx-ID: 681 | OA
Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean Raskin. “Doomsday Equilibria for Omega-Regular Games.” Information and Computation. Elsevier, 2017. https://doi.org/10.1016/j.ic.2016.10.012.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[298]
2017 | Journal Article | IST-REx-ID: 684 | OA
Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” Journal of Symbolic Logic. Cambridge University Press, 2017. https://doi.org/10.1017/jsl.2016.71.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[297]
2017 | Conference Paper | IST-REx-ID: 711 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Bidirectional Nested Weighted Automata,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.CONCUR.2017.5.
[Published Version] View | Files available | DOI
 
[296]
2017 | Journal Article | IST-REx-ID: 716 | OA
Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.” Journal of the ACM. ACM, 2017. https://doi.org/10.1145/3121408.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[295]
2017 | Journal Article | IST-REx-ID: 717 | OA
Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Journal of Computer and System Sciences. Academic Press, 2017. https://doi.org/10.1016/j.jcss.2017.04.005.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[294]
2017 | Journal Article | IST-REx-ID: 719
Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and SYNT 2014.” Acta Informatica. Springer, 2017. https://doi.org/10.1007/s00236-017-0299-0.
View | DOI
 
[293]
2017 | Journal Article | IST-REx-ID: 1407 | OA
Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid Systems. Elsevier, 2017. https://doi.org/10.1016/j.nahs.2016.04.006.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[292]
2017 | Journal Article | IST-REx-ID: 1294 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Trading Performance for Stability in Markov Decision Processes.” Journal of Computer and System Sciences. Elsevier, 2017. https://doi.org/10.1016/j.jcss.2016.09.009.
[Published Version] View | Files available | DOI | WoS
 
[291]
2017 | Journal Article | IST-REx-ID: 1080 | OA
Reiter, Johannes, Alvin Makohon Moore, Jeffrey Gerold, Ivana Božić, Krishnendu Chatterjee, Christine Iacobuzio Donahue, Bert Vogelstein, and Martin Nowak. “Reconstructing Metastatic Seeding Patterns of Human Cancers.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms14114.
[Published Version] View | Files available | DOI | WoS
 
[290]
2017 | Journal Article | IST-REx-ID: 1065 | OA
Chatterjee, Krishnendu, and Georg F Osang. “Pushdown Reachability with Constant Treewidth.” Information Processing Letters. Elsevier, 2017. https://doi.org/10.1016/j.ipl.2017.02.003.
[Submitted Version] View | Files available | DOI | WoS
 
[289]
2017 | Journal Article | IST-REx-ID: 1066
Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. “Quantitative Fair Simulation Games.” Information and Computation. Elsevier, 2017. https://doi.org/10.1016/j.ic.2016.10.006.
View | Files available | DOI | WoS
 
[288]
2017 | Conference Paper | IST-REx-ID: 1011 | OA
Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis. “Faster Algorithms for Weighted Recursive State Machines.” edited by Hongseok Yang, 10201:287–313. Springer, 2017. https://doi.org/10.1007/978-3-662-54434-1_11.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[287]
2017 | Conference Paper | IST-REx-ID: 1009 | OA
Chatterjee, Krishnendu, Petr Novotný, Guillermo Pérez, Jean Raskin, and Djordje Zikelic. “Optimizing Expectation with Guarantees in POMDPs.” In Proceedings of the 31st AAAI Conference on Artificial Intelligence, 5:3725–32. AAAI Press, 2017.
[Submitted Version] View | Download Submitted Version (ext.) | WoS
 
[286]
2017 | Journal Article | IST-REx-ID: 744 | OA
Priklopil, Tadeas, Krishnendu Chatterjee, and Martin Nowak. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.” Journal of Theoretical Biology. Elsevier, 2017. https://doi.org/10.1016/j.jtbi.2017.08.025.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[285]
2017 | Conference Paper | IST-REx-ID: 1194 | OA
Chatterjee, Krishnendu, Petr Novotný, and Djordje Zikelic. “Stochastic Invariants for Probabilistic Termination,” 52:145–60. ACM, 2017. https://doi.org/10.1145/3009837.3009873.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 
[284]
2017 | Research Data | IST-REx-ID: 5559 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak . “Strong Amplifiers of Natural Selection.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:51.
[Published Version] View | Files available | DOI
 
[283]
2017 | Conference Paper | IST-REx-ID: 639 | OA
Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst Case Analysis of Recursive Programs.” edited by Rupak Majumdar and Viktor Kunčak, 10427:41–63. Springer, 2017. https://doi.org/10.1007/978-3-319-63390-9_3.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[282]
2017 | Conference Paper | IST-REx-ID: 949 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “JTDec: A Tool for Tree Decompositions in Soot.” edited by Deepak D’Souza, 10482:59–66. Springer, 2017. https://doi.org/10.1007/978-3-319-68167-2_4.
[Submitted Version] View | Files available | DOI | WoS
 
[281]
2016 | Conference Paper | IST-REx-ID: 1068 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.25.
[Published Version] View | Files available | DOI
 
[280]
2016 | Conference Paper | IST-REx-ID: 1070 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for Synchronization Properties,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.98.
[Published Version] View | Files available | DOI
 
[279]
2016 | Conference Paper | IST-REx-ID: 1090 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Limit-Average Automata of Bounded Width,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.24.
[Published Version] View | Files available | DOI
 
[278]
2016 | Conference Paper | IST-REx-ID: 1138 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Automata under Probabilistic Semantics.” In Proceedings of the 31st Annual ACM/IEEE Symposium, 76–85. IEEE, 2016. https://doi.org/10.1145/2933575.2933588.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[277]
2016 | Conference Paper | IST-REx-ID: 1140 | OA
Chatterjee, Krishnendu, Wolfgang Dvoák, Monika H Henzinger, and Veronika Loitzenbauer. “Model and Objective Separation with Conditional Lower Bounds: Disjunction Is Harder than Conjunction.” In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 197–206. IEEE, 2016. https://doi.org/10.1145/2933575.2935304.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[276]
2016 | Conference Paper | IST-REx-ID: 1182 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016.
[Preprint] View | Files available | Download Preprint (ext.)
 
[275]
2016 | Conference Paper | IST-REx-ID: 1245
Pandey, Vineet, and Krishnendu Chatterjee. “Game-Theoretic Models Identify Useful Principles for Peer Collaboration in Online Learning Platforms.” In Proceedings of the ACM Conference on Computer Supported Cooperative Work, 26:365–68. ACM, 2016. https://doi.org/10.1145/2818052.2869122.
View | DOI
 
[274]
2016 | Conference Paper | IST-REx-ID: 1324
Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, 2016–January:88–96. AAAI Press, 2016.
View | Download None (ext.)
 
[273]
2016 | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, and Petr Novotný. “Stochastic Shortest Path with Energy Constraints in POMDPs.” In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, 1465–66. ACM, 2016.
[Preprint] View | Download Preprint (ext.)
 
[272]
2016 | Conference Paper | IST-REx-ID: 1335 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Monitor Automata,” 9837:23–38. Springer, 2016. https://doi.org/10.1007/978-3-662-53413-7_2.
[Preprint] View | DOI | Download Preprint (ext.)
 
[271]
2016 | Conference Paper | IST-REx-ID: 478 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding Legality of a Single Step of Magic: The Gathering,” 285:1432–39. IOS Press, 2016. https://doi.org/10.3233/978-1-61499-672-9-1432.
[Published Version] View | Files available | DOI
 
[270]
2016 | Conference Paper | IST-REx-ID: 480 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives,” 05-08-July-2016:247–56. IEEE, 2016. https://doi.org/10.1145/2933575.2934513.
[Preprint] View | DOI | Download Preprint (ext.)
 
[269]
2016 | Journal Article | IST-REx-ID: 1477 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.” Journal of Computer and System Sciences. Elsevier, 2016. https://doi.org/10.1016/j.jcss.2016.02.009.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[268]
2016 | Journal Article | IST-REx-ID: 1529 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” Artificial Intelligence. Elsevier, 2016. https://doi.org/10.1016/j.artint.2016.01.007.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[267]
2016 | Technical Report | IST-REx-ID: 5445 | OA
Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. Quantitative Interprocedural Analysis. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-523-v1-1.
[Published Version] View | Files available | DOI
 
[266]
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016:3225–32. AAAI Press, 2016.
View | Files available
 
[265]
2016 | Technical Report | IST-REx-ID: 5449 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Amplification on Undirected Population Structures: Comets Beat Stars. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-648-v1-1.
[Updated Version] View | Files available | DOI
 
[264]
2016 | Technical Report | IST-REx-ID: 5453 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2017-749-v3-1.
[Published Version] View | Files available | DOI
 
[263]
2016 | Technical Report | IST-REx-ID: 5451 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Strong Amplifiers of Natural Selection. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-728-v1-1.
[Published Version] View | Files available | DOI
 
[262]
2016 | Conference Paper | IST-REx-ID: 1071 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ESA.2016.28.
[Published Version] View | Files available | DOI
 
[261]
2016 | Conference Paper | IST-REx-ID: 1438 | OA
Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs,” 20–22:327–42. ACM, 2016. https://doi.org/10.1145/2837614.2837639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[260]
2016 | Technical Report | IST-REx-ID: 5452 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2017-728-v2-1.
[Published Version] View | Files available | DOI
 
[259]
2016 | Conference Paper | IST-REx-ID: 1437 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. https://doi.org/10.1145/2837614.2837624.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[258]
2016 | Conference Paper | IST-REx-ID: 1386 | OA
Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Termination Analysis of Probabilistic Programs through Positivstellensatz’s,” 9779:3–22. Springer, 2016. https://doi.org/10.1007/978-3-319-41528-4_1.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[257]
2015 | Conference Paper | IST-REx-ID: 10796
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under Finite-Memory Strategies for Concurrent Mean-Payoff Games.” In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015:1018–29. SIAM, 2015. https://doi.org/10.1137/1.9781611973730.69.
[Preprint] View | DOI | arXiv
 
[256]
2015 | Journal Article | IST-REx-ID: 1559 | OA
Ibsen-Jensen, Rasmus, Krishnendu Chatterjee, and Martin Nowak. “Computational Complexity of Ecological and Evolutionary Spatial Dynamics.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1511366112.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[255]
2015 | Conference Paper | IST-REx-ID: 1609 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Moshe Vardi. “The Complexity of Synthesis from Probabilistic Components.” In 42nd International Colloquium, 9135:108–20. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47666-6_9.
[Preprint] View | DOI | Download Preprint (ext.)
 
[254]
2015 | Journal Article | IST-REx-ID: 1624 | OA
Pavlogiannis, Andreas, Krishnendu Chatterjee, Ben Adlam, and Martin Nowak. “Cellular Cooperation with Shift Updating and Repulsion.” Scientific Reports. Nature Publishing Group, 2015. https://doi.org/10.1038/srep17147.
[Published Version] View | Files available | DOI
 
[253]
2015 | Journal Article | IST-REx-ID: 1673 | OA
Adlam, Ben, Krishnendu Chatterjee, and Martin Nowak. “Amplifiers of Selection.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2015. https://doi.org/10.1098/rspa.2015.0114.
[Published Version] View | Files available | DOI
 
[252]
2015 | Conference Paper | IST-REx-ID: 1691
Svoreňová, Mária, Martin Chmelik, Kevin Leahy, Hasan Eniser, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Motion Planning Using POMDPs with Parity Objectives: Case Study Paper.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 233–38. ACM, 2015. https://doi.org/10.1145/2728606.2728617.
View | DOI
 
[251]
2015 | Journal Article | IST-REx-ID: 1694
Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Temporal Simulation and Refinement Distances for Timed Systems.” IEEE Transactions on Automatic Control. IEEE, 2015. https://doi.org/10.1109/TAC.2015.2404612.
View | DOI
 
[250]
2015 | Journal Article | IST-REx-ID: 1698 | OA
Velner, Yaron, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, Alexander Rabinovich, and Jean Raskin. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.001.
[Preprint] View | DOI | Download Preprint (ext.)
 
[249]
2015 | Conference Paper | IST-REx-ID: 1820 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , 5:3496–3502. AAAI Press, 2015.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[248]
2015 | Conference Paper | IST-REx-ID: 1838 | OA
Bloem, Roderick, Krishnendu Chatterjee, Swen Jacobs, and Robert Könighofer. “Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information,” 9035:517–32. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_50.
[Preprint] View | DOI | Download Preprint (ext.)
 
[247]
2015 | Conference Paper | IST-REx-ID: 1839 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_12.
[Preprint] View | DOI | Download Preprint (ext.)
 
[246]
2015 | Journal Article | IST-REx-ID: 1873 | OA
Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.” Artificial Intelligence. Elsevier, 2015. https://doi.org/10.1016/j.artint.2014.12.009.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[245]
2015 | Journal Article | IST-REx-ID: 2034 | OA
Bérard, Béatrice, Krishnendu Chatterjee, and Nathalie Sznajder. “Probabilistic Opacity for Markov Decision Processes.” Information Processing Letters. Elsevier, 2015. https://doi.org/10.1016/j.ipl.2014.09.001.
[Preprint] View | DOI | Download Preprint (ext.)
 
[244]
2015 | Journal Article | IST-REx-ID: 1598 | OA
Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.01.050.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[243]
2015 | Journal Article | IST-REx-ID: 1731 | OA
Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.06.003.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[242]
2015 | Journal Article | IST-REx-ID: 1856 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments.” Journal of the ACM. ACM, 2015. https://doi.org/10.1145/2699430.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[241]
2015 | Conference Paper | IST-REx-ID: 1661 | OA
Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015. https://doi.org/10.1109/LICS.2015.34.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[240]
2015 | Journal Article | IST-REx-ID: 523 | OA
Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.010.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[239]
2015 | Journal Article | IST-REx-ID: 524 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.009.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[238]
2015 | Conference Paper | IST-REx-ID: 1481 | OA
Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2:745–52. AAAI Press, 2015.
View | Files available | Download None (ext.)
 
[237]
2015 | Conference Paper | IST-REx-ID: 1732 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications,” 325–30. IEEE, 2015. https://doi.org/10.1109/ICRA.2015.7139019.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[236]
2015 | Technical Report | IST-REx-ID: 5431 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-322-v1-1.
[Published Version] View | Files available | DOI
 
[235]
2015 | Conference Paper | IST-REx-ID: 1657
Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” LICS. IEEE, 2015. https://doi.org/10.1109/LICS.2015.32.
View | Files available | DOI
 
[234]
2015 | Conference Paper | IST-REx-ID: 1656
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015. https://doi.org/10.1109/LICS.2015.72.
View | Files available | DOI | arXiv
 
[233]
2015 | Technical Report | IST-REx-ID: 5429 | OA
Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v1-1.
[Published Version] View | Files available | DOI
 
[232]
2015 | Technical Report | IST-REx-ID: 5435 | OA
Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v2-1.
[Published Version] View | Files available | DOI
 
[231]
2015 | Technical Report | IST-REx-ID: 5436 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-170-v2-2.
[Published Version] View | Files available | DOI
 
[230]
2015 | Conference Paper | IST-REx-ID: 1610 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” In 42nd International Colloquium, 9135:121–33. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47666-6_10.
View | Files available | DOI | Download None (ext.) | arXiv
 
[229]
2015 | Technical Report | IST-REx-ID: 5437 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-330-v2-1.
[Published Version] View | Files available | DOI
 
[228]
2015 | Technical Report | IST-REx-ID: 5430 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-319-v1-1.
[Published Version] View | Files available | DOI
 
[227]
2015 | Technical Report | IST-REx-ID: 5438 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. Edit Distance for Pushdown Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1.
[Published Version] View | Files available | DOI
 
[226]
2015 | Technical Report | IST-REx-ID: 5440 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v2-2.
[Published Version] View | Files available | DOI
 
[225]
2015 | Technical Report | IST-REx-ID: 5432 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v1-1.
[Published Version] View | Files available | DOI
 
[224]
2015 | Technical Report | IST-REx-ID: 5444 | OA
Reiter, Johannes, Alvin Makohon-Moore, Jeffrey Gerold, Ivana Bozic, Krishnendu Chatterjee, Christine Iacobuzio-Donahue, Bert Vogelstein, and Martin Nowak. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-399-v1-1.
[Published Version] View | Files available | DOI
 
[223]
2015 | Technical Report | IST-REx-ID: 5443 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-325-v2-1.
[Published Version] View | Files available | DOI
 
[222]
2015 | Journal Article | IST-REx-ID: 1709 | OA
Reiter, Johannes, Ayush Kanodia, Raghav Gupta, Martin Nowak, and Krishnendu Chatterjee. “Biological Auctions with Multiple Rewards.” Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society, 2015. https://doi.org/10.1098/rspb.2015.1041.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[221]
2015 | Journal Article | IST-REx-ID: 1501 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.” Formal Methods in System Design. Springer, 2015. https://doi.org/10.1007/s10703-015-0235-2.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[220]
2015 | Journal Article | IST-REx-ID: 1602 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, and Prateesh Goyal. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.” ACM SIGPLAN Notices. ACM, 2015. https://doi.org/10.1145/2676726.2676979.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[219]
2015 | Journal Article | IST-REx-ID: 1604
Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. “Quantitative Interprocedural Analysis.” Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . ACM, 2015. https://doi.org/10.1145/2676726.2676968.
View | Files available | DOI
 
[218]
2015 | Conference Paper | IST-REx-ID: 1607 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs,” 9206:140–57. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_9.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[217]
2015 | Conference Paper | IST-REx-ID: 1714
Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks.” In Real-Time Systems Symposium, 2015:118–27. IEEE, 2015. https://doi.org/10.1109/RTSS.2014.9.
View | Files available | DOI
 
[216]
2015 | Technical Report | IST-REx-ID: 5441 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-340-v1-1.
[Published Version] View | Files available | DOI
 
[215]
2015 | Conference Paper | IST-REx-ID: 1689 | OA
Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 259–68. ACM, 2015. https://doi.org/10.1145/2728606.2728608.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[214]
2015 | Journal Article | IST-REx-ID: 1681 | OA
Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” Games. MDPI, 2015. https://doi.org/10.3390/g6040413.
[Published Version] View | Files available | DOI
 
[213]
2015 | Conference Paper | IST-REx-ID: 1603 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in Markov Decision Processes,” 9206:158–77. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_10.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[212]
2014 | Journal Article | IST-REx-ID: 1375 | OA
Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.” Theoretical Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.06.031.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[211]
2014 | Conference Paper | IST-REx-ID: 1853
Jha, Susmit, Stavros Tripakis, Sanjit Seshia, and Krishnendu Chatterjee. “Game Theoretic Secure Localization in Wireless Sensor Networks,” 85–90. IEEE, 2014. https://doi.org/10.1109/IOT.2014.7030120.
View | DOI
 
[210]
2014 | Conference Paper | IST-REx-ID: 2027 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Vojtěch Forejt, Jan Kretinsky, Marta Kwiatkowska, David Parker, and Mateusz Ujma. “Verification of Markov Decision Processes Using Learning Algorithms.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, 8837:98–114. Society of Industrial and Applied Mathematics, 2014. https://doi.org/10.1007/978-3-319-11936-6_8.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[209]
2014 | Journal Article | IST-REx-ID: 2187 | OA
Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer. “Synthesizing Robust Systems.” Acta Informatica. Springer, 2014. https://doi.org/10.1007/s00236-013-0191-5.
[Submitted Version] View | Files available | DOI
 
[208]
2014 | Journal Article | IST-REx-ID: 2234 | OA
Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Markov Decision Processes with Multiple Long-Run Average Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2014. https://doi.org/10.2168/LMCS-10(1:13)2014.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[207]
2014 | Journal Article | IST-REx-ID: 2716 | OA
Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” Acta Informatica. Springer, 2014. https://doi.org/10.1007/s00236-013-0182-6.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[206]
2014 | Journal Article | IST-REx-ID: 2141 | OA
Chatterjee, Krishnendu, and Monika H Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal of the ACM. ACM, 2014. https://doi.org/10.1145/2597631.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[205]
2014 | Conference Paper | IST-REx-ID: 2054
Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_37.
View | Files available | DOI
 
[204]
2014 | Conference Paper | IST-REx-ID: 1903
Chatterjee, Krishnendu. “Partial-Observation Stochastic Reachability and Parity Games,” 8634:1–4. Springer, 2014. https://doi.org/10.1007/978-3-662-44522-8_1.
View | Files available | DOI
 
[203]
2014 | Journal Article | IST-REx-ID: 2211 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2579821.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[202]
2014 | Journal Article | IST-REx-ID: 2038 | OA
Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” ACM Transactions on Computational Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2629686.
[Submitted Version] View | Files available | DOI
 
[201]
2014 | Conference Paper | IST-REx-ID: 2162 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,” 8573:122–33. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_11.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[200]
2014 | Conference Paper | IST-REx-ID: 2213 | OA
Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. “The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies,” 8412:242–57. Springer, 2014. https://doi.org/10.1007/978-3-642-54830-7_16.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[199]
2014 | Conference Paper | IST-REx-ID: 2212
Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. “Perfect-Information Stochastic Mean-Payoff Parity Games,” 8412:210–25. Springer, 2014. https://doi.org/10.1007/978-3-642-54830-7_14.
View | Files available | DOI
 
[198]
2014 | Conference Paper | IST-REx-ID: 2216 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit Distance for Timed Automata,” 303–12. Springer, 2014. https://doi.org/10.1145/2562059.2562141.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[197]
2014 | Technical Report | IST-REx-ID: 5413 | OA
Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v2-2.
[Published Version] View | Files available | DOI
 
[196]
2014 | Technical Report | IST-REx-ID: 5414 | OA
Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v3-1.
[Published Version] View | Files available | DOI
 
[195]
2014 | Technical Report | IST-REx-ID: 5412 | OA
Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v1-1.
[Published Version] View | Files available | DOI
 
[194]
2014 | Conference Paper | IST-REx-ID: 2163 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” In Lecture Notes in Computer Science, 8573:110–21. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_10.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[193]
2014 | Technical Report | IST-REx-ID: 5419 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-187-v1-1.
[Published Version] View | Files available | DOI
 
[192]
2014 | Technical Report | IST-REx-ID: 5418 | OA
Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-176-v1-1.
[Published Version] View | Files available | DOI
 
[191]
2014 | Technical Report | IST-REx-ID: 5420 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-191-v1-1.
[Published Version] View | Files available | DOI
 
[190]
2014 | Technical Report | IST-REx-ID: 5424 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v1-1.
[Published Version] View | Files available | DOI
 
[189]
2014 | Technical Report | IST-REx-ID: 5426 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v2-1.
[Published Version] View | Files available | DOI
 
[188]
2014 | Technical Report | IST-REx-ID: 5423 | OA
Chatterjee, Krishnendu, Alexander Kössler, Andreas Pavlogiannis, and Ulrich Schmid. A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-300-v1-1.
[Published Version] View | Files available | DOI
 
[187]
2014 | Technical Report | IST-REx-ID: 5427 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-314-v1-1.
[Published Version] View | Files available | DOI
 
[186]
2014 | Technical Report | IST-REx-ID: 5415 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-170-v1-1.
[Published Version] View | Files available | DOI
 
[185]
2014 | Technical Report | IST-REx-ID: 5421 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolution on Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-190-v2-2.
[Published Version] View | Files available | DOI
 
[184]
2014 | Conference Paper | IST-REx-ID: 10885
Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.” In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, 8318:78–97. Springer Nature, 2014. https://doi.org/10.1007/978-3-642-54013-4_5.
[Preprint] View | Files available | DOI | arXiv
 
[183]
2014 | Journal Article | IST-REx-ID: 2039 | OA
Chatterjee, Krishnendu, Andreas Pavlogiannis, Ben Adlam, and Martin Nowak. “The Time Scale of Evolutionary Innovation.” PLoS Computational Biology. Public Library of Science, 2014. https://doi.org/10.1371/journal.pcbi.1003818.
[Published Version] View | Files available | DOI
 
[182]
2014 | Research Data Reference | IST-REx-ID: 9739
Chatterjee, Krishnendu, Andreas Pavlogiannis, Ben Adlam, and Martin Novak. “Detailed Proofs for ‘The Time Scale of Evolutionary Innovation.’” Public Library of Science, 2014. https://doi.org/10.1371/journal.pcbi.1003818.s001.
[Published Version] View | Files available | DOI
 
[181]
2014 | Journal Article | IST-REx-ID: 535 | OA
Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” Algorithmica. Springer, 2014. https://doi.org/10.1007/s00453-013-9843-7.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[180]
2014 | Conference Paper | IST-REx-ID: 2063
Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,” 8559:473–90. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_31.
View | Files available | DOI
 
[179]
2014 | Technical Report | IST-REx-ID: 5428 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. Quantitative Fair Simulation Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-315-v1-1.
[Published Version] View | Files available | DOI
 
[178]
2013 | Conference Paper | IST-REx-ID: 1374 | OA
Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” In 22nd EACSL Annual Conference on Computer Science Logic, 23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.181.
[Published Version] View | Files available | DOI
 
[177]
2013 | Conference Paper | IST-REx-ID: 2238
Chatterjee, Krishnendu, Vojtěch Forejt, and Dominik Wojtczak. “Multi-Objective Discounted Reward Verification in Graphs and MDPs.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_17.
View | DOI
 
[176]
2013 | Conference (Editor) | IST-REx-ID: 2292
Chatterjee, Krishnendu, and Jiri Sgall, eds. Mathematical Foundations of Computer Science 2013. Vol. 8087. Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40313-2.
View | DOI
 
[175]
2013 | Journal Article | IST-REx-ID: 2299 | OA
Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer. Springer, 2013. https://doi.org/10.1007/s10009-011-0207-9.
[Submitted Version] View | Files available | DOI
 
[174]
2013 | Conference Paper | IST-REx-ID: 2446 | OA
Chatterjee, Krishnendu, Andreas Gaiser, and Jan Kretinsky. “Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_37.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[173]
2013 | Conference Paper | IST-REx-ID: 2444 | OA
Chatterjee, Krishnendu, and Jakub Ła̧Cki. “Faster Algorithms for Markov Decision Processes with Low Treewidth.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_36.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[172]
2013 | Journal Article | IST-REx-ID: 2814 | OA
Chatterjee, Krishnendu, Luca Alfaro, and Ritankar Majumdar. “The Complexity of Coverage.” International Journal of Foundations of Computer Science. World Scientific Publishing, 2013. https://doi.org/10.1142/S0129054113400066.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[171]
2013 | Journal Article | IST-REx-ID: 2817 | OA
Novak, Sebastian, Krishnendu Chatterjee, and Martin Nowak. “Density Games.” Journal of Theoretical Biology. Elsevier, 2013. https://doi.org/10.1016/j.jtbi.2013.05.029.
[Published Version] View | Files available | DOI
 
[170]
2013 | Conference Paper | IST-REx-ID: 2819 | OA
Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Timed Simulation Functions and Refinement Metrics for Real-Time Systems.” In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, 1:273–82. Springer, 2013. https://doi.org/10.1145/2461328.2461370.
[Preprint] View | DOI | Download Preprint (ext.)
 
[169]
2013 | Journal Article | IST-REx-ID: 2824
Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory-Efficient, Clock-Memory Free, and Non-Zeno Safety Controllers for Timed Systems.” Information and Computation. Elsevier, 2013. https://doi.org/10.1016/j.ic.2013.04.003.
View | DOI
 
[168]
2013 | Journal Article | IST-REx-ID: 2836 | OA
Chatterjee, Krishnendu, and Vishwanath Raman. “Assume-Guarantee Synthesis for Digital Contract Signing.” Formal Aspects of Computing. Springer, 2013. https://doi.org/10.1007/s00165-013-0283-6.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[167]
2013 | Journal Article | IST-REx-ID: 2854 | OA
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Strategy Improvement for Concurrent Reachability and Turn Based Stochastic Safety Games.” Journal of Computer and System Sciences. Elsevier, 2013. https://doi.org/10.1016/j.jcss.2012.12.001.
[Published Version] View | Files available | DOI
 
[166]
2013 | Journal Article | IST-REx-ID: 3116
Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, Ritankar Majumdar, and Vishwanath Raman. “Code Aware Resource Management.” Formal Methods in System Design. Springer, 2013. https://doi.org/10.1007/s10703-012-0170-4.
View | DOI
 
[165]
2013 | Journal Article | IST-REx-ID: 2831 | OA
Chatterjee, Krishnendu, Monika H Henzinger, Manas Joglekar, and Nisarg Shah. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.” Formal Methods in System Design. Springer, 2013. https://doi.org/10.1007/s10703-012-0180-2.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[164]
2013 | Conference Paper | IST-REx-ID: 2279 | OA
Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-319-02444-8_10.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[163]
2013 | Technical Report | IST-REx-ID: 5399 | OA
Reiter, Johannes, Ivana Bozic, Krishnendu Chatterjee, and Martin Nowak. TTP: Tool for Tumor Progression. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-104-v1-1.
[Published Version] View | Files available | DOI
 
[162]
2013 | Conference Paper | IST-REx-ID: 2295 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.165.
[Published Version] View | Files available | DOI
 
[161]
2013 | Technical Report | IST-REx-ID: 5403 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. Qualitative Analysis of Concurrent Mean-Payoff Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-126-v1-1.
[Published Version] View | Files available | DOI
 
[160]
2013 | Technical Report | IST-REx-ID: 5400 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-109-v1-1.
[Published Version] View | Files available | DOI
 
[159]
2013 | Technical Report | IST-REx-ID: 5404 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-127-v1-1.
[Published Version] View | Files available | DOI
 
[158]
2013 | Technical Report | IST-REx-ID: 5405 | OA
Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. Perfect-Information Stochastic Mean-Payoff Parity Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-128-v1-1.
[Published Version] View | Files available | DOI
 
[157]
2013 | Technical Report | IST-REx-ID: 5409 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Rupak Majumdar. Edit Distance for Timed Automata. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-144-v1-1.
[Published Version] View | Files available | DOI
 
[156]
2013 | Conference Paper | IST-REx-ID: 1376
Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. “Distributed Synthesis for LTL Fragments.” In 13th International Conference on Formal Methods in Computer-Aided Design, 18–25. IEEE, 2013. https://doi.org/10.1109/FMCAD.2013.6679386.
View | Files available | DOI
 
[155]
2013 | Technical Report | IST-REx-ID: 5406 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. Distributed Synthesis for LTL Fragments. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-130-v1-1.
[Published Version] View | Files available | DOI
 
[154]
2013 | Technical Report | IST-REx-ID: 5408 | OA
Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-141-v1-1.
[Published Version] View | Files available | DOI
 
[153]
2013 | Technical Report | IST-REx-ID: 5410 | OA
Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. Automatic Generation of Alternative Starting Positions for Traditional Board Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-146-v1-1.
[Published Version] View | Files available | DOI
 
[152]
2013 | Conference Paper | IST-REx-ID: 2329 | OA
Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40184-8_35.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[151]
2013 | Research Data Reference | IST-REx-ID: 9749
Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” Public Library of Science, 2013. https://doi.org/10.1371/journal.pone.0080814.s001.
[Published Version] View | Files available | DOI
 
[150]
2013 | Conference Paper | IST-REx-ID: 10902
Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel between Languages.” In 7th International Conference on Language and Automata Theory and Applications, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature, 2013. https://doi.org/10.1007/978-3-642-37064-9_20.
View | DOI
 
[149]
2013 | Journal Article | IST-REx-ID: 2247 | OA
Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” PLoS One. Public Library of Science, 2013. https://doi.org/10.1371/journal.pone.0080814.
[Published Version] View | Files available | DOI
 
[148]
2013 | Journal Article | IST-REx-ID: 2858 | OA
Reiter, Johannes, Ivana Božić, Benjamin Allen, Krishnendu Chatterjee, and Martin Nowak. “The Effect of One Additional Driver Mutation on Tumor Progression.” Evolutionary Applications. Wiley-Blackwell, 2013. https://doi.org/10.1111/eva.12020.
[Published Version] View | Files available | DOI
 
[147]
2013 | Journal Article | IST-REx-ID: 2816 | OA
Božić, Ivana, Johannes Reiter, Benjamin Allen, Tibor Antal, Krishnendu Chatterjee, Preya Shah, Yo Moon, et al. “Evolutionary Dynamics of Cancer in Response to Targeted Combination Therapy.” ELife. eLife Sciences Publications, 2013. https://doi.org/10.7554/eLife.00747.
[Published Version] View | Files available | DOI
 
[146]
2013 | Conference Paper | IST-REx-ID: 2000 | OA
Reiter, Johannes, Ivana Božić, Krishnendu Chatterjee, and Martin Nowak. “TTP: Tool for Tumor Progression.” In Proceedings of 25th Int. Conf. on Computer Aided Verification, 8044:101–6. Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_6.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[145]
2013 | Conference Paper | IST-REx-ID: 2305 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Trading Performance for Stability in Markov Decision Processes.” In 28th Annual ACM/IEEE Symposium, 331–40. IEEE, 2013. https://doi.org/10.1109/LICS.2013.39.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[144]
2013 | Conference Paper | IST-REx-ID: 2820
Chatterjee, Krishnendu, Alexander Kößler, and Ulrich Schmid. “Automated Analysis of Real-Time Scheduling Using Graph Games.” In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, 163–72. ACM, 2013. https://doi.org/10.1145/2461328.2461356.
View | Files available | DOI
 
[143]
2012 | Conference Paper | IST-REx-ID: 2715 | OA
Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives,” 18:461–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461.
[Published Version] View | Files available | DOI
 
[142]
2012 | Conference Paper | IST-REx-ID: 10904
Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” In CONCUR 2012 - Concurrency Theory, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31. Berlin, Heidelberg: Springer, 2012. https://doi.org/10.1007/978-3-642-32940-1_10.
[Preprint] View | Files available | DOI | arXiv
 
[141]
2012 | Journal Article | IST-REx-ID: 2848 | OA
Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary Game Dynamics in Populations with Different Learners.” Journal of Theoretical Biology. Elsevier, 2012. https://doi.org/10.1016/j.jtbi.2012.02.021.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[140]
2012 | Conference Paper | IST-REx-ID: 2936 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In Roceedings of the Tenth ACM International Conference on Embedded Software, 43–52. ACM, 2012. https://doi.org/10.1145/2380356.2380370.
[Preprint] View | DOI | Download Preprint (ext.)
 
[139]
2012 | Conference Paper | IST-REx-ID: 2947 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Ritankar Majumdar. “Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games,” 7561:385–99. Springer, 2012. https://doi.org/10.1007/978-3-642-33386-6_30.
[Preprint] View | DOI | Download Preprint (ext.)
 
[138]
2012 | Conference Paper | IST-REx-ID: 3135 | OA
Brázdil, Brázdil, Krishnendu Chatterjee, Antonín Kučera, and Petr Novotný. “Efficient Controller Synthesis for Consumption Games with Multiple Resource Types,” 7358:23–38. Springer, 2012. https://doi.org/10.1007/978-3-642-31424-7_8.
[Preprint] View | DOI | Download Preprint (ext.)
 
[137]
2012 | Conference Paper | IST-REx-ID: 3252 | OA
Chatterjee, Krishnendu, and Vishwanath Raman. “Synthesizing Protocols for Digital Contract Signing,” 7148:152–68. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_11.
[Preprint] View | DOI | Download Preprint (ext.)
 
[136]
2012 | Conference Paper | IST-REx-ID: 3255 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives,” 7119:37–46. Springer, 2012. https://doi.org/10.1007/978-3-642-25929-6_3.
[Submitted Version] View | Files available | DOI
 
[135]
2012 | Journal Article | IST-REx-ID: 3254
Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” Information and Computation. Elsevier, 2012. https://doi.org/10.1016/j.ic.2011.11.004.
View | DOI | Download None (ext.)
 
[134]
2012 | Journal Article | IST-REx-ID: 3314
Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” International Journal of Foundations of Computer Science. World Scientific Publishing, 2012. https://doi.org/10.1142/S0129054112400308.
View | DOI
 
[133]
2012 | Journal Article | IST-REx-ID: 3846 | OA
Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic ω Regular Games.” Journal of Computer and System Sciences. Elsevier, 2012. https://doi.org/10.1016/j.jcss.2011.05.002.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[132]
2012 | Journal Article | IST-REx-ID: 3128 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Partial-Observation Stochastic Parity Games.” Formal Methods in System Design. Springer, 2012. https://doi.org/10.1007/s10703-012-0164-2.
[Submitted Version] View | Files available | DOI
 
[131]
2012 | Journal Article | IST-REx-ID: 2972 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” Theoretical Computer Science. Elsevier, 2012. https://doi.org/10.1016/j.tcs.2012.07.038.
[Published Version] View | Files available | DOI | arXiv
 
[130]
2012 | Conference Paper | IST-REx-ID: 497 | OA
Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms for Alternating Refinement Relations,” 16:167–82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.CSL.2012.167.
[Published Version] View | Files available | DOI
 
[129]
2012 | Conference Paper | IST-REx-ID: 3165 | OA
Chatterjee, Krishnendu, and Monika H Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 1386–99. SIAM, 2012. https://doi.org/10.1137/1.9781611973099.109.
View | Files available | DOI | Download None (ext.) | arXiv
 
[128]
2012 | Conference Paper | IST-REx-ID: 2956
Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.30.
View | Files available | DOI
 
[127]
2012 | Technical Report | IST-REx-ID: 5377 | OA
Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games. IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0002.
[Published Version] View | Files available | DOI
 
[126]
2012 | Technical Report | IST-REx-ID: 5378 | OA
Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. Faster Algorithms for Alternating Refinement Relations. IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0001.
[Published Version] View | Files available | DOI
 
[125]
2012 | Conference Paper | IST-REx-ID: 2955 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.28.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[124]
2012 | Conference Paper | IST-REx-ID: 3341 | OA
Chatterjee, Krishnendu. “Robustness of Structurally Equivalent Concurrent Parity Games,” 7213:270–85. Springer, 2012. https://doi.org/10.1007/978-3-642-28729-9_18.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[123]
2012 | Conference Paper | IST-REx-ID: 2957 | OA
Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.29.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[122]
2012 | Conference Paper | IST-REx-ID: 10905 | OA
Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” In Algorithms – ESA 2012, 7501:301–12. Springer, 2012. https://doi.org/10.1007/978-3-642-33090-2_27.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[121]
2012 | Journal Article | IST-REx-ID: 3260 | OA
Chatterjee, Krishnendu, Johannes Reiter, and Martin Nowak. “Evolutionary Dynamics of Biological Auctions.” Theoretical Population Biology. Academic Press, 2012. https://doi.org/10.1016/j.tpb.2011.11.003.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[120]
2011 | Conference Paper | IST-REx-ID: 3316 | OA
Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.” In 6th IEEE International Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011. https://doi.org/10.1109/SIES.2011.5953660.
[Published Version] View | DOI | Download Published Version (ext.)
 
[119]
2011 | Conference Paper | IST-REx-ID: 3350
Chatterjee, Krishnendu, and Ritankar Majumdar. “Minimum Attention Controller Synthesis for Omega Regular Objectives.” edited by Uli Fahrenberg and Stavros Tripakis, 6919:145–59. Springer, 2011. https://doi.org/10.1007/978-3-642-24310-3_11.
View | DOI
 
[118]
2011 | Conference Paper | IST-REx-ID: 3351 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless Quantitative Objectives.” edited by Olaf Owe, Martin Steffen, and Jan Arne Telle, 6914:148–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22953-4_13.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[117]
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL). ACM, 2011. https://doi.org/10.1145/1970398.1970404.
View | Files available | DOI
 
[116]
2011 | Conference Paper | IST-REx-ID: 3349 | OA
Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity Games to Simple Stochastic Games,” 54:74–86. EPTCS, 2011. https://doi.org/10.4204/EPTCS.54.6.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[115]
2011 | Conference Paper | IST-REx-ID: 3365 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,” 6605:267–71. Springer, 2011. https://doi.org/10.1007/978-3-642-19835-9_24.
[Submitted Version] View | Files available | DOI
 
[114]
2011 | Preprint | IST-REx-ID: 3363 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[113]
2011 | Journal Article | IST-REx-ID: 3315 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.” Logical Methods in Computer Science. International Federation of Computational Logic, 2011. https://doi.org/10.2168/LMCS-7(4:8)2011.
[Published Version] View | Files available | DOI
 
[112]
2011 | Preprint | IST-REx-ID: 3339 | OA
Chatterjee, Krishnendu, Luca De Alfaro, and Roy Pritam. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv. ArXiv, 2011.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[111]
2011 | Conference Paper | IST-REx-ID: 3342 | OA
Chatterjee, Krishnendu, Monika H Henzinger, Manas Joglekar, and Shah Nisarg. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:260–76. Springer, 2011. https://doi.org/10.1007/978-3-642-22110-1_21.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[110]
2011 | Conference Paper | IST-REx-ID: 3347 | OA
Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,” 6638:216–26. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_16.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[109]
2011 | Conference Paper | IST-REx-ID: 3346 | OA
Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.10.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[108]
2011 | Conference Paper | IST-REx-ID: 3348 | OA
Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient Real Time Controllers for Safety Objectives,” 221–30. Springer, 2011. https://doi.org/10.1145/1967701.1967734.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[107]
2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” edited by Giorgo Delzanno and Igor Potapov, 6945:1–1. Springer, 2011. https://doi.org/10.1007/978-3-642-24288-5_1.
View | DOI
 
[106]
2011 | Conference Paper | IST-REx-ID: 3343 | OA
Chatterjee, Krishnendu, and Monika H Henzinger. “Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification,” 1318–36. SIAM, 2011. https://doi.org/10.1137/1.9781611973082.101.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[105]
2011 | Conference Paper | IST-REx-ID: 3361 | OA
Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,” 205–17. IEEE, 2011. https://doi.org/10.1109/CSF.2011.21.
[Submitted Version] View | Files available | DOI
 
[104]
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.” edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_17.
View | DOI
 
[103]
2011 | Technical Report | IST-REx-ID: 5379 | OA
Chatterjee, Krishnendu, and Monika H Henzinger. An O(N2) Time Algorithm for Alternating Büchi Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0009.
[Published Version] View | Files available | DOI
 
[102]
2011 | Technical Report | IST-REx-ID: 5381 | OA
Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic Games: How to Win When Belief Fails. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0007.
[Published Version] View | Files available | DOI
 
[101]
2011 | Technical Report | IST-REx-ID: 5380 | OA
Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0008.
[Published Version] View | Files available | DOI
 
[100]
2011 | Technical Report | IST-REx-ID: 5382 | OA
Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0006.
[Published Version] View | Files available | DOI
 
[99]
2011 | Preprint | IST-REx-ID: 3338 | OA
Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv. ArXiv, 2011.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[98]
2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.33.
[Submitted Version] View | Files available | DOI
 
[97]
2011 | Technical Report | IST-REx-ID: 5385 | OA
Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0003.
[Published Version] View | Files available | DOI
 
[96]
2011 | Technical Report | IST-REx-ID: 5384 | OA
Chatterjee, Krishnendu, and Mathieu Tracol. Decidable Problems for Probabilistic Automata on Infinite Words. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0004.
[Published Version] View | Files available | DOI
 
[95]
2011 | Conference Paper | IST-REx-ID: 3366 | OA
Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22110-1_20.
[Submitted Version] View | Files available | DOI
 
[94]
2011 | Conference Paper | IST-REx-ID: 3345 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity Markov Decision Processes,” 6907:206–18. Springer, 2011. https://doi.org/10.1007/978-3-642-22993-0_21.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[93]
2011 | Technical Report | IST-REx-ID: 5387 | OA
Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0001.
[Published Version] View | Files available | DOI
 
[92]
2010 | Conference Paper | IST-REx-ID: 3858 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “The Complexity of Partial-Observation Parity Games,” 6397:1–14. Springer, 2010. https://doi.org/10.1007/978-3-642-16242-8_1.
[Submitted Version] View | Files available | DOI
 
[91]
2010 | Conference Paper | IST-REx-ID: 3856 | OA
Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free,” 6281:246–57. Springer, 2010. https://doi.org/10.1007/978-3-642-15155-2_23.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[90]
2010 | Conference (Editor) | IST-REx-ID: 3859
Chatterjee, Krishnendu, and Thomas A Henzinger, eds. Formal Modeling and Analysis of Timed Systems. Vol. 6246. Springer, 2010. https://doi.org/10.1007/978-3-642-15297-9.
View | Files available | DOI
 
[89]
2010 | Conference Paper | IST-REx-ID: 3866 | OA
Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.” edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_36.
[Submitted Version] View | Files available | DOI
 
[88]
2010 | Journal Article | IST-REx-ID: 3868 | OA
Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath Raman. “Algorithms for Game Metrics.” Logical Methods in Computer Science. International Federation of Computational Logic, 2010. https://doi.org/10.2168/LMCS-6(3:13)2010.
[Published Version] View | Files available | DOI
 
[87]
2010 | Conference Paper | IST-REx-ID: 3853 | OA
Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,” 6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.1007/978-3-642-15375-4_19.
[Submitted Version] View | Files available | DOI
 
[86]
2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee, Krishnendu, Florian Horn, and Christof Löding. “Obliging Games,” 6269:284–96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.1007/978-3-642-15375-4_20.
View | DOI
 
[85]
2010 | Conference Paper | IST-REx-ID: 3851 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games,” 6199:599–610. Springer, 2010. https://doi.org/10.1007/978-3-642-14162-1_50.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[84]
2010 | Conference Paper | IST-REx-ID: 3860 | OA
Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Generalized Mean-Payoff and Energy Games,” 8:505–16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505.
[Submitted Version] View | Files available | DOI
 
[83]
2010 | Journal Article | IST-REx-ID: 3862 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Quantitative Languages.” ACM Transactions on Computational Logic (TOCL). ACM, 2010. https://doi.org/10.1145/1805950.1805953.
[Submitted Version] View | Files available | DOI
 
[82]
2010 | Conference Paper | IST-REx-ID: 3864 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,” 6174:380–95. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_34.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[81]
2010 | Conference Paper | IST-REx-ID: 3865
Chatterjee, Krishnendu, Luca De Alfaro, Vishwanath Raman, and César Sánchez. “Analyzing the Impact of Change in Multi-Threaded Programs.” edited by David Rosenblum and Gabriele Taenzer, 6013:293–307. Springer, 2010. https://doi.org/10.1007/978-3-642-12029-9_21.
View | DOI
 
[80]
2010 | Journal Article | IST-REx-ID: 3863 | OA
Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect Information.” Information and Computation. Elsevier, 2010. https://doi.org/10.1016/j.ic.2009.09.006.
[Submitted Version] View | Files available | DOI
 
[79]
2010 | Journal Article | IST-REx-ID: 3861 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic.” Information and Computation. Elsevier, 2010. https://doi.org/10.1016/j.ic.2009.07.004.
[Submitted Version] View | Files available | DOI
 
[78]
2010 | Journal Article | IST-REx-ID: 3867 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.” Logical Methods in Computer Science. International Federation of Computational Logic, 2010. https://doi.org/10.2168/LMCS-6(3:10)2010.
[Published Version] View | Files available | DOI
 
[77]
2010 | Technical Report | IST-REx-ID: 5388 | OA
Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0004.
[Published Version] View | Files available | DOI
 
[76]
2010 | Conference Paper | IST-REx-ID: 4388 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,” 6174:665–69. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_57.
[Submitted Version] View | Files available | DOI | arXiv
 
[75]
2010 | Technical Report | IST-REx-ID: 5390 | OA
Chatterjee, Krishnendu, and Nathanaël Fijalkow. Topological, Automata-Theoretic and Logical Characterization of Finitary Languages. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0002.
[Published Version] View | Files available | DOI
 
[74]
2010 | Conference Paper | IST-REx-ID: 3857
Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Automata on Infinite Words: Decidability and Undecidability Results,” 6252:1–16. Springer, 2010. https://doi.org/10.1007/978-3-642-15643-4_1.
View | Files available | DOI
 
[73]
2010 | Conference Paper | IST-REx-ID: 3855 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Qualitative Analysis of Partially-Observable Markov Decision Processes,” 6281:258–69. Springer, 2010. https://doi.org/10.1007/978-3-642-15155-2_24.
[Submitted Version] View | Files available | DOI
 
[72]
2010 | Conference Paper | IST-REx-ID: 3852 | OA
Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting in Games across Time Scales,” 25:22–29. EPTCS, 2010. https://doi.org/10.4204/EPTCS.25.6.
[Published Version] View | Files available | DOI | arXiv
 
[71]
2009 | Conference Paper | IST-REx-ID: 3503 | OA
Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Systems with Limsup and Liminf Objectives,” 5489:32–45. Springer, 2009. https://doi.org/10.1007/978-3-642-03092-5_4.
View | DOI | Download (ext.)
 
[70]
2009 | Conference Paper | IST-REx-ID: 3871 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Probabilistic Weighted Automata,” 5710:244–58. Springer, 2009. https://doi.org/10.1007/978-3-642-04081-8_17.
[Submitted Version] View | Files available | DOI
 
[69]
2009 | Journal Article | IST-REx-ID: 3870 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Finitary Winning in Omega-Regular Games.” ACM Transactions on Computational Logic (TOCL). ACM, 2009. https://doi.org/10.1145/1614431.1614432.
[Submitted Version] View | Files available | DOI
 
[68]
2009 | Journal Article | IST-REx-ID: 3869
Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, and Axel Legay. “Qualitative Logics and Equivalences for Probabilistic Systems.” Logical Methods in Computer Science. International Federation of Computational Logic, 2009. https://doi.org/10.2168/LMCS-5(2:7)2009.
View | DOI
 
[67]
2009 | Conference Paper | IST-REx-ID: 4542 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Alternating Weighted Automata,” 5699:3–13. Springer, 2009. https://doi.org/10.1007/978-3-642-03409-1_2.
[Submitted Version] View | Files available | DOI
 
[66]
2009 | Conference Paper | IST-REx-ID: 4545 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Stochastic Games with Limsup and Liminf Objectives,” 5556:1–15. Springer, 2009. https://doi.org/10.1007/978-3-642-02930-1_1.
[Submitted Version] View | Files available | DOI
 
[65]
2009 | Conference Paper | IST-REx-ID: 4543
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Stochastic Games with Finitary Objectives,” 5734:34–54. Springer, 2009. https://doi.org/10.1007/978-3-642-03816-7_4.
View | DOI
 
[64]
2009 | Conference Paper | IST-REx-ID: 4544 | OA
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Termination Criteria for Solving Concurrent Safety and Reachability Games,” 197–206. SIAM, 2009. https://doi.org/10.1137/1.9781611973068.23.
View | Files available | DOI | Download (ext.)
 
[63]
2009 | Conference Paper | IST-REx-ID: 4540
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages,” 199–208. IEEE, 2009. https://doi.org/10.1109/LICS.2009.16.
View | Files available | DOI
 
[62]
2009 | Conference Paper | IST-REx-ID: 4569 | OA
Bloem, Roderick, Krishnendu Chatterjee, Thomas A Henzinger, and Barbara Jobstmann. “Better Quality in Synthesis through Quantitative Objectives,” 5643:140–56. Springer, 2009. https://doi.org/10.1007/978-3-642-02658-4_14.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[61]
2009 | Conference Paper | IST-REx-ID: 4580 | OA
Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Alpaga: A Tool for Solving Parity Games with Imperfect Information,” 5505:58–61. Springer, 2009. https://doi.org/10.1007/978-3-642-00768-2_7.
View | Files available | DOI | Download (ext.)
 
[60]
2009 | Technical Report | IST-REx-ID: 5393 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. Gist: A Solver for Probabilistic Games. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0003.
[Published Version] View | Files available | DOI
 
[59]
2009 | Technical Report | IST-REx-ID: 5394 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0002.
[Published Version] View | Files available | DOI
 
[58]
2009 | Technical Report | IST-REx-ID: 5392 | OA
Chatterjee, Krishnendu. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0004.
[Published Version] View | Files available | DOI
 
[57]
2009 | Technical Report | IST-REx-ID: 5395 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0001.
[Published Version] View | Files available | DOI
 
[56]
2008 | Conference Paper | IST-REx-ID: 3501
Adler, B Thomas, Krishnendu Chatterjee, Luca De Alfaro, Marco Faella, Ian Pye, and Vishwanath Raman. “Assigning Trust to Wikipedia Content.” ACM, 2008. https://doi.org/10.1145/1822258.1822293.
View | DOI
 
[55]
2008 | Conference Paper | IST-REx-ID: 3502
Chatterjee, Krishnendu, Luca De Alfaro, and Ian Pye. “Robust Content-Driven Reputation,” 33–42. ACM, 2008. https://doi.org/10.1145/1456377.1456387 .
View | DOI
 
[54]
2008 | Conference Paper | IST-REx-ID: 3504 | OA
Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath Raman. “Algorithms for Game Metrics,” 2:107–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008. https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745.
[Published Version] View | Files available | DOI
 
[53]
2008 | Conference Paper | IST-REx-ID: 3875
Chatterjee, Krishnendu, Thomas A Henzinger, and Koushik Sen. “Model-Checking Omega-Regular Properties of Interval Markov Chains,” 4962:302–17. Springer, 2008. https://doi.org/10.1007/978-3-540-78499-9_22.
View | DOI
 
[52]
2008 | Conference Paper | IST-REx-ID: 3873
Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Controller Synthesis with Budget Constraints,” 4981:72–86. Springer, 2008. https://doi.org/DOI: 10.1007/978-3-540-78929-1_6.
View | DOI
 
[51]
2008 | Conference Paper | IST-REx-ID: 3876
Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness,” 5215:124–40. Springer, 2008. https://doi.org/10.1007/978-3-540-85778-5_10.
View | Files available | DOI
 
[50]
2008 | Conference Paper | IST-REx-ID: 3877
Chatterjee, Krishnendu, Thomas A Henzinger, and Barbara Jobstmann. “Environment Assumptions for Synthesis,” 5201:147–61. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008. https://doi.org/10.1007/978-3-540-85361-9_14.
View | DOI
 
[49]
2008 | Conference Paper | IST-REx-ID: 3878 | OA
Chatterjee, Krishnendu, Luca De Alfaro, and Ritankar Majumdar. “The Complexity of Coverage,” 5356:91–106. Springer, 2008. https://doi.org/10.1007/978-3-540-89330-1_7.
View | DOI | Download (ext.)
 
[48]
2008 | Conference Paper | IST-REx-ID: 3874
Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Trading Infinite Memory for Uniform Randomness in Timed Games,” 4981:87–100. Springer, 2008. https://doi.org/10.1007/978-3-540-78929-1_7.
View | DOI
 
[47]
2008 | Conference Paper | IST-REx-ID: 3879
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Quantitative Languages,” 5213:385–400. Springer, 2008. https://doi.org/10.1007/978-3-540-87531-4_28.
View | DOI
 
[46]
2008 | Book Chapter | IST-REx-ID: 3872
Chatterjee, Krishnendu, and Thomas A Henzinger. “Value Iteration.” In 25 Years in Model Checking, 5000:107–38. Springer, 2008. https://doi.org/10.1007/978-3-540-69850-0_7.
View | DOI
 
[45]
2008 | Conference Paper | IST-REx-ID: 3880
Berwanger, Dietmar, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, and Sangram Raje. “Strategy Construction for Parity Games with Imperfect Information,” 5201:325–39. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008. https://doi.org/10.1007/978-3-540-85361-9.
View | Files available | DOI
 
[44]
2008 | Journal Article | IST-REx-ID: 4534
Chatterjee, Krishnendu, and Thomas A Henzinger. “Reduction of Stochastic Parity to Stochastic Mean-Payoff Games.” Information Processing Letters. Elsevier, 2008. https://doi.org/10.1016/j.ipl.2007.08.035.
View | DOI | Download (ext.)
 
[43]
2008 | Conference Paper | IST-REx-ID: 4546
Chatterjee, Krishnendu, Arkadeb Ghosal, Thomas A Henzinger, Daniel Iercan, Christoph Kirsch, Claudio Pinello, and Alberto Sangiovanni Vincentelli. “Logical Reliability of Interacting Real-Time Tasks,” 909–14. IEEE, 2008. https://doi.org/10.1145/1403375.1403595.
View | DOI | Download (ext.)
 
[42]
2008 | Journal Article | IST-REx-ID: 4548
Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Stochastic Limit-Average Games Are in EXPTIME.” International Journal of Game Theory. Springer, 2008. https://doi.org/10.1007/s00182-007-0110-5.
View | DOI | Download (ext.)
 
[41]
2007 | Conference Paper | IST-REx-ID: 3883
Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Generalized Parity Games,” 4423:153–67. Springer, 2007. https://doi.org/10.1007/978-3-540-71389-0_12.
View | DOI
 
[40]
2007 | Journal Article | IST-REx-ID: 3882
Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives.” Theoretical Computer Science. Elsevier, 2007. https://doi.org/10.1016/j.tcs.2007.07.047.
View | DOI
 
[39]
2007 | Conference Paper | IST-REx-ID: 3884
Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic,” 4703:59–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007. https://doi.org/10.1007/978-3-540-74407-8_5.
View | Files available | DOI
 
[38]
2007 | Conference Paper | IST-REx-ID: 3881
De Alfaro, Luca, Krishnendu Chatterjee, Marco Faella, and Axel Legay. “Qualitative Logics and Equivalences for Probabilistic Systems,” 237–48. IEEE, 2007. https://doi.org/10.1109/QEST.2007.15.
View | DOI
 
[37]
2007 | Conference Paper | IST-REx-ID: 3887
Chatterjee, Krishnendu. “Markov Decision Processes with Multiple Long-Run Average Objectives,” 4855:473–84. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007. https://doi.org/10.1007/978-3-540-77050-3_39.
View | DOI
 
[36]
2007 | Conference Paper | IST-REx-ID: 3886
Chatterjee, Krishnendu. “Stochastic Müller Games Are PSPACE-Complete,” 4855:436–48. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007. https://doi.org/10.1007/978-3-540-77050-3_36.
View | DOI
 
[35]
2007 | Conference Paper | IST-REx-ID: 3885
Chatterjee, Krishnendu. “Optimal Strategy Synthesis in Stochastic Müller Games,” 4423:138–52. Springer, 2007. https://doi.org/10.1007/978-3-540-71389-0_11.
View | DOI
 
[34]
2007 | Conference Paper | IST-REx-ID: 4537
Chatterjee, Krishnendu, and Thomas A Henzinger. “Assume-Guarantee Synthesis,” 4424:261–75. Springer, 2007. https://doi.org/10.1007/978-3-540-71209-1_21.
View | DOI
 
[33]
2007 | Journal Article | IST-REx-ID: 4547
Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Algorithms for Omega-Regular Games with Imperfect Information.” Logical Methods in Computer Science. International Federation of Computational Logic, 2007. https://doi.org/10.2168/LMCS-3(3:4)2007.
View | DOI
 
[32]
2007 | Thesis | IST-REx-ID: 4559
Chatterjee, Krishnendu. “Stochastic ω-Regular Games.” University of California, Berkeley, 2007.
View | Download (ext.)
 
[31]
2006 | Conference Paper | IST-REx-ID: 3449
Chatterjee, Krishnendu, Rhada Jagadeesan, and Corin Pitcher. “Games for Controls,” 70–82. IEEE, 2006. https://doi.org/10.1109/CSFW.2006.14.
View | DOI
 
[30]
2006 | Conference Paper | IST-REx-ID: 3499
Chatterjee, Krishnendu. “Nash Equilibrium for Upward-Closed Objectives,” 4207:271–86. Springer, 2006. https://doi.org/10.1007/11874683_18.
View | DOI
 
[29]
2006 | Conference Paper | IST-REx-ID: 3500
Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Algorithms for Büchi Games.” ACM, 2006.
View | Download (ext.)
 
[28]
2006 | Conference Paper | IST-REx-ID: 3890
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “The Complexity of Quantitative Concurrent Parity Games,” 678–87. SIAM, 2006. https://doi.org/10.1145/1109557.1109631.
View | DOI
 
[27]
2006 | Conference Paper | IST-REx-ID: 3889
Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Algorithms for Omega-Regular Games with Imperfect Information,” 4207:287–302. Springer, 2006. https://doi.org/10.1007/11874683_19.
View | DOI
 
[26]
2006 | Conference Paper | IST-REx-ID: 3891
Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives,” 4207:256–70. Springer, 2006. https://doi.org/10.1007/11874683_17.
View | DOI
 
[25]
2006 | Conference Paper | IST-REx-ID: 3888
Chatterjee, Krishnendu, and Thomas A Henzinger. “Strategy Improvement for Stochastic Rabin and Streett Games,” 4137:375–89. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2006. https://doi.org/10.1007/11817949_25.
View | DOI
 
[24]
2006 | Conference Paper | IST-REx-ID: 4539
Chatterjee, Krishnendu, and Thomas A Henzinger. “Finitary Winning in Omega-Regular Games,” 3920:257–71. Springer, 2006. https://doi.org/10.1007/11691372_17.
View | DOI
 
[23]
2006 | Conference Paper | IST-REx-ID: 4538
Chatterjee, Krishnendu, and Thomas A Henzinger. “Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games,” 3884:512–23. Springer, 2006. https://doi.org/10.1007/11672142_42.
View | DOI
 
[22]
2006 | Conference Paper | IST-REx-ID: 4551
Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Markov Decision Processes with Multiple Objectives,” 3884:325–36. Springer, 2006. https://doi.org/10.1007/11672142_26.
View | DOI
 
[21]
2006 | Journal Article | IST-REx-ID: 4550
Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziński. “Games with Secure Equilibria.” Theoretical Computer Science. Elsevier, 2006. https://doi.org/10.1016/j.tcs.2006.07.032.
View | DOI
 
[20]
2006 | Conference Paper | IST-REx-ID: 4549
Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, Thomas A Henzinger, Ritankar Majumdar, and Mariëlle Stoelinga. “Compositional Quantitative Reasoning,” 179–88. IEEE, 2006. https://doi.org/10.1109/QEST.2006.11.
View | DOI
 
[19]
2006 | Conference Paper | IST-REx-ID: 4552
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Strategy Improvement for Concurrent Reachability Games,” 291–300. IEEE, 2006. https://doi.org/10.1109/QEST.2006.48.
View | DOI
 
[18]
2005 | Conference Paper | IST-REx-ID: 3896
Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “Complexity of Compositional Model Checking of Computation Tree Logic on Simple Structures,” 3326:89–102. Springer, 2005. https://doi.org/10.1007/978-3-540-30536-1_13.
View | DOI
 
[17]
2005 | Conference Paper | IST-REx-ID: 3893
Chatterjee, Krishnendu. “Two-Player Nonzero-Sum ω-Regular Games,” 3653:413–27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2005. https://doi.org/10.1007/11539452_32.
View | DOI
 
[16]
2005 | Conference Paper | IST-REx-ID: 3892
Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziński. “Games with Secure Equilibria,” 3657:141–61. Springer, 2005. https://doi.org/10.1007/11561163_7.
View | DOI
 
[15]
2005 | Conference Paper | IST-REx-ID: 4541
Chatterjee, Krishnendu, and Thomas A Henzinger. “Semiperfect-Information Games,” 3821:1–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2005. https://doi.org/10.1007/11590156_1.
View | DOI
 
[14]
2005 | Conference Paper | IST-REx-ID: 4553
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “The Complexity of Stochastic Rabin and Streett Games,” 3580:878–90. Springer, 2005. https://doi.org/10.1007/11523468_71.
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 4554
Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziński. “Mean-Payoff Parity Games,” 178–87. IEEE, 2005. https://doi.org/10.1109/LICS.2005.26.
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 4560
Chakrabarti, Arindam, Krishnendu Chatterjee, Thomas A Henzinger, Orna Kupferman, and Ritankar Majumdar. “Verifying Quantitative Properties Using Bound Functions,” 3725:50–64. Springer, 2005. https://doi.org/10.1007/11560548_7.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 4557
Chatterjee, Krishnendu, Thomas A Henzinger, Ranjit Jhala, and Ritankar Majumdar. “Counterexample-Guided Planning,” 104–11. AUAI Press, 2005.
View | Download (ext.)
 
[10]
2004 | Conference Paper | IST-REx-ID: 3894
Chatterjee, Krishnendu, Ritankar Majumdar, and Marcin Jurdziński. “On Nash Equilibria in Stochastic Games,” 3210:26–40. Springer, 2004. https://doi.org/10.1007/978-3-540-30124-0_6.
View | DOI
 
[9]
2004 | Conference Paper | IST-REx-ID: 3895
Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziński. “Games with Secure Equilibria,” 160–69. IEEE, 2004. https://doi.org/10.1109/LICS.2004.1319610.
View | DOI
 
[8]
2004 | Conference Paper | IST-REx-ID: 4555
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Trading Memory for Randomness,” 206–17. IEEE, 2004. https://doi.org/10.1109/QEST.2004.10051.
View | DOI
 
[7]
2004 | Conference Paper | IST-REx-ID: 4558
Chatterjee, Krishnendu, Marcin Jurdziński, and Thomas A Henzinger. “Quantitative Stochastic Parity Games,” 121–30. SIAM, 2004.
View
 
[6]
2004 | Journal Article | IST-REx-ID: 4556
Chatterjee, Krishnendu, Di Ma, Ritankar Majumdar, Tian Zhao, Thomas A Henzinger, and Jens Palsberg. “Stack Size Analysis for Interrupt-Driven Programs.” Information and Computation. Elsevier, 2004. https://doi.org/10.1016/j.ic.2004.06.001.
View | DOI
 
[5]
2003 | Conference Paper | IST-REx-ID: 3897
Chatterjee, Krishnendu, Marcin Jurdziński, and Thomas A Henzinger. “Simple Stochastic Parity Games,” 2803:100–113. Springer, 2003. https://doi.org/10.1007/978-3-540-45220-1_11.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3898
Chatterjee, Krishnendu, Di Ma, Ritankar Majumdar, Tian Zhao, Thomas A Henzinger, and Jens Palsberg. “Stack Size Analysis for Interrupt-Driven Programs,” 2694:109–26. Springer, 2003. https://doi.org/10.1007/3-540-44898-5_7.
View | DOI
 
[3]
2003 | Journal Article | IST-REx-ID: 3593
Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “A Branching Time Temporal Framework for Quantitative Reasoning.” Journal of Automated Reasoning. Springer, 2003. https://doi.org/10.1023/A:1023217515688.
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 3448
Mallick, Sanhita, Krishnendu Chatterjee, Arif Merchant, and Pallab Dasgupta. “Implementation of Shape Grammar for Plan Analysis.” Elsevier, 2002.
View
 
[1]
2001 | Conference Paper | IST-REx-ID: 3447
Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “Weighted Quantified Computation Tree Logic.” Elsevier, 2001.
View
 
Marked Publication(s)

Search

Filter Publications

431 Publications

Mark all

[431]
2024 | Conference Paper | IST-REx-ID: 15006 | OA
Hirvonen, Juho, Laura Schmid, Krishnendu Chatterjee, and Stefan Schmid. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.” In 27th International Conference on Principles of Distributed Systems, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.OPODIS.2023.11.
[Published Version] View | Files available | DOI | arXiv
 
[430]
2024 | Journal Article | IST-REx-ID: 15083 | OA
Hübner, Valentin, Manuel Staab, Christian Hilbe, Krishnendu Chatterjee, and Maria Kleshnina. “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.” Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences, 2024. https://doi.org/10.1073/pnas.2315558121.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
[429]
2024 | Journal Article | IST-REx-ID: 15297 | OA
Svoboda, Jakub, Soham Shrikant Joshi, Josef Tkadlec, and Krishnendu Chatterjee. “Amplifiers of Selection for the Moran Process with Both Birth-Death and Death-Birth Updating.” PLoS Computational Biology. Public Library of Science, 2024. https://doi.org/10.1371/journal.pcbi.1012008.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[428]
2023 | Conference Paper | IST-REx-ID: 12676 | OA
Chatterjee, Krishnendu, Tobias Meggendorfer, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Faster Algorithm for Turn-Based Stochastic Games with Bounded Treewidth.” In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, 4590–4605. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/1.9781611977554.ch173.
[Published Version] View | DOI | Download Published Version (ext.)
 
[427]
2023 | Conference Paper | IST-REx-ID: 13142 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.” In Tools and Algorithms for the Construction and Analysis of Systems , 13993:3–25. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30823-9_1.
[Published Version] View | Files available | DOI
 
[426]
2023 | Journal Article | IST-REx-ID: 12787 | OA
Svoboda, Jakub, Josef Tkadlec, Kamran Kaveh, and Krishnendu Chatterjee. “Coexistence Times in the Moran Process with Environmental Heterogeneity.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. The Royal Society, 2023. https://doi.org/10.1098/rspa.2022.0685.
[Published Version] View | Files available | DOI | WoS
 
[425]
2023 | Journal Article | IST-REx-ID: 12861 | OA
Schmid, Laura, Farbod Ekbatani, Christian Hilbe, and Krishnendu Chatterjee. “Quantitative Assessment Can Stabilize Indirect Reciprocity under Imperfect Information.” Nature Communications. Springer Nature, 2023. https://doi.org/10.1038/s41467-023-37817-x.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[424]
2023 | Conference Paper | IST-REx-ID: 14242 | OA
Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, Thomas A Henzinger, and Daniela Rus. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.” In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 37:14964–73. Association for the Advancement of Artificial Intelligence, 2023. https://doi.org/10.1609/aaai.v37i12.26747.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[423]
2023 | Conference Paper | IST-REx-ID: 14318 | OA
Sun, Yican, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.” In Computer Aided Verification, 13966:16–39. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37709-9_2.
[Published Version] View | Files available | DOI
 
[422]
2023 | Conference Paper | IST-REx-ID: 14317 | OA
Akshay, S., Krishnendu Chatterjee, Tobias Meggendorfer, and Dorde Zikelic. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.” In International Conference on Computer Aided Verification, 13966:86–112. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37709-9_5.
[Published Version] View | Files available | DOI
 
[421]
2023 | Journal Article | IST-REx-ID: 12738 | OA
Chatterjee, Krishnendu, Joost P Katoen, Stefanie Mohr, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Objectives.” Formal Methods in System Design. Springer Nature, 2023. https://doi.org/10.1007/s10703-023-00411-4.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 
[420]
2023 | Conference Paper | IST-REx-ID: 14417 | OA
Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Entropic Risk for Turn-Based Stochastic Games.” In 48th International Symposium on Mathematical Foundations of Computer Science, Vol. 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.MFCS.2023.15.
[Published Version] View | Files available | DOI | arXiv
 
[419]
2023 | Conference Paper | IST-REx-ID: 14559
Ansaripour, Matin, Krishnendu Chatterjee, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.” In 21st International Symposium on Automated Technology for Verification and Analysis, 14215:357–79. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-45329-8_17.
View | DOI
 
[418]
2023 | Journal Article | IST-REx-ID: 14657 | OA
Tkadlec, Josef, Kamran Kaveh, Krishnendu Chatterjee, and Martin A. Nowak. “Evolutionary Dynamics of Mutants That Modify Population Structure.” Journal of the Royal Society, Interface. The Royal Society, 2023. https://doi.org/10.1098/rsif.2023.0355.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
[417]
2023 | Journal Article | IST-REx-ID: 13258 | OA
Kleshnina, Maria, Christian Hilbe, Stepan Simsa, Krishnendu Chatterjee, and Martin A. Nowak. “The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games.” Nature Communications. Springer Nature, 2023. https://doi.org/10.1038/s41467-023-39625-9.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[416]
2023 | Conference Paper | IST-REx-ID: 14736
Bastankhah, Mahsa, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control.” In 27th International Conference on Financial Cryptography and Data Security, 13950:309–25. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-47754-6_18.
View | DOI
 
[415]
2023 | Journal Article | IST-REx-ID: 14778 | OA
Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.” Formal Aspects of Computing. Association for Computing Machinery, 2023. https://doi.org/10.1145/3585391.
[Published Version] View | Files available | DOI | arXiv
 
[414]
2023 | Conference Paper | IST-REx-ID: 14830
Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 37:11926–35. Association for the Advancement of Artificial Intelligence, 2023. https://doi.org/10.1609/aaai.v37i10.26407.
[Preprint] View | Files available | DOI | arXiv
 
[413]
2023 | Conference Paper | IST-REx-ID: 15023 | OA
Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” In 37th Conference on Neural Information Processing Systems, 2023.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[412]
2022 | Conference Paper | IST-REx-ID: 12102 | OA
Ahmadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi Hemami, and Dorde Zikelic. “Algorithms and Hardness Results for Computing Cores of Markov Chains.” In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29.
[Published Version] View | Files available | DOI
 
[411]
2022 | Conference Paper | IST-REx-ID: 12101 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Complexity of Spatial Games.” In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11.
[Published Version] View | Files available | DOI
 
[410]
2022 | Preprint | IST-REx-ID: 12677 | OA
Chatterjee, Krishnendu, Mona Mohammadi, and Raimundo J Saona Urmeneta. “Repeated Prophet Inequality with Near-Optimal Bounds.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2209.14368.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[409]
2022 | Journal Article | IST-REx-ID: 10731 | OA
Svoboda, Jakub, Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Infection Dynamics of COVID-19 Virus under Lockdown and Reopening.” Scientific Reports. Springer Nature, 2022. https://doi.org/10.1038/s41598-022-05333-5.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[408]
2022 | Journal Article | IST-REx-ID: 12257 | OA
Chatterjee, Krishnendu, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, and Josef Tkadlec. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.” Physical Review E. American Physical Society, 2022. https://doi.org/10.1103/physreve.106.034321.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[407]
2022 | Journal Article | IST-REx-ID: 12280 | OA
Schmid, Laura, Christian Hilbe, Krishnendu Chatterjee, and Martin Nowak. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.” PLOS Computational Biology. Public Library of Science, 2022. https://doi.org/10.1371/journal.pcbi.1010149.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[406]
2022 | Journal Article | IST-REx-ID: 9311 | OA
Chatterjee, Krishnendu, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics of Operations Research. Institute for Operations Research and the Management Sciences, 2022. https://doi.org/10.1287/moor.2020.1116.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[405]
2022 | Journal Article | IST-REx-ID: 11402 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” Journal of Computer and System Sciences. Elsevier, 2022. https://doi.org/10.1016/j.jcss.2022.04.003.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[404]
2022 | Conference Paper | IST-REx-ID: 12000 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Tobias Meggendorfer, and Dorde Zikelic. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.” In Proceedings of the 34th International Conference on Computer Aided Verification, 13371:55–78. Springer, 2022. https://doi.org/10.1007/978-3-031-13185-1_4.
[Published Version] View | Files available | DOI | WoS
 
[403]
2022 | Journal Article | IST-REx-ID: 12511 | OA
Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, and Thomas A Henzinger. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i7.20695.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[402]
2022 | Preprint | IST-REx-ID: 14601 | OA
Zikelic, Dorde, Mathias Lechner, Krishnendu Chatterjee, and Thomas A Henzinger. “Learning Stabilizing Policies in Stochastic Control Systems.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2205.11991.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[401]
2022 | Preprint | IST-REx-ID: 14600 | OA
Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2210.05308.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[400]
2021 | Conference Paper | IST-REx-ID: 10054 | OA
Chatterjee, Krishnendu, Monika H Henzinger, Sagar Sudhir Kale, and Alexander Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” In 48th International Colloquium on Automata, Languages, and Programming, Vol. 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.ICALP.2021.124.
[Published Version] View | Files available | DOI
 
[399]
2021 | Conference Paper | IST-REx-ID: 10629 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Quantitative Verification on Product Graphs of Small Treewidth.” In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42.
[Published Version] View | Files available | DOI
 
[398]
2021 | Conference Paper | IST-REx-ID: 10847 | OA
Tomášek, Petr, Karel Horák, Aditya Aradhye, Branislav Bošanský, and Krishnendu Chatterjee. “Solving Partially Observable Stochastic Shortest-Path Games.” In 30th International Joint Conference on Artificial Intelligence, 4182–89. International Joint Conferences on Artificial Intelligence, 2021. https://doi.org/10.24963/ijcai.2021/575.
[Published Version] View | DOI | Download Published Version (ext.)
 
[397]
2021 | Conference Paper | IST-REx-ID: 12767 | OA
Bansal, Suguman, Krishnendu Chatterjee, and Moshe Y. Vardi. “On Satisficing in Quantitative Games.” In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12651:20–37. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-72016-2.
[Published Version] View | Files available | DOI | arXiv
 
[396]
2021 | Conference Paper | IST-REx-ID: 10667 | OA
Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In 35th Conference on Neural Information Processing Systems, 2021. https://doi.org/10.48550/arXiv.2111.03165.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[395]
2021 | Journal Article | IST-REx-ID: 8793 | OA
Zeiner, Martin, Ulrich Schmid, and Krishnendu Chatterjee. “Optimal Strategies for Selecting Coordinators.” Discrete Applied Mathematics. Elsevier, 2021. https://doi.org/10.1016/j.dam.2020.10.022.
[Published Version] View | Files available | DOI | WoS
 
[394]
2021 | Journal Article | IST-REx-ID: 9381 | OA
Kleshnina, Maria, Sabrina S. Streipert, Jerzy A. Filar, and Krishnendu Chatterjee. “Mistakes Can Stabilise the Dynamics of Rock-Paper-Scissors Games.” PLoS Computational Biology. Public Library of Science, 2021. https://doi.org/10.1371/journal.pcbi.1008523.
[Published Version] View | Files available | DOI | WoS
 
[393]
2021 | Journal Article | IST-REx-ID: 9640 | OA
Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Fast and Strong Amplifiers of Natural Selection.” Nature Communications. Springer Nature, 2021. https://doi.org/10.1038/s41467-021-24271-w.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[392]
2021 | Conference Paper | IST-REx-ID: 9646 | OA
Wang, Jinyi, Yican Sun, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 1171–86. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454102.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[391]
2021 | Conference Paper | IST-REx-ID: 9645 | OA
Asadi, Ali, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, and Mohammad Mahdavi. “Polynomial Reachability Witnesses via Stellensätze.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 772–87. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454076.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[390]
2021 | Conference Paper | IST-REx-ID: 10002 | OA
Chatterjee, Krishnendu, Wolfgang Dvorak, Monika H Henzinger, and Alexander Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470739.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[389]
2021 | Conference Paper | IST-REx-ID: 10004 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470595.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[388]
2021 | Conference Paper | IST-REx-ID: 9987 | OA
Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.” In 33rd International Conference on Computer-Aided Verification , 12759:341–66. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-81685-8_16.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[387]
2021 | Journal Article | IST-REx-ID: 10191 | OA
Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2021. https://doi.org/10.1145/3485541.
[Published Version] View | Files available | DOI | arXiv
 
[386]
2021 | Journal Article | IST-REx-ID: 9293 | OA
Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” Artificial Intelligence. Elsevier, 2021. https://doi.org/10.1016/j.artint.2021.103499.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[385]
2021 | Journal Article | IST-REx-ID: 9393 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design. Springer, 2021. https://doi.org/10.1007/s10703-021-00373-5.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[384]
2021 | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.” In 24th International Symposium on Formal Methods, 13047:619–39. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90870-6_33.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[383]
2021 | Conference Paper | IST-REx-ID: 9644 | OA
Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “Proving Non-Termination by Program Reversal.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 1033–48. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454093.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[382]
2021 | Research Data Reference | IST-REx-ID: 15284 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “RevTerm.” Association for Computing Machinery, 2021. https://doi.org/10.1145/3410304.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[381]
2021 | Journal Article | IST-REx-ID: 9997 | OA
Schmid, Laura, Pouya Shati, Christian Hilbe, and Krishnendu Chatterjee. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” Scientific Reports. Springer Nature, 2021. https://doi.org/10.1038/s41598-021-96932-1.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[380]
2021 | Journal Article | IST-REx-ID: 9402 | OA
Schmid, Laura, Krishnendu Chatterjee, Christian Hilbe, and Martin A. Nowak. “A Unified Framework of Direct and Indirect Reciprocity.” Nature Human Behaviour. Springer Nature, 2021. https://doi.org/10.1038/s41562-021-01114-8.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[379]
2020 | Conference Paper | IST-REx-ID: 7346 | OA
Schmid, Laura, Krishnendu Chatterjee, and Stefan Schmid. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” In Proceedings of the 23rd International Conference on Principles of Distributed Systems, Vol. 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21.
[Preprint] View | Files available | DOI | arXiv
 
[378]
2020 | Conference Paper | IST-REx-ID: 8600 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23.
[Published Version] View | Files available | DOI | arXiv
 
[377]
2020 | Conference Paper | IST-REx-ID: 8533 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.22.
[Published Version] View | Files available | DOI | arXiv
 
[376]
2020 | Conference Paper | IST-REx-ID: 7955 | OA
Ashok, Pranav, Krishnendu Chatterjee, Jan Kretinsky, Maximilian Weininger, and Tobias Winkler. “Approximating Values of Generalized-Reachability Stochastic Games.” In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , 102–15. Association for Computing Machinery, 2020. https://doi.org/10.1145/3373718.3394761.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[375]
2020 | Journal Article | IST-REx-ID: 8767 | OA
Kaveh, Kamran, Alex McAvoy, Krishnendu Chatterjee, and Martin A. Nowak. “The Moran Process on 2-Chromatic Graphs.” PLOS Computational Biology. Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1008402.
[Published Version] View | Files available | DOI | WoS
 
[374]
2020 | Journal Article | IST-REx-ID: 8789 | OA
Kleshnina, Maria, Sabrina Streipert, Jerzy Filar, and Krishnendu Chatterjee. “Prioritised Learning in Snowdrift-Type Games.” Mathematics. MDPI, 2020. https://doi.org/10.3390/math8111945.
[Published Version] View | Files available | DOI | WoS
 
[373]
2020 | Journal Article | IST-REx-ID: 8788
Pavlogiannis, Andreas, Nico Schaumberger, Ulrich Schmid, and Krishnendu Chatterjee. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE, 2020. https://doi.org/10.1109/TCAD.2020.3012803.
View | DOI | WoS
 
[372]
2020 | Conference Paper | IST-REx-ID: 8193
Chatterjee, Krishnendu, Martin Chmelik, Deep Karkhanis, Petr Novotný, and Amélie Royer. “Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.” In Proceedings of the 30th International Conference on Automated Planning and Scheduling, 30:48–56. Association for the Advancement of Artificial Intelligence, 2020.
View | Files available
 
[371]
2020 | Conference Paper | IST-REx-ID: 8272 | OA
Chatterjee, Krishnendu, Joost P Katoen, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” In International Conference on Computer Aided Verification, 12225:398–420. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-53291-8_21.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[370]
2020 | Journal Article | IST-REx-ID: 7212 | OA
Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.” PLoS Computational Biology. Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1007494.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[369]
2020 | Research Data Reference | IST-REx-ID: 9814 | OA
Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners.” Royal Society, 2020. https://doi.org/10.6084/m9.figshare.5973013.v1.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[368]
2020 | Conference Paper | IST-REx-ID: 8324 | OA
Wang, Peixin, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, and Ming Xu. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.” In Proceedings of the ACM on Programming Languages, Vol. 4. ACM, 2020. https://doi.org/10.1145/3371093.
[Published Version] View | Files available | DOI | arXiv
 
[367]
2020 | Journal Article | IST-REx-ID: 15055 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Petr Novotný, and Jiří Vahala. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” Proceedings of the 34th AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i06.6531.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[366]
2020 | Conference Paper | IST-REx-ID: 7810 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.” In European Symposium on Programming, 12075:112–40. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-44914-8_5.
[Published Version] View | Files available | DOI | WoS
 
[365]
2020 | Conference Paper | IST-REx-ID: 8728 | OA
Asadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.” In Automated Technology for Verification and Analysis, 12302:253–70. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-59152-6_14.
[Submitted Version] View | Files available | DOI | WoS
 
[364]
2020 | Conference Paper | IST-REx-ID: 8089 | OA
Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “Polynomial Invariant Generation for Non-Deterministic Recursive Programs.” In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, 672–87. Association for Computing Machinery, 2020. https://doi.org/10.1145/3385412.3385969.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[363]
2019 | Conference Paper | IST-REx-ID: 6887 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7.
[Published Version] View | Files available | DOI
 
[362]
2019 | Conference Paper | IST-REx-ID: 6885 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27.
[Published Version] View | Files available | DOI
 
[361]
2019 | Conference Paper | IST-REx-ID: 6889 | OA
Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6.
[Published Version] View | Files available | DOI
 
[360]
2019 | Conference Paper | IST-REx-ID: 5948
Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.” In International Conference on Verification, Model Checking, and Abstract Interpretation, 11388:468–90. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-11245-5_22.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[359]
2019 | Conference Paper | IST-REx-ID: 6462 | OA
Avni, Guy, Roderick Bloem, Krishnendu Chatterjee, Thomas A Henzinger, Bettina Konighofer, and Stefan Pranger. “Run-Time Optimization for Learned Controllers through Quantitative Games.” In 31st International Conference on Computer-Aided Verification, 11561:630–49. Springer, 2019. https://doi.org/10.1007/978-3-030-25540-4_36.
[Published Version] View | Files available | DOI | WoS
 
[358]
2019 | Journal Article | IST-REx-ID: 6836 | OA
Hauser, Oliver P., Christian Hilbe, Krishnendu Chatterjee, and Martin A. Nowak. “Social Dilemmas among Unequals.” Nature. Springer Nature, 2019. https://doi.org/10.1038/s41586-019-1488-5.
[Submitted Version] View | Files available | DOI | WoS
 
[357]
2019 | Conference Paper | IST-REx-ID: 6942 | OA
Ashok, Pranav, Tomáš Brázdil, Krishnendu Chatterjee, Jan Křetínský, Christoph Lampert, and Viktor Toman. “Strategy Representation by Decision Trees with Linear Classifiers.” In 16th International Conference on Quantitative Evaluation of Systems, 11785:109–28. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-30281-8_7.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[356]
2019 | Conference Paper | IST-REx-ID: 7183 | OA
Brázdil, Tomás, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, and Dominik Velan. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.” In International Symposium on Automated Technology for Verification and Analysis, 11781:462–78. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-31784-3_27.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[355]
2019 | Journal Article | IST-REx-ID: 7210 | OA
Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.” Communications Biology. Springer Nature, 2019. https://doi.org/10.1038/s42003-019-0373-y.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[354]
2019 | Conference Paper | IST-REx-ID: 10190 | OA
Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric Dynamic Partial Order Reduction.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Vol. 3. ACM, 2019. https://doi.org/10.1145/3360550.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[353]
2019 | Conference Paper | IST-REx-ID: 7402 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” In 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. IEEE, 2019. https://doi.org/10.1109/lics.2019.8785706.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[352]
2019 | Conference Paper | IST-REx-ID: 6780 | OA
Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Vol. 3. ACM, 2019. https://doi.org/10.1145/3360555.
[Published Version] View | Files available | DOI | arXiv
 
[351]
2019 | Journal Article | IST-REx-ID: 6380 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.” Proceedings of the ACM on Programming Languages. ACM, 2019. https://doi.org/10.1145/3290366.
[Published Version] View | Files available | DOI
 
[350]
2019 | Conference Paper | IST-REx-ID: 6056 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” In IEEE International Conference on Blockchain and Cryptocurrency. IEEE, 2019. https://doi.org/10.1109/BLOC.2019.8751326.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[349]
2019 | Conference Paper | IST-REx-ID: 6378 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:374–81. ACM, 2019. https://doi.org/10.1145/3297280.3297319.
[Submitted Version] View | Files available | DOI | WoS
 
[348]
2019 | Conference Paper | IST-REx-ID: 6175 | OA
Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.” In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 204–20. Association for Computing Machinery, 2019. https://doi.org/10.1145/3314221.3314581.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[347]
2019 | Conference Paper | IST-REx-ID: 6490 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “The Treewidth of Smart Contracts.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:400–408. ACM, n.d. https://doi.org/10.1145/3297280.3297322.
[Submitted Version] View | Files available | DOI | WoS
 
[346]
2019 | Journal Article | IST-REx-ID: 7158 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3363525.
[Submitted Version] View | Files available | DOI | WoS
 
[345]
2019 | Journal Article | IST-REx-ID: 7014 | OA
Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3339984.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[344]
2018 | Conference Paper | IST-REx-ID: 10883 | OA
Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k.
[Published Version] View | Files available | DOI | arXiv
 
[343]
2018 | Conference Paper | IST-REx-ID: 325 | OA
Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,” Vol. 2. ACM, 2018. https://doi.org/10.1145/3158122.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[342]
2018 | Book Chapter | IST-REx-ID: 59
Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.” In Handbook of Model Checking, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_27.
View | DOI
 
[341]
2018 | Book Chapter | IST-REx-ID: 86 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.” In Principles of Modeling, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. https://doi.org/10.1007/978-3-319-95246-8_9.
[Submitted Version] View | Files available | DOI
 
[340]
2018 | Journal Article | IST-REx-ID: 454 | OA
Reiter, Johannes, Christian Hilbe, David Rand, Krishnendu Chatterjee, and Martin Nowak. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-017-02721-8.
[Published Version] View | Files available | DOI | WoS
 
[339]
2018 | Conference Paper | IST-REx-ID: 143 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Antonín Kučera, Petr Novotný, Dominik Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS,” F138033:185–94. IEEE, 2018. https://doi.org/10.1145/3209108.3209191.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[338]
2018 | Journal Article | IST-REx-ID: 157 | OA
Hilbe, Christian, Štepán Šimsa, Krishnendu Chatterjee, and Martin Nowak. “Evolution of Cooperation in Stochastic Games.” Nature. Nature Publishing Group, 2018. https://doi.org/10.1038/s41586-018-0277-x.
[Submitted Version] View | Files available | DOI | WoS
 
[337]
2018 | Conference Paper | IST-REx-ID: 310 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter,” 2341–56. ACM, 2018. https://doi.org/10.1137/1.9781611975031.151.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[336]
2018 | Conference Paper | IST-REx-ID: 5679 | OA
Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.” edited by Sukyoung Ryu, 11275:181–201. Springer, 2018. https://doi.org/10.1007/978-3-030-02768-1_11.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[335]
2018 | Journal Article | IST-REx-ID: 419 | OA
Hilbe, Christian, Krishnendu Chatterjee, and Martin Nowak. “Partners and Rivals in Direct Reciprocity.” Nature Human Behaviour. Nature Publishing Group, 2018. https://doi.org/10.1038/s41562-018-0320-9.
[Submitted Version] View | Files available | DOI | WoS
 
[334]
2018 | Conference Paper | IST-REx-ID: 79 | OA
Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,” 11024:53–70. Springer, 2018. https://doi.org/10.1007/978-3-319-99154-2_4.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[333]
2018 | Conference Paper | IST-REx-ID: 297 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407. Springer, 2018. https://doi.org/10.1007/978-3-319-89960-2_21.
[Published Version] View | Files available | DOI | WoS
 
[332]
2018 | Conference Paper | IST-REx-ID: 141 | OA
Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,” 10982:178–97. Springer, 2018. https://doi.org/10.1007/978-3-319-96142-2_13.
[Published Version] View | Files available | DOI | WoS
 
[331]
2018 | Journal Article | IST-REx-ID: 5993 | OA
Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3174800.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
[330]
2018 | Conference Paper | IST-REx-ID: 25 | OA
Horák, Karel, Branislav Bošanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018–July:4764–70. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/662.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
[329]
2018 | Conference Paper | IST-REx-ID: 24 | OA
Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[328]
2018 | Conference Paper | IST-REx-ID: 34 | OA
Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[327]
2018 | Conference Paper | IST-REx-ID: 35 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In 28th International Conference on Automated Planning and Scheduling . AAAI Press, 2018.
View | Files available | Download None (ext.) | WoS | arXiv
 
[326]
2018 | Journal Article | IST-REx-ID: 738 | OA
Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4.
[Published Version] View | Files available | DOI | WoS
 
[325]
2018 | Journal Article | IST-REx-ID: 198 | OA
Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface. The Royal Society, 2018. https://doi.org/10.1098/rsif.2018.0073.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[324]
2018 | Journal Article | IST-REx-ID: 5751 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin A. Nowak. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology. Springer Nature, 2018. https://doi.org/10.1038/s42003-018-0078-7.
[Published Version] View | Files available | DOI | WoS
 
[323]
2018 | Conference Paper | IST-REx-ID: 66 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11.
[Published Version] View | Files available | DOI | arXiv
 
[322]
2018 | Conference Paper | IST-REx-ID: 311 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Yaron Velner. “Quantitative Analysis of Smart Contracts,” 10801:739–67. Springer, 2018. https://doi.org/10.1007/978-3-319-89884-1_26.
[Published Version] View | Files available | DOI
 
[321]
2018 | Conference Paper | IST-REx-ID: 6340 | OA
Goharshady, Amir Kafshdar, Ali Behrouz, and Krishnendu Chatterjee. “Secure Credit Reporting on the Blockchain.” In Proceedings of the IEEE International Conference on Blockchain, 1343–48. IEEE, 2018. https://doi.org/10.1109/Cybermatics_2018.2018.00231.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[320]
2018 | Journal Article | IST-REx-ID: 6009 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3210257.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[319]
2018 | Conference Paper | IST-REx-ID: 5977 | OA
Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Nastaran Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018:4700–4707. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/653.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[318]
2018 | Journal Article | IST-REx-ID: 2 | OA
Hilbe, Christian, Laura Schmid, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.” PNAS. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1810565115.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | PubMed | Europe PMC
 
[317]
2017 | Journal Article | IST-REx-ID: 464 | OA
Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.
[Published Version] View | Files available | DOI | arXiv
 
[316]
2017 | Journal Article | IST-REx-ID: 466 | OA
Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(2:15)2017.
[Published Version] View | Files available | DOI
 
[315]
2017 | Journal Article | IST-REx-ID: 467 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3152769.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[314]
2017 | Journal Article | IST-REx-ID: 465 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.
[Published Version] View | Files available | DOI
 
[313]
2017 | Journal Article | IST-REx-ID: 512 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports. Nature Publishing Group, 2017. https://doi.org/10.1038/s41598-017-00107-w.
[Published Version] View | Files available | DOI
 
[312]
2017 | Journal Article | IST-REx-ID: 10416 | OA
Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158118.
[Published Version] View | Files available | DOI | arXiv
 
[311]
2017 | Technical Report | IST-REx-ID: 5455 | OA
Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-870-v1-1.
[Published Version] View | Files available | DOI
 
[310]
2017 | Journal Article | IST-REx-ID: 10417 | OA
Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158119.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[309]
2017 | Technical Report | IST-REx-ID: 5456 | OA
Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-872-v1-1.
[Published Version] View | Files available | DOI
 
[308]
2017 | Conference Paper | IST-REx-ID: 551 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.
[Published Version] View | Files available | DOI
 
[307]
2017 | Conference Paper | IST-REx-ID: 552 | OA
Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39.
[Published Version] View | Files available | DOI
 
[306]
2017 | Conference Paper | IST-REx-ID: 553 | OA
Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[305]
2017 | Book Chapter | IST-REx-ID: 625 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.” In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017. https://doi.org/10.1007/978-3-319-63121-9_18.
[Submitted Version] View | Files available | DOI
 
[304]
2017 | Conference Paper | IST-REx-ID: 628 | OA
Chatterjee, Krishnendu, Hongfei Fu, and Aniket Murhekar. “Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds.” edited by Rupak Majumdar and Viktor Kunčak, 10426:118–39. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_6.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[303]
2017 | Conference Paper | IST-REx-ID: 645 | OA
Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_10.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[302]
2017 | Conference Paper | IST-REx-ID: 6519 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. https://doi.org/10.4230/LIPICS.CSL.2017.18.
[Published Version] View | Files available | DOI
 
[301]
2017 | Journal Article | IST-REx-ID: 653 | OA
Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Božić, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics. Nature Publishing Group, 2017. https://doi.org/10.1038/ng.3764.
[Submitted Version] View | Files available | DOI | PubMed | Europe PMC
 
[300]
2017 | Journal Article | IST-REx-ID: 671 | OA
Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak. “Memory-n Strategies of Direct Reciprocity.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1621239114.
[Published Version] View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 
[299]
2017 | Journal Article | IST-REx-ID: 681 | OA
Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean Raskin. “Doomsday Equilibria for Omega-Regular Games.” Information and Computation. Elsevier, 2017. https://doi.org/10.1016/j.ic.2016.10.012.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[298]
2017 | Journal Article | IST-REx-ID: 684 | OA
Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” Journal of Symbolic Logic. Cambridge University Press, 2017. https://doi.org/10.1017/jsl.2016.71.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[297]
2017 | Conference Paper | IST-REx-ID: 711 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Bidirectional Nested Weighted Automata,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.CONCUR.2017.5.
[Published Version] View | Files available | DOI
 
[296]
2017 | Journal Article | IST-REx-ID: 716 | OA
Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.” Journal of the ACM. ACM, 2017. https://doi.org/10.1145/3121408.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[295]
2017 | Journal Article | IST-REx-ID: 717 | OA
Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Journal of Computer and System Sciences. Academic Press, 2017. https://doi.org/10.1016/j.jcss.2017.04.005.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[294]
2017 | Journal Article | IST-REx-ID: 719
Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and SYNT 2014.” Acta Informatica. Springer, 2017. https://doi.org/10.1007/s00236-017-0299-0.
View | DOI
 
[293]
2017 | Journal Article | IST-REx-ID: 1407 | OA
Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid Systems. Elsevier, 2017. https://doi.org/10.1016/j.nahs.2016.04.006.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[292]
2017 | Journal Article | IST-REx-ID: 1294 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Trading Performance for Stability in Markov Decision Processes.” Journal of Computer and System Sciences. Elsevier, 2017. https://doi.org/10.1016/j.jcss.2016.09.009.
[Published Version] View | Files available | DOI | WoS
 
[291]
2017 | Journal Article | IST-REx-ID: 1080 | OA
Reiter, Johannes, Alvin Makohon Moore, Jeffrey Gerold, Ivana Božić, Krishnendu Chatterjee, Christine Iacobuzio Donahue, Bert Vogelstein, and Martin Nowak. “Reconstructing Metastatic Seeding Patterns of Human Cancers.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms14114.
[Published Version] View | Files available | DOI | WoS
 
[290]
2017 | Journal Article | IST-REx-ID: 1065 | OA
Chatterjee, Krishnendu, and Georg F Osang. “Pushdown Reachability with Constant Treewidth.” Information Processing Letters. Elsevier, 2017. https://doi.org/10.1016/j.ipl.2017.02.003.
[Submitted Version] View | Files available | DOI | WoS
 
[289]
2017 | Journal Article | IST-REx-ID: 1066
Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. “Quantitative Fair Simulation Games.” Information and Computation. Elsevier, 2017. https://doi.org/10.1016/j.ic.2016.10.006.
View | Files available | DOI | WoS
 
[288]
2017 | Conference Paper | IST-REx-ID: 1011 | OA
Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis. “Faster Algorithms for Weighted Recursive State Machines.” edited by Hongseok Yang, 10201:287–313. Springer, 2017. https://doi.org/10.1007/978-3-662-54434-1_11.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[287]
2017 | Conference Paper | IST-REx-ID: 1009 | OA
Chatterjee, Krishnendu, Petr Novotný, Guillermo Pérez, Jean Raskin, and Djordje Zikelic. “Optimizing Expectation with Guarantees in POMDPs.” In Proceedings of the 31st AAAI Conference on Artificial Intelligence, 5:3725–32. AAAI Press, 2017.
[Submitted Version] View | Download Submitted Version (ext.) | WoS
 
[286]
2017 | Journal Article | IST-REx-ID: 744 | OA
Priklopil, Tadeas, Krishnendu Chatterjee, and Martin Nowak. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.” Journal of Theoretical Biology. Elsevier, 2017. https://doi.org/10.1016/j.jtbi.2017.08.025.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[285]
2017 | Conference Paper | IST-REx-ID: 1194 | OA
Chatterjee, Krishnendu, Petr Novotný, and Djordje Zikelic. “Stochastic Invariants for Probabilistic Termination,” 52:145–60. ACM, 2017. https://doi.org/10.1145/3009837.3009873.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 
[284]
2017 | Research Data | IST-REx-ID: 5559 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak . “Strong Amplifiers of Natural Selection.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:51.
[Published Version] View | Files available | DOI
 
[283]
2017 | Conference Paper | IST-REx-ID: 639 | OA
Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst Case Analysis of Recursive Programs.” edited by Rupak Majumdar and Viktor Kunčak, 10427:41–63. Springer, 2017. https://doi.org/10.1007/978-3-319-63390-9_3.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[282]
2017 | Conference Paper | IST-REx-ID: 949 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “JTDec: A Tool for Tree Decompositions in Soot.” edited by Deepak D’Souza, 10482:59–66. Springer, 2017. https://doi.org/10.1007/978-3-319-68167-2_4.
[Submitted Version] View | Files available | DOI | WoS
 
[281]
2016 | Conference Paper | IST-REx-ID: 1068 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.25.
[Published Version] View | Files available | DOI
 
[280]
2016 | Conference Paper | IST-REx-ID: 1070 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for Synchronization Properties,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.98.
[Published Version] View | Files available | DOI
 
[279]
2016 | Conference Paper | IST-REx-ID: 1090 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Limit-Average Automata of Bounded Width,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.24.
[Published Version] View | Files available | DOI
 
[278]
2016 | Conference Paper | IST-REx-ID: 1138 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Automata under Probabilistic Semantics.” In Proceedings of the 31st Annual ACM/IEEE Symposium, 76–85. IEEE, 2016. https://doi.org/10.1145/2933575.2933588.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[277]
2016 | Conference Paper | IST-REx-ID: 1140 | OA
Chatterjee, Krishnendu, Wolfgang Dvoák, Monika H Henzinger, and Veronika Loitzenbauer. “Model and Objective Separation with Conditional Lower Bounds: Disjunction Is Harder than Conjunction.” In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 197–206. IEEE, 2016. https://doi.org/10.1145/2933575.2935304.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[276]
2016 | Conference Paper | IST-REx-ID: 1182 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016.
[Preprint] View | Files available | Download Preprint (ext.)
 
[275]
2016 | Conference Paper | IST-REx-ID: 1245
Pandey, Vineet, and Krishnendu Chatterjee. “Game-Theoretic Models Identify Useful Principles for Peer Collaboration in Online Learning Platforms.” In Proceedings of the ACM Conference on Computer Supported Cooperative Work, 26:365–68. ACM, 2016. https://doi.org/10.1145/2818052.2869122.
View | DOI
 
[274]
2016 | Conference Paper | IST-REx-ID: 1324
Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, 2016–January:88–96. AAAI Press, 2016.
View | Download None (ext.)
 
[273]
2016 | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, and Petr Novotný. “Stochastic Shortest Path with Energy Constraints in POMDPs.” In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, 1465–66. ACM, 2016.
[Preprint] View | Download Preprint (ext.)
 
[272]
2016 | Conference Paper | IST-REx-ID: 1335 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Monitor Automata,” 9837:23–38. Springer, 2016. https://doi.org/10.1007/978-3-662-53413-7_2.
[Preprint] View | DOI | Download Preprint (ext.)
 
[271]
2016 | Conference Paper | IST-REx-ID: 478 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding Legality of a Single Step of Magic: The Gathering,” 285:1432–39. IOS Press, 2016. https://doi.org/10.3233/978-1-61499-672-9-1432.
[Published Version] View | Files available | DOI
 
[270]
2016 | Conference Paper | IST-REx-ID: 480 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives,” 05-08-July-2016:247–56. IEEE, 2016. https://doi.org/10.1145/2933575.2934513.
[Preprint] View | DOI | Download Preprint (ext.)
 
[269]
2016 | Journal Article | IST-REx-ID: 1477 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.” Journal of Computer and System Sciences. Elsevier, 2016. https://doi.org/10.1016/j.jcss.2016.02.009.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[268]
2016 | Journal Article | IST-REx-ID: 1529 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” Artificial Intelligence. Elsevier, 2016. https://doi.org/10.1016/j.artint.2016.01.007.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[267]
2016 | Technical Report | IST-REx-ID: 5445 | OA
Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. Quantitative Interprocedural Analysis. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-523-v1-1.
[Published Version] View | Files available | DOI
 
[266]
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016:3225–32. AAAI Press, 2016.
View | Files available
 
[265]
2016 | Technical Report | IST-REx-ID: 5449 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Amplification on Undirected Population Structures: Comets Beat Stars. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-648-v1-1.
[Updated Version] View | Files available | DOI
 
[264]
2016 | Technical Report | IST-REx-ID: 5453 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2017-749-v3-1.
[Published Version] View | Files available | DOI
 
[263]
2016 | Technical Report | IST-REx-ID: 5451 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Strong Amplifiers of Natural Selection. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-728-v1-1.
[Published Version] View | Files available | DOI
 
[262]
2016 | Conference Paper | IST-REx-ID: 1071 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ESA.2016.28.
[Published Version] View | Files available | DOI
 
[261]
2016 | Conference Paper | IST-REx-ID: 1438 | OA
Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs,” 20–22:327–42. ACM, 2016. https://doi.org/10.1145/2837614.2837639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[260]
2016 | Technical Report | IST-REx-ID: 5452 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2017-728-v2-1.
[Published Version] View | Files available | DOI
 
[259]
2016 | Conference Paper | IST-REx-ID: 1437 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. https://doi.org/10.1145/2837614.2837624.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[258]
2016 | Conference Paper | IST-REx-ID: 1386 | OA
Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Termination Analysis of Probabilistic Programs through Positivstellensatz’s,” 9779:3–22. Springer, 2016. https://doi.org/10.1007/978-3-319-41528-4_1.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[257]
2015 | Conference Paper | IST-REx-ID: 10796
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under Finite-Memory Strategies for Concurrent Mean-Payoff Games.” In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015:1018–29. SIAM, 2015. https://doi.org/10.1137/1.9781611973730.69.
[Preprint] View | DOI | arXiv
 
[256]
2015 | Journal Article | IST-REx-ID: 1559 | OA
Ibsen-Jensen, Rasmus, Krishnendu Chatterjee, and Martin Nowak. “Computational Complexity of Ecological and Evolutionary Spatial Dynamics.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1511366112.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[255]
2015 | Conference Paper | IST-REx-ID: 1609 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Moshe Vardi. “The Complexity of Synthesis from Probabilistic Components.” In 42nd International Colloquium, 9135:108–20. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47666-6_9.
[Preprint] View | DOI | Download Preprint (ext.)
 
[254]
2015 | Journal Article | IST-REx-ID: 1624 | OA
Pavlogiannis, Andreas, Krishnendu Chatterjee, Ben Adlam, and Martin Nowak. “Cellular Cooperation with Shift Updating and Repulsion.” Scientific Reports. Nature Publishing Group, 2015. https://doi.org/10.1038/srep17147.
[Published Version] View | Files available | DOI
 
[253]
2015 | Journal Article | IST-REx-ID: 1673 | OA
Adlam, Ben, Krishnendu Chatterjee, and Martin Nowak. “Amplifiers of Selection.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2015. https://doi.org/10.1098/rspa.2015.0114.
[Published Version] View | Files available | DOI
 
[252]
2015 | Conference Paper | IST-REx-ID: 1691
Svoreňová, Mária, Martin Chmelik, Kevin Leahy, Hasan Eniser, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Motion Planning Using POMDPs with Parity Objectives: Case Study Paper.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 233–38. ACM, 2015. https://doi.org/10.1145/2728606.2728617.
View | DOI
 
[251]
2015 | Journal Article | IST-REx-ID: 1694
Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Temporal Simulation and Refinement Distances for Timed Systems.” IEEE Transactions on Automatic Control. IEEE, 2015. https://doi.org/10.1109/TAC.2015.2404612.
View | DOI
 
[250]
2015 | Journal Article | IST-REx-ID: 1698 | OA
Velner, Yaron, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, Alexander Rabinovich, and Jean Raskin. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.001.
[Preprint] View | DOI | Download Preprint (ext.)
 
[249]
2015 | Conference Paper | IST-REx-ID: 1820 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , 5:3496–3502. AAAI Press, 2015.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[248]
2015 | Conference Paper | IST-REx-ID: 1838 | OA
Bloem, Roderick, Krishnendu Chatterjee, Swen Jacobs, and Robert Könighofer. “Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information,” 9035:517–32. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_50.
[Preprint] View | DOI | Download Preprint (ext.)
 
[247]
2015 | Conference Paper | IST-REx-ID: 1839 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_12.
[Preprint] View | DOI | Download Preprint (ext.)
 
[246]
2015 | Journal Article | IST-REx-ID: 1873 | OA
Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.” Artificial Intelligence. Elsevier, 2015. https://doi.org/10.1016/j.artint.2014.12.009.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[245]
2015 | Journal Article | IST-REx-ID: 2034 | OA
Bérard, Béatrice, Krishnendu Chatterjee, and Nathalie Sznajder. “Probabilistic Opacity for Markov Decision Processes.” Information Processing Letters. Elsevier, 2015. https://doi.org/10.1016/j.ipl.2014.09.001.
[Preprint] View | DOI | Download Preprint (ext.)
 
[244]
2015 | Journal Article | IST-REx-ID: 1598 | OA
Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.01.050.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[243]
2015 | Journal Article | IST-REx-ID: 1731 | OA
Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.06.003.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[242]
2015 | Journal Article | IST-REx-ID: 1856 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments.” Journal of the ACM. ACM, 2015. https://doi.org/10.1145/2699430.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[241]
2015 | Conference Paper | IST-REx-ID: 1661 | OA
Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015. https://doi.org/10.1109/LICS.2015.34.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[240]
2015 | Journal Article | IST-REx-ID: 523 | OA
Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.010.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[239]
2015 | Journal Article | IST-REx-ID: 524 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.009.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[238]
2015 | Conference Paper | IST-REx-ID: 1481 | OA
Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2:745–52. AAAI Press, 2015.
View | Files available | Download None (ext.)
 
[237]
2015 | Conference Paper | IST-REx-ID: 1732 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications,” 325–30. IEEE, 2015. https://doi.org/10.1109/ICRA.2015.7139019.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[236]
2015 | Technical Report | IST-REx-ID: 5431 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-322-v1-1.
[Published Version] View | Files available | DOI
 
[235]
2015 | Conference Paper | IST-REx-ID: 1657
Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” LICS. IEEE, 2015. https://doi.org/10.1109/LICS.2015.32.
View | Files available | DOI
 
[234]
2015 | Conference Paper | IST-REx-ID: 1656
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015. https://doi.org/10.1109/LICS.2015.72.
View | Files available | DOI | arXiv
 
[233]
2015 | Technical Report | IST-REx-ID: 5429 | OA
Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v1-1.
[Published Version] View | Files available | DOI
 
[232]
2015 | Technical Report | IST-REx-ID: 5435 | OA
Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v2-1.
[Published Version] View | Files available | DOI
 
[231]
2015 | Technical Report | IST-REx-ID: 5436 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-170-v2-2.
[Published Version] View | Files available | DOI
 
[230]
2015 | Conference Paper | IST-REx-ID: 1610 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” In 42nd International Colloquium, 9135:121–33. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47666-6_10.
View | Files available | DOI | Download None (ext.) | arXiv
 
[229]
2015 | Technical Report | IST-REx-ID: 5437 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-330-v2-1.
[Published Version] View | Files available | DOI
 
[228]
2015 | Technical Report | IST-REx-ID: 5430 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-319-v1-1.
[Published Version] View | Files available | DOI
 
[227]
2015 | Technical Report | IST-REx-ID: 5438 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. Edit Distance for Pushdown Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1.
[Published Version] View | Files available | DOI
 
[226]
2015 | Technical Report | IST-REx-ID: 5440 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v2-2.
[Published Version] View | Files available | DOI
 
[225]
2015 | Technical Report | IST-REx-ID: 5432 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v1-1.
[Published Version] View | Files available | DOI
 
[224]
2015 | Technical Report | IST-REx-ID: 5444 | OA
Reiter, Johannes, Alvin Makohon-Moore, Jeffrey Gerold, Ivana Bozic, Krishnendu Chatterjee, Christine Iacobuzio-Donahue, Bert Vogelstein, and Martin Nowak. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-399-v1-1.
[Published Version] View | Files available | DOI
 
[223]
2015 | Technical Report | IST-REx-ID: 5443 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-325-v2-1.
[Published Version] View | Files available | DOI
 
[222]
2015 | Journal Article | IST-REx-ID: 1709 | OA
Reiter, Johannes, Ayush Kanodia, Raghav Gupta, Martin Nowak, and Krishnendu Chatterjee. “Biological Auctions with Multiple Rewards.” Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society, 2015. https://doi.org/10.1098/rspb.2015.1041.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[221]
2015 | Journal Article | IST-REx-ID: 1501 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.” Formal Methods in System Design. Springer, 2015. https://doi.org/10.1007/s10703-015-0235-2.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[220]
2015 | Journal Article | IST-REx-ID: 1602 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, and Prateesh Goyal. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.” ACM SIGPLAN Notices. ACM, 2015. https://doi.org/10.1145/2676726.2676979.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[219]
2015 | Journal Article | IST-REx-ID: 1604
Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. “Quantitative Interprocedural Analysis.” Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . ACM, 2015. https://doi.org/10.1145/2676726.2676968.
View | Files available | DOI
 
[218]
2015 | Conference Paper | IST-REx-ID: 1607 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs,” 9206:140–57. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_9.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[217]
2015 | Conference Paper | IST-REx-ID: 1714
Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks.” In Real-Time Systems Symposium, 2015:118–27. IEEE, 2015. https://doi.org/10.1109/RTSS.2014.9.
View | Files available | DOI
 
[216]
2015 | Technical Report | IST-REx-ID: 5441 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-340-v1-1.
[Published Version] View | Files available | DOI
 
[215]
2015 | Conference Paper | IST-REx-ID: 1689 | OA
Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 259–68. ACM, 2015. https://doi.org/10.1145/2728606.2728608.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[214]
2015 | Journal Article | IST-REx-ID: 1681 | OA
Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” Games. MDPI, 2015. https://doi.org/10.3390/g6040413.
[Published Version] View | Files available | DOI
 
[213]
2015 | Conference Paper | IST-REx-ID: 1603 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in Markov Decision Processes,” 9206:158–77. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_10.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[212]
2014 | Journal Article | IST-REx-ID: 1375 | OA
Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.” Theoretical Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.06.031.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[211]
2014 | Conference Paper | IST-REx-ID: 1853
Jha, Susmit, Stavros Tripakis, Sanjit Seshia, and Krishnendu Chatterjee. “Game Theoretic Secure Localization in Wireless Sensor Networks,” 85–90. IEEE, 2014. https://doi.org/10.1109/IOT.2014.7030120.
View | DOI
 
[210]
2014 | Conference Paper | IST-REx-ID: 2027 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Vojtěch Forejt, Jan Kretinsky, Marta Kwiatkowska, David Parker, and Mateusz Ujma. “Verification of Markov Decision Processes Using Learning Algorithms.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, 8837:98–114. Society of Industrial and Applied Mathematics, 2014. https://doi.org/10.1007/978-3-319-11936-6_8.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[209]
2014 | Journal Article | IST-REx-ID: 2187 | OA
Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer. “Synthesizing Robust Systems.” Acta Informatica. Springer, 2014. https://doi.org/10.1007/s00236-013-0191-5.
[Submitted Version] View | Files available | DOI
 
[208]
2014 | Journal Article | IST-REx-ID: 2234 | OA
Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Markov Decision Processes with Multiple Long-Run Average Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2014. https://doi.org/10.2168/LMCS-10(1:13)2014.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[207]
2014 | Journal Article | IST-REx-ID: 2716 | OA
Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” Acta Informatica. Springer, 2014. https://doi.org/10.1007/s00236-013-0182-6.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[206]
2014 | Journal Article | IST-REx-ID: 2141 | OA
Chatterjee, Krishnendu, and Monika H Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal of the ACM. ACM, 2014. https://doi.org/10.1145/2597631.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[205]
2014 | Conference Paper | IST-REx-ID: 2054
Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_37.
View | Files available | DOI
 
[204]
2014 | Conference Paper | IST-REx-ID: 1903
Chatterjee, Krishnendu. “Partial-Observation Stochastic Reachability and Parity Games,” 8634:1–4. Springer, 2014. https://doi.org/10.1007/978-3-662-44522-8_1.
View | Files available | DOI
 
[203]
2014 | Journal Article | IST-REx-ID: 2211 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2579821.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[202]
2014 | Journal Article | IST-REx-ID: 2038 | OA
Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” ACM Transactions on Computational Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2629686.
[Submitted Version] View | Files available | DOI
 
[201]
2014 | Conference Paper | IST-REx-ID: 2162 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,” 8573:122–33. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_11.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[200]
2014 | Conference Paper | IST-REx-ID: 2213 | OA
Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. “The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies,” 8412:242–57. Springer, 2014. https://doi.org/10.1007/978-3-642-54830-7_16.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[199]
2014 | Conference Paper | IST-REx-ID: 2212
Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. “Perfect-Information Stochastic Mean-Payoff Parity Games,” 8412:210–25. Springer, 2014. https://doi.org/10.1007/978-3-642-54830-7_14.
View | Files available | DOI
 
[198]
2014 | Conference Paper | IST-REx-ID: 2216 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit Distance for Timed Automata,” 303–12. Springer, 2014. https://doi.org/10.1145/2562059.2562141.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[197]
2014 | Technical Report | IST-REx-ID: 5413 | OA
Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v2-2.
[Published Version] View | Files available | DOI
 
[196]
2014 | Technical Report | IST-REx-ID: 5414 | OA
Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v3-1.
[Published Version] View | Files available | DOI
 
[195]
2014 | Technical Report | IST-REx-ID: 5412 | OA
Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v1-1.
[Published Version] View | Files available | DOI
 
[194]
2014 | Conference Paper | IST-REx-ID: 2163 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” In Lecture Notes in Computer Science, 8573:110–21. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_10.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[193]
2014 | Technical Report | IST-REx-ID: 5419 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-187-v1-1.
[Published Version] View | Files available | DOI
 
[192]
2014 | Technical Report | IST-REx-ID: 5418 | OA
Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-176-v1-1.
[Published Version] View | Files available | DOI
 
[191]
2014 | Technical Report | IST-REx-ID: 5420 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-191-v1-1.
[Published Version] View | Files available | DOI
 
[190]
2014 | Technical Report | IST-REx-ID: 5424 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v1-1.
[Published Version] View | Files available | DOI
 
[189]
2014 | Technical Report | IST-REx-ID: 5426 | OA
Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v2-1.
[Published Version] View | Files available | DOI
 
[188]
2014 | Technical Report | IST-REx-ID: 5423 | OA
Chatterjee, Krishnendu, Alexander Kössler, Andreas Pavlogiannis, and Ulrich Schmid. A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-300-v1-1.
[Published Version] View | Files available | DOI
 
[187]
2014 | Technical Report | IST-REx-ID: 5427 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-314-v1-1.
[Published Version] View | Files available | DOI
 
[186]
2014 | Technical Report | IST-REx-ID: 5415 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-170-v1-1.
[Published Version] View | Files available | DOI
 
[185]
2014 | Technical Report | IST-REx-ID: 5421 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolution on Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-190-v2-2.
[Published Version] View | Files available | DOI
 
[184]
2014 | Conference Paper | IST-REx-ID: 10885
Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.” In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, 8318:78–97. Springer Nature, 2014. https://doi.org/10.1007/978-3-642-54013-4_5.
[Preprint] View | Files available | DOI | arXiv
 
[183]
2014 | Journal Article | IST-REx-ID: 2039 | OA
Chatterjee, Krishnendu, Andreas Pavlogiannis, Ben Adlam, and Martin Nowak. “The Time Scale of Evolutionary Innovation.” PLoS Computational Biology. Public Library of Science, 2014. https://doi.org/10.1371/journal.pcbi.1003818.
[Published Version] View | Files available | DOI
 
[182]
2014 | Research Data Reference | IST-REx-ID: 9739
Chatterjee, Krishnendu, Andreas Pavlogiannis, Ben Adlam, and Martin Novak. “Detailed Proofs for ‘The Time Scale of Evolutionary Innovation.’” Public Library of Science, 2014. https://doi.org/10.1371/journal.pcbi.1003818.s001.
[Published Version] View | Files available | DOI
 
[181]
2014 | Journal Article | IST-REx-ID: 535 | OA
Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” Algorithmica. Springer, 2014. https://doi.org/10.1007/s00453-013-9843-7.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[180]
2014 | Conference Paper | IST-REx-ID: 2063
Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,” 8559:473–90. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_31.
View | Files available | DOI
 
[179]
2014 | Technical Report | IST-REx-ID: 5428 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. Quantitative Fair Simulation Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-315-v1-1.
[Published Version] View | Files available | DOI
 
[178]
2013 | Conference Paper | IST-REx-ID: 1374 | OA
Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” In 22nd EACSL Annual Conference on Computer Science Logic, 23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.181.
[Published Version] View | Files available | DOI
 
[177]
2013 | Conference Paper | IST-REx-ID: 2238
Chatterjee, Krishnendu, Vojtěch Forejt, and Dominik Wojtczak. “Multi-Objective Discounted Reward Verification in Graphs and MDPs.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_17.
View | DOI
 
[176]
2013 | Conference (Editor) | IST-REx-ID: 2292
Chatterjee, Krishnendu, and Jiri Sgall, eds. Mathematical Foundations of Computer Science 2013. Vol. 8087. Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40313-2.
View | DOI
 
[175]
2013 | Journal Article | IST-REx-ID: 2299 | OA
Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer. Springer, 2013. https://doi.org/10.1007/s10009-011-0207-9.
[Submitted Version] View | Files available | DOI
 
[174]
2013 | Conference Paper | IST-REx-ID: 2446 | OA
Chatterjee, Krishnendu, Andreas Gaiser, and Jan Kretinsky. “Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_37.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[173]
2013 | Conference Paper | IST-REx-ID: 2444 | OA
Chatterjee, Krishnendu, and Jakub Ła̧Cki. “Faster Algorithms for Markov Decision Processes with Low Treewidth.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_36.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[172]
2013 | Journal Article | IST-REx-ID: 2814 | OA
Chatterjee, Krishnendu, Luca Alfaro, and Ritankar Majumdar. “The Complexity of Coverage.” International Journal of Foundations of Computer Science. World Scientific Publishing, 2013. https://doi.org/10.1142/S0129054113400066.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[171]
2013 | Journal Article | IST-REx-ID: 2817 | OA
Novak, Sebastian, Krishnendu Chatterjee, and Martin Nowak. “Density Games.” Journal of Theoretical Biology. Elsevier, 2013. https://doi.org/10.1016/j.jtbi.2013.05.029.
[Published Version] View | Files available | DOI
 
[170]
2013 | Conference Paper | IST-REx-ID: 2819 | OA
Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Timed Simulation Functions and Refinement Metrics for Real-Time Systems.” In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, 1:273–82. Springer, 2013. https://doi.org/10.1145/2461328.2461370.
[Preprint] View | DOI | Download Preprint (ext.)
 
[169]
2013 | Journal Article | IST-REx-ID: 2824
Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory-Efficient, Clock-Memory Free, and Non-Zeno Safety Controllers for Timed Systems.” Information and Computation. Elsevier, 2013. https://doi.org/10.1016/j.ic.2013.04.003.
View | DOI
 
[168]
2013 | Journal Article | IST-REx-ID: 2836 | OA
Chatterjee, Krishnendu, and Vishwanath Raman. “Assume-Guarantee Synthesis for Digital Contract Signing.” Formal Aspects of Computing. Springer, 2013. https://doi.org/10.1007/s00165-013-0283-6.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[167]
2013 | Journal Article | IST-REx-ID: 2854 | OA
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Strategy Improvement for Concurrent Reachability and Turn Based Stochastic Safety Games.” Journal of Computer and System Sciences. Elsevier, 2013. https://doi.org/10.1016/j.jcss.2012.12.001.
[Published Version] View | Files available | DOI
 
[166]
2013 | Journal Article | IST-REx-ID: 3116
Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, Ritankar Majumdar, and Vishwanath Raman. “Code Aware Resource Management.” Formal Methods in System Design. Springer, 2013. https://doi.org/10.1007/s10703-012-0170-4.
View | DOI
 
[165]
2013 | Journal Article | IST-REx-ID: 2831 | OA
Chatterjee, Krishnendu, Monika H Henzinger, Manas Joglekar, and Nisarg Shah. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.” Formal Methods in System Design. Springer, 2013. https://doi.org/10.1007/s10703-012-0180-2.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[164]
2013 | Conference Paper | IST-REx-ID: 2279 | OA
Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-319-02444-8_10.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[163]
2013 | Technical Report | IST-REx-ID: 5399 | OA
Reiter, Johannes, Ivana Bozic, Krishnendu Chatterjee, and Martin Nowak. TTP: Tool for Tumor Progression. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-104-v1-1.
[Published Version] View | Files available | DOI
 
[162]
2013 | Conference Paper | IST-REx-ID: 2295 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.165.
[Published Version] View | Files available | DOI
 
[161]
2013 | Technical Report | IST-REx-ID: 5403 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. Qualitative Analysis of Concurrent Mean-Payoff Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-126-v1-1.
[Published Version] View | Files available | DOI
 
[160]
2013 | Technical Report | IST-REx-ID: 5400 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-109-v1-1.
[Published Version] View | Files available | DOI
 
[159]
2013 | Technical Report | IST-REx-ID: 5404 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-127-v1-1.
[Published Version] View | Files available | DOI
 
[158]
2013 | Technical Report | IST-REx-ID: 5405 | OA
Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. Perfect-Information Stochastic Mean-Payoff Parity Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-128-v1-1.
[Published Version] View | Files available | DOI
 
[157]
2013 | Technical Report | IST-REx-ID: 5409 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Rupak Majumdar. Edit Distance for Timed Automata. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-144-v1-1.
[Published Version] View | Files available | DOI
 
[156]
2013 | Conference Paper | IST-REx-ID: 1376
Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. “Distributed Synthesis for LTL Fragments.” In 13th International Conference on Formal Methods in Computer-Aided Design, 18–25. IEEE, 2013. https://doi.org/10.1109/FMCAD.2013.6679386.
View | Files available | DOI
 
[155]
2013 | Technical Report | IST-REx-ID: 5406 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. Distributed Synthesis for LTL Fragments. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-130-v1-1.
[Published Version] View | Files available | DOI
 
[154]
2013 | Technical Report | IST-REx-ID: 5408 | OA
Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-141-v1-1.
[Published Version] View | Files available | DOI
 
[153]
2013 | Technical Report | IST-REx-ID: 5410 | OA
Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. Automatic Generation of Alternative Starting Positions for Traditional Board Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-146-v1-1.
[Published Version] View | Files available | DOI
 
[152]
2013 | Conference Paper | IST-REx-ID: 2329 | OA
Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40184-8_35.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[151]
2013 | Research Data Reference | IST-REx-ID: 9749
Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” Public Library of Science, 2013. https://doi.org/10.1371/journal.pone.0080814.s001.
[Published Version] View | Files available | DOI
 
[150]
2013 | Conference Paper | IST-REx-ID: 10902
Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel between Languages.” In 7th International Conference on Language and Automata Theory and Applications, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature, 2013. https://doi.org/10.1007/978-3-642-37064-9_20.
View | DOI
 
[149]
2013 | Journal Article | IST-REx-ID: 2247 | OA
Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” PLoS One. Public Library of Science, 2013. https://doi.org/10.1371/journal.pone.0080814.
[Published Version] View | Files available | DOI
 
[148]
2013 | Journal Article | IST-REx-ID: 2858 | OA
Reiter, Johannes, Ivana Božić, Benjamin Allen, Krishnendu Chatterjee, and Martin Nowak. “The Effect of One Additional Driver Mutation on Tumor Progression.” Evolutionary Applications. Wiley-Blackwell, 2013. https://doi.org/10.1111/eva.12020.
[Published Version] View | Files available | DOI
 
[147]
2013 | Journal Article | IST-REx-ID: 2816 | OA
Božić, Ivana, Johannes Reiter, Benjamin Allen, Tibor Antal, Krishnendu Chatterjee, Preya Shah, Yo Moon, et al. “Evolutionary Dynamics of Cancer in Response to Targeted Combination Therapy.” ELife. eLife Sciences Publications, 2013. https://doi.org/10.7554/eLife.00747.
[Published Version] View | Files available | DOI
 
[146]
2013 | Conference Paper | IST-REx-ID: 2000 | OA
Reiter, Johannes, Ivana Božić, Krishnendu Chatterjee, and Martin Nowak. “TTP: Tool for Tumor Progression.” In Proceedings of 25th Int. Conf. on Computer Aided Verification, 8044:101–6. Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_6.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[145]
2013 | Conference Paper | IST-REx-ID: 2305 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Trading Performance for Stability in Markov Decision Processes.” In 28th Annual ACM/IEEE Symposium, 331–40. IEEE, 2013. https://doi.org/10.1109/LICS.2013.39.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[144]
2013 | Conference Paper | IST-REx-ID: 2820
Chatterjee, Krishnendu, Alexander Kößler, and Ulrich Schmid. “Automated Analysis of Real-Time Scheduling Using Graph Games.” In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, 163–72. ACM, 2013. https://doi.org/10.1145/2461328.2461356.
View | Files available | DOI
 
[143]
2012 | Conference Paper | IST-REx-ID: 2715 | OA
Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives,” 18:461–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461.
[Published Version] View | Files available | DOI
 
[142]
2012 | Conference Paper | IST-REx-ID: 10904
Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” In CONCUR 2012 - Concurrency Theory, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31. Berlin, Heidelberg: Springer, 2012. https://doi.org/10.1007/978-3-642-32940-1_10.
[Preprint] View | Files available | DOI | arXiv
 
[141]
2012 | Journal Article | IST-REx-ID: 2848 | OA
Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary Game Dynamics in Populations with Different Learners.” Journal of Theoretical Biology. Elsevier, 2012. https://doi.org/10.1016/j.jtbi.2012.02.021.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[140]
2012 | Conference Paper | IST-REx-ID: 2936 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In Roceedings of the Tenth ACM International Conference on Embedded Software, 43–52. ACM, 2012. https://doi.org/10.1145/2380356.2380370.
[Preprint] View | DOI | Download Preprint (ext.)
 
[139]
2012 | Conference Paper | IST-REx-ID: 2947 | OA
Chatterjee, Krishnendu, Martin Chmelik, and Ritankar Majumdar. “Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games,” 7561:385–99. Springer, 2012. https://doi.org/10.1007/978-3-642-33386-6_30.
[Preprint] View | DOI | Download Preprint (ext.)
 
[138]
2012 | Conference Paper | IST-REx-ID: 3135 | OA
Brázdil, Brázdil, Krishnendu Chatterjee, Antonín Kučera, and Petr Novotný. “Efficient Controller Synthesis for Consumption Games with Multiple Resource Types,” 7358:23–38. Springer, 2012. https://doi.org/10.1007/978-3-642-31424-7_8.
[Preprint] View | DOI | Download Preprint (ext.)
 
[137]
2012 | Conference Paper | IST-REx-ID: 3252 | OA
Chatterjee, Krishnendu, and Vishwanath Raman. “Synthesizing Protocols for Digital Contract Signing,” 7148:152–68. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_11.
[Preprint] View | DOI | Download Preprint (ext.)
 
[136]
2012 | Conference Paper | IST-REx-ID: 3255 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives,” 7119:37–46. Springer, 2012. https://doi.org/10.1007/978-3-642-25929-6_3.
[Submitted Version] View | Files available | DOI
 
[135]
2012 | Journal Article | IST-REx-ID: 3254
Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” Information and Computation. Elsevier, 2012. https://doi.org/10.1016/j.ic.2011.11.004.
View | DOI | Download None (ext.)
 
[134]
2012 | Journal Article | IST-REx-ID: 3314
Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” International Journal of Foundations of Computer Science. World Scientific Publishing, 2012. https://doi.org/10.1142/S0129054112400308.
View | DOI
 
[133]
2012 | Journal Article | IST-REx-ID: 3846 | OA
Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic ω Regular Games.” Journal of Computer and System Sciences. Elsevier, 2012. https://doi.org/10.1016/j.jcss.2011.05.002.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[132]
2012 | Journal Article | IST-REx-ID: 3128 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Partial-Observation Stochastic Parity Games.” Formal Methods in System Design. Springer, 2012. https://doi.org/10.1007/s10703-012-0164-2.
[Submitted Version] View | Files available | DOI
 
[131]
2012 | Journal Article | IST-REx-ID: 2972 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” Theoretical Computer Science. Elsevier, 2012. https://doi.org/10.1016/j.tcs.2012.07.038.
[Published Version] View | Files available | DOI | arXiv
 
[130]
2012 | Conference Paper | IST-REx-ID: 497 | OA
Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms for Alternating Refinement Relations,” 16:167–82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.CSL.2012.167.
[Published Version] View | Files available | DOI
 
[129]
2012 | Conference Paper | IST-REx-ID: 3165 | OA
Chatterjee, Krishnendu, and Monika H Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 1386–99. SIAM, 2012. https://doi.org/10.1137/1.9781611973099.109.
View | Files available | DOI | Download None (ext.) | arXiv
 
[128]
2012 | Conference Paper | IST-REx-ID: 2956
Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.30.
View | Files available | DOI
 
[127]
2012 | Technical Report | IST-REx-ID: 5377 | OA
Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games. IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0002.
[Published Version] View | Files available | DOI
 
[126]
2012 | Technical Report | IST-REx-ID: 5378 | OA
Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. Faster Algorithms for Alternating Refinement Relations. IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0001.
[Published Version] View | Files available | DOI
 
[125]
2012 | Conference Paper | IST-REx-ID: 2955 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.28.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[124]
2012 | Conference Paper | IST-REx-ID: 3341 | OA
Chatterjee, Krishnendu. “Robustness of Structurally Equivalent Concurrent Parity Games,” 7213:270–85. Springer, 2012. https://doi.org/10.1007/978-3-642-28729-9_18.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[123]
2012 | Conference Paper | IST-REx-ID: 2957 | OA
Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.29.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[122]
2012 | Conference Paper | IST-REx-ID: 10905 | OA
Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” In Algorithms – ESA 2012, 7501:301–12. Springer, 2012. https://doi.org/10.1007/978-3-642-33090-2_27.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[121]
2012 | Journal Article | IST-REx-ID: 3260 | OA
Chatterjee, Krishnendu, Johannes Reiter, and Martin Nowak. “Evolutionary Dynamics of Biological Auctions.” Theoretical Population Biology. Academic Press, 2012. https://doi.org/10.1016/j.tpb.2011.11.003.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[120]
2011 | Conference Paper | IST-REx-ID: 3316 | OA
Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.” In 6th IEEE International Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011. https://doi.org/10.1109/SIES.2011.5953660.
[Published Version] View | DOI | Download Published Version (ext.)
 
[119]
2011 | Conference Paper | IST-REx-ID: 3350
Chatterjee, Krishnendu, and Ritankar Majumdar. “Minimum Attention Controller Synthesis for Omega Regular Objectives.” edited by Uli Fahrenberg and Stavros Tripakis, 6919:145–59. Springer, 2011. https://doi.org/10.1007/978-3-642-24310-3_11.
View | DOI
 
[118]
2011 | Conference Paper | IST-REx-ID: 3351 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless Quantitative Objectives.” edited by Olaf Owe, Martin Steffen, and Jan Arne Telle, 6914:148–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22953-4_13.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[117]
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL). ACM, 2011. https://doi.org/10.1145/1970398.1970404.
View | Files available | DOI
 
[116]
2011 | Conference Paper | IST-REx-ID: 3349 | OA
Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity Games to Simple Stochastic Games,” 54:74–86. EPTCS, 2011. https://doi.org/10.4204/EPTCS.54.6.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[115]
2011 | Conference Paper | IST-REx-ID: 3365 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,” 6605:267–71. Springer, 2011. https://doi.org/10.1007/978-3-642-19835-9_24.
[Submitted Version] View | Files available | DOI
 
[114]
2011 | Preprint | IST-REx-ID: 3363 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[113]
2011 | Journal Article | IST-REx-ID: 3315 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.” Logical Methods in Computer Science. International Federation of Computational Logic, 2011. https://doi.org/10.2168/LMCS-7(4:8)2011.
[Published Version] View | Files available | DOI
 
[112]
2011 | Preprint | IST-REx-ID: 3339 | OA
Chatterjee, Krishnendu, Luca De Alfaro, and Roy Pritam. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv. ArXiv, 2011.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[111]
2011 | Conference Paper | IST-REx-ID: 3342 | OA
Chatterjee, Krishnendu, Monika H Henzinger, Manas Joglekar, and Shah Nisarg. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:260–76. Springer, 2011. https://doi.org/10.1007/978-3-642-22110-1_21.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[110]
2011 | Conference Paper | IST-REx-ID: 3347 | OA
Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,” 6638:216–26. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_16.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[109]
2011 | Conference Paper | IST-REx-ID: 3346 | OA
Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.10.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[108]
2011 | Conference Paper | IST-REx-ID: 3348 | OA
Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient Real Time Controllers for Safety Objectives,” 221–30. Springer, 2011. https://doi.org/10.1145/1967701.1967734.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[107]
2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” edited by Giorgo Delzanno and Igor Potapov, 6945:1–1. Springer, 2011. https://doi.org/10.1007/978-3-642-24288-5_1.
View | DOI
 
[106]
2011 | Conference Paper | IST-REx-ID: 3343 | OA
Chatterjee, Krishnendu, and Monika H Henzinger. “Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification,” 1318–36. SIAM, 2011. https://doi.org/10.1137/1.9781611973082.101.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[105]
2011 | Conference Paper | IST-REx-ID: 3361 | OA
Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,” 205–17. IEEE, 2011. https://doi.org/10.1109/CSF.2011.21.
[Submitted Version] View | Files available | DOI
 
[104]
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.” edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_17.
View | DOI
 
[103]
2011 | Technical Report | IST-REx-ID: 5379 | OA
Chatterjee, Krishnendu, and Monika H Henzinger. An O(N2) Time Algorithm for Alternating Büchi Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0009.
[Published Version] View | Files available | DOI
 
[102]
2011 | Technical Report | IST-REx-ID: 5381 | OA
Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic Games: How to Win When Belief Fails. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0007.
[Published Version] View | Files available | DOI
 
[101]
2011 | Technical Report | IST-REx-ID: 5380 | OA
Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0008.
[Published Version] View | Files available | DOI
 
[100]
2011 | Technical Report | IST-REx-ID: 5382 | OA
Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0006.
[Published Version] View | Files available | DOI
 
[99]
2011 | Preprint | IST-REx-ID: 3338 | OA
Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv. ArXiv, 2011.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[98]
2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.33.
[Submitted Version] View | Files available | DOI
 
[97]
2011 | Technical Report | IST-REx-ID: 5385 | OA
Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0003.
[Published Version] View | Files available | DOI
 
[96]
2011 | Technical Report | IST-REx-ID: 5384 | OA
Chatterjee, Krishnendu, and Mathieu Tracol. Decidable Problems for Probabilistic Automata on Infinite Words. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0004.
[Published Version] View | Files available | DOI
 
[95]
2011 | Conference Paper | IST-REx-ID: 3366 | OA
Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22110-1_20.
[Submitted Version] View | Files available | DOI
 
[94]
2011 | Conference Paper | IST-REx-ID: 3345 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity Markov Decision Processes,” 6907:206–18. Springer, 2011. https://doi.org/10.1007/978-3-642-22993-0_21.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[93]
2011 | Technical Report | IST-REx-ID: 5387 | OA
Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0001.
[Published Version] View | Files available | DOI
 
[92]
2010 | Conference Paper | IST-REx-ID: 3858 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “The Complexity of Partial-Observation Parity Games,” 6397:1–14. Springer, 2010. https://doi.org/10.1007/978-3-642-16242-8_1.
[Submitted Version] View | Files available | DOI
 
[91]
2010 | Conference Paper | IST-REx-ID: 3856 | OA
Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free,” 6281:246–57. Springer, 2010. https://doi.org/10.1007/978-3-642-15155-2_23.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[90]
2010 | Conference (Editor) | IST-REx-ID: 3859
Chatterjee, Krishnendu, and Thomas A Henzinger, eds. Formal Modeling and Analysis of Timed Systems. Vol. 6246. Springer, 2010. https://doi.org/10.1007/978-3-642-15297-9.
View | Files available | DOI
 
[89]
2010 | Conference Paper | IST-REx-ID: 3866 | OA
Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.” edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_36.
[Submitted Version] View | Files available | DOI
 
[88]
2010 | Journal Article | IST-REx-ID: 3868 | OA
Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath Raman. “Algorithms for Game Metrics.” Logical Methods in Computer Science. International Federation of Computational Logic, 2010. https://doi.org/10.2168/LMCS-6(3:13)2010.
[Published Version] View | Files available | DOI
 
[87]
2010 | Conference Paper | IST-REx-ID: 3853 | OA
Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,” 6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.1007/978-3-642-15375-4_19.
[Submitted Version] View | Files available | DOI
 
[86]
2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee, Krishnendu, Florian Horn, and Christof Löding. “Obliging Games,” 6269:284–96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.1007/978-3-642-15375-4_20.
View | DOI
 
[85]
2010 | Conference Paper | IST-REx-ID: 3851 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games,” 6199:599–610. Springer, 2010. https://doi.org/10.1007/978-3-642-14162-1_50.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[84]
2010 | Conference Paper | IST-REx-ID: 3860 | OA
Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Generalized Mean-Payoff and Energy Games,” 8:505–16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505.
[Submitted Version] View | Files available | DOI
 
[83]
2010 | Journal Article | IST-REx-ID: 3862 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Quantitative Languages.” ACM Transactions on Computational Logic (TOCL). ACM, 2010. https://doi.org/10.1145/1805950.1805953.
[Submitted Version] View | Files available | DOI
 
[82]
2010 | Conference Paper | IST-REx-ID: 3864 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,” 6174:380–95. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_34.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[81]
2010 | Conference Paper | IST-REx-ID: 3865
Chatterjee, Krishnendu, Luca De Alfaro, Vishwanath Raman, and César Sánchez. “Analyzing the Impact of Change in Multi-Threaded Programs.” edited by David Rosenblum and Gabriele Taenzer, 6013:293–307. Springer, 2010. https://doi.org/10.1007/978-3-642-12029-9_21.
View | DOI
 
[80]
2010 | Journal Article | IST-REx-ID: 3863 | OA
Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect Information.” Information and Computation. Elsevier, 2010. https://doi.org/10.1016/j.ic.2009.09.006.
[Submitted Version] View | Files available | DOI
 
[79]
2010 | Journal Article | IST-REx-ID: 3861 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic.” Information and Computation. Elsevier, 2010. https://doi.org/10.1016/j.ic.2009.07.004.
[Submitted Version] View | Files available | DOI
 
[78]
2010 | Journal Article | IST-REx-ID: 3867 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.” Logical Methods in Computer Science. International Federation of Computational Logic, 2010. https://doi.org/10.2168/LMCS-6(3:10)2010.
[Published Version] View | Files available | DOI
 
[77]
2010 | Technical Report | IST-REx-ID: 5388 | OA
Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0004.
[Published Version] View | Files available | DOI
 
[76]
2010 | Conference Paper | IST-REx-ID: 4388 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,” 6174:665–69. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_57.
[Submitted Version] View | Files available | DOI | arXiv
 
[75]
2010 | Technical Report | IST-REx-ID: 5390 | OA
Chatterjee, Krishnendu, and Nathanaël Fijalkow. Topological, Automata-Theoretic and Logical Characterization of Finitary Languages. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0002.
[Published Version] View | Files available | DOI
 
[74]
2010 | Conference Paper | IST-REx-ID: 3857
Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Automata on Infinite Words: Decidability and Undecidability Results,” 6252:1–16. Springer, 2010. https://doi.org/10.1007/978-3-642-15643-4_1.
View | Files available | DOI
 
[73]
2010 | Conference Paper | IST-REx-ID: 3855 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Qualitative Analysis of Partially-Observable Markov Decision Processes,” 6281:258–69. Springer, 2010. https://doi.org/10.1007/978-3-642-15155-2_24.
[Submitted Version] View | Files available | DOI
 
[72]
2010 | Conference Paper | IST-REx-ID: 3852 | OA
Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting in Games across Time Scales,” 25:22–29. EPTCS, 2010. https://doi.org/10.4204/EPTCS.25.6.
[Published Version] View | Files available | DOI | arXiv
 
[71]
2009 | Conference Paper | IST-REx-ID: 3503 | OA
Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Systems with Limsup and Liminf Objectives,” 5489:32–45. Springer, 2009. https://doi.org/10.1007/978-3-642-03092-5_4.
View | DOI | Download (ext.)
 
[70]
2009 | Conference Paper | IST-REx-ID: 3871 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Probabilistic Weighted Automata,” 5710:244–58. Springer, 2009. https://doi.org/10.1007/978-3-642-04081-8_17.
[Submitted Version] View | Files available | DOI
 
[69]
2009 | Journal Article | IST-REx-ID: 3870 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Finitary Winning in Omega-Regular Games.” ACM Transactions on Computational Logic (TOCL). ACM, 2009. https://doi.org/10.1145/1614431.1614432.
[Submitted Version] View | Files available | DOI
 
[68]
2009 | Journal Article | IST-REx-ID: 3869
Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, and Axel Legay. “Qualitative Logics and Equivalences for Probabilistic Systems.” Logical Methods in Computer Science. International Federation of Computational Logic, 2009. https://doi.org/10.2168/LMCS-5(2:7)2009.
View | DOI
 
[67]
2009 | Conference Paper | IST-REx-ID: 4542 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Alternating Weighted Automata,” 5699:3–13. Springer, 2009. https://doi.org/10.1007/978-3-642-03409-1_2.
[Submitted Version] View | Files available | DOI
 
[66]
2009 | Conference Paper | IST-REx-ID: 4545 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Stochastic Games with Limsup and Liminf Objectives,” 5556:1–15. Springer, 2009. https://doi.org/10.1007/978-3-642-02930-1_1.
[Submitted Version] View | Files available | DOI
 
[65]
2009 | Conference Paper | IST-REx-ID: 4543
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Stochastic Games with Finitary Objectives,” 5734:34–54. Springer, 2009. https://doi.org/10.1007/978-3-642-03816-7_4.
View | DOI
 
[64]
2009 | Conference Paper | IST-REx-ID: 4544 | OA
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Termination Criteria for Solving Concurrent Safety and Reachability Games,” 197–206. SIAM, 2009. https://doi.org/10.1137/1.9781611973068.23.
View | Files available | DOI | Download (ext.)
 
[63]
2009 | Conference Paper | IST-REx-ID: 4540
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages,” 199–208. IEEE, 2009. https://doi.org/10.1109/LICS.2009.16.
View | Files available | DOI
 
[62]
2009 | Conference Paper | IST-REx-ID: 4569 | OA
Bloem, Roderick, Krishnendu Chatterjee, Thomas A Henzinger, and Barbara Jobstmann. “Better Quality in Synthesis through Quantitative Objectives,” 5643:140–56. Springer, 2009. https://doi.org/10.1007/978-3-642-02658-4_14.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[61]
2009 | Conference Paper | IST-REx-ID: 4580 | OA
Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Alpaga: A Tool for Solving Parity Games with Imperfect Information,” 5505:58–61. Springer, 2009. https://doi.org/10.1007/978-3-642-00768-2_7.
View | Files available | DOI | Download (ext.)
 
[60]
2009 | Technical Report | IST-REx-ID: 5393 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. Gist: A Solver for Probabilistic Games. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0003.
[Published Version] View | Files available | DOI
 
[59]
2009 | Technical Report | IST-REx-ID: 5394 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0002.
[Published Version] View | Files available | DOI
 
[58]
2009 | Technical Report | IST-REx-ID: 5392 | OA
Chatterjee, Krishnendu. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0004.
[Published Version] View | Files available | DOI
 
[57]
2009 | Technical Report | IST-REx-ID: 5395 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0001.
[Published Version] View | Files available | DOI
 
[56]
2008 | Conference Paper | IST-REx-ID: 3501
Adler, B Thomas, Krishnendu Chatterjee, Luca De Alfaro, Marco Faella, Ian Pye, and Vishwanath Raman. “Assigning Trust to Wikipedia Content.” ACM, 2008. https://doi.org/10.1145/1822258.1822293.
View | DOI
 
[55]
2008 | Conference Paper | IST-REx-ID: 3502
Chatterjee, Krishnendu, Luca De Alfaro, and Ian Pye. “Robust Content-Driven Reputation,” 33–42. ACM, 2008. https://doi.org/10.1145/1456377.1456387 .
View | DOI
 
[54]
2008 | Conference Paper | IST-REx-ID: 3504 | OA
Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath Raman. “Algorithms for Game Metrics,” 2:107–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008. https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745.
[Published Version] View | Files available | DOI
 
[53]
2008 | Conference Paper | IST-REx-ID: 3875
Chatterjee, Krishnendu, Thomas A Henzinger, and Koushik Sen. “Model-Checking Omega-Regular Properties of Interval Markov Chains,” 4962:302–17. Springer, 2008. https://doi.org/10.1007/978-3-540-78499-9_22.
View | DOI
 
[52]
2008 | Conference Paper | IST-REx-ID: 3873
Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Controller Synthesis with Budget Constraints,” 4981:72–86. Springer, 2008. https://doi.org/DOI: 10.1007/978-3-540-78929-1_6.
View | DOI
 
[51]
2008 | Conference Paper | IST-REx-ID: 3876
Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness,” 5215:124–40. Springer, 2008. https://doi.org/10.1007/978-3-540-85778-5_10.
View | Files available | DOI
 
[50]
2008 | Conference Paper | IST-REx-ID: 3877
Chatterjee, Krishnendu, Thomas A Henzinger, and Barbara Jobstmann. “Environment Assumptions for Synthesis,” 5201:147–61. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008. https://doi.org/10.1007/978-3-540-85361-9_14.
View | DOI
 
[49]
2008 | Conference Paper | IST-REx-ID: 3878 | OA
Chatterjee, Krishnendu, Luca De Alfaro, and Ritankar Majumdar. “The Complexity of Coverage,” 5356:91–106. Springer, 2008. https://doi.org/10.1007/978-3-540-89330-1_7.
View | DOI | Download (ext.)
 
[48]
2008 | Conference Paper | IST-REx-ID: 3874
Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Trading Infinite Memory for Uniform Randomness in Timed Games,” 4981:87–100. Springer, 2008. https://doi.org/10.1007/978-3-540-78929-1_7.
View | DOI
 
[47]
2008 | Conference Paper | IST-REx-ID: 3879
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Quantitative Languages,” 5213:385–400. Springer, 2008. https://doi.org/10.1007/978-3-540-87531-4_28.
View | DOI
 
[46]
2008 | Book Chapter | IST-REx-ID: 3872
Chatterjee, Krishnendu, and Thomas A Henzinger. “Value Iteration.” In 25 Years in Model Checking, 5000:107–38. Springer, 2008. https://doi.org/10.1007/978-3-540-69850-0_7.
View | DOI
 
[45]
2008 | Conference Paper | IST-REx-ID: 3880
Berwanger, Dietmar, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, and Sangram Raje. “Strategy Construction for Parity Games with Imperfect Information,” 5201:325–39. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008. https://doi.org/10.1007/978-3-540-85361-9.
View | Files available | DOI
 
[44]
2008 | Journal Article | IST-REx-ID: 4534
Chatterjee, Krishnendu, and Thomas A Henzinger. “Reduction of Stochastic Parity to Stochastic Mean-Payoff Games.” Information Processing Letters. Elsevier, 2008. https://doi.org/10.1016/j.ipl.2007.08.035.
View | DOI | Download (ext.)
 
[43]
2008 | Conference Paper | IST-REx-ID: 4546
Chatterjee, Krishnendu, Arkadeb Ghosal, Thomas A Henzinger, Daniel Iercan, Christoph Kirsch, Claudio Pinello, and Alberto Sangiovanni Vincentelli. “Logical Reliability of Interacting Real-Time Tasks,” 909–14. IEEE, 2008. https://doi.org/10.1145/1403375.1403595.
View | DOI | Download (ext.)
 
[42]
2008 | Journal Article | IST-REx-ID: 4548
Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Stochastic Limit-Average Games Are in EXPTIME.” International Journal of Game Theory. Springer, 2008. https://doi.org/10.1007/s00182-007-0110-5.
View | DOI | Download (ext.)
 
[41]
2007 | Conference Paper | IST-REx-ID: 3883
Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Generalized Parity Games,” 4423:153–67. Springer, 2007. https://doi.org/10.1007/978-3-540-71389-0_12.
View | DOI
 
[40]
2007 | Journal Article | IST-REx-ID: 3882
Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives.” Theoretical Computer Science. Elsevier, 2007. https://doi.org/10.1016/j.tcs.2007.07.047.
View | DOI
 
[39]
2007 | Conference Paper | IST-REx-ID: 3884
Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic,” 4703:59–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007. https://doi.org/10.1007/978-3-540-74407-8_5.
View | Files available | DOI
 
[38]
2007 | Conference Paper | IST-REx-ID: 3881
De Alfaro, Luca, Krishnendu Chatterjee, Marco Faella, and Axel Legay. “Qualitative Logics and Equivalences for Probabilistic Systems,” 237–48. IEEE, 2007. https://doi.org/10.1109/QEST.2007.15.
View | DOI
 
[37]
2007 | Conference Paper | IST-REx-ID: 3887
Chatterjee, Krishnendu. “Markov Decision Processes with Multiple Long-Run Average Objectives,” 4855:473–84. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007. https://doi.org/10.1007/978-3-540-77050-3_39.
View | DOI
 
[36]
2007 | Conference Paper | IST-REx-ID: 3886
Chatterjee, Krishnendu. “Stochastic Müller Games Are PSPACE-Complete,” 4855:436–48. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007. https://doi.org/10.1007/978-3-540-77050-3_36.
View | DOI
 
[35]
2007 | Conference Paper | IST-REx-ID: 3885
Chatterjee, Krishnendu. “Optimal Strategy Synthesis in Stochastic Müller Games,” 4423:138–52. Springer, 2007. https://doi.org/10.1007/978-3-540-71389-0_11.
View | DOI
 
[34]
2007 | Conference Paper | IST-REx-ID: 4537
Chatterjee, Krishnendu, and Thomas A Henzinger. “Assume-Guarantee Synthesis,” 4424:261–75. Springer, 2007. https://doi.org/10.1007/978-3-540-71209-1_21.
View | DOI
 
[33]
2007 | Journal Article | IST-REx-ID: 4547
Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Algorithms for Omega-Regular Games with Imperfect Information.” Logical Methods in Computer Science. International Federation of Computational Logic, 2007. https://doi.org/10.2168/LMCS-3(3:4)2007.
View | DOI
 
[32]
2007 | Thesis | IST-REx-ID: 4559
Chatterjee, Krishnendu. “Stochastic ω-Regular Games.” University of California, Berkeley, 2007.
View | Download (ext.)
 
[31]
2006 | Conference Paper | IST-REx-ID: 3449
Chatterjee, Krishnendu, Rhada Jagadeesan, and Corin Pitcher. “Games for Controls,” 70–82. IEEE, 2006. https://doi.org/10.1109/CSFW.2006.14.
View | DOI
 
[30]
2006 | Conference Paper | IST-REx-ID: 3499
Chatterjee, Krishnendu. “Nash Equilibrium for Upward-Closed Objectives,” 4207:271–86. Springer, 2006. https://doi.org/10.1007/11874683_18.
View | DOI
 
[29]
2006 | Conference Paper | IST-REx-ID: 3500
Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Algorithms for Büchi Games.” ACM, 2006.
View | Download (ext.)
 
[28]
2006 | Conference Paper | IST-REx-ID: 3890
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “The Complexity of Quantitative Concurrent Parity Games,” 678–87. SIAM, 2006. https://doi.org/10.1145/1109557.1109631.
View | DOI
 
[27]
2006 | Conference Paper | IST-REx-ID: 3889
Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Algorithms for Omega-Regular Games with Imperfect Information,” 4207:287–302. Springer, 2006. https://doi.org/10.1007/11874683_19.
View | DOI
 
[26]
2006 | Conference Paper | IST-REx-ID: 3891
Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives,” 4207:256–70. Springer, 2006. https://doi.org/10.1007/11874683_17.
View | DOI
 
[25]
2006 | Conference Paper | IST-REx-ID: 3888
Chatterjee, Krishnendu, and Thomas A Henzinger. “Strategy Improvement for Stochastic Rabin and Streett Games,” 4137:375–89. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2006. https://doi.org/10.1007/11817949_25.
View | DOI
 
[24]
2006 | Conference Paper | IST-REx-ID: 4539
Chatterjee, Krishnendu, and Thomas A Henzinger. “Finitary Winning in Omega-Regular Games,” 3920:257–71. Springer, 2006. https://doi.org/10.1007/11691372_17.
View | DOI
 
[23]
2006 | Conference Paper | IST-REx-ID: 4538
Chatterjee, Krishnendu, and Thomas A Henzinger. “Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games,” 3884:512–23. Springer, 2006. https://doi.org/10.1007/11672142_42.
View | DOI
 
[22]
2006 | Conference Paper | IST-REx-ID: 4551
Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Markov Decision Processes with Multiple Objectives,” 3884:325–36. Springer, 2006. https://doi.org/10.1007/11672142_26.
View | DOI
 
[21]
2006 | Journal Article | IST-REx-ID: 4550
Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziński. “Games with Secure Equilibria.” Theoretical Computer Science. Elsevier, 2006. https://doi.org/10.1016/j.tcs.2006.07.032.
View | DOI
 
[20]
2006 | Conference Paper | IST-REx-ID: 4549
Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, Thomas A Henzinger, Ritankar Majumdar, and Mariëlle Stoelinga. “Compositional Quantitative Reasoning,” 179–88. IEEE, 2006. https://doi.org/10.1109/QEST.2006.11.
View | DOI
 
[19]
2006 | Conference Paper | IST-REx-ID: 4552
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Strategy Improvement for Concurrent Reachability Games,” 291–300. IEEE, 2006. https://doi.org/10.1109/QEST.2006.48.
View | DOI
 
[18]
2005 | Conference Paper | IST-REx-ID: 3896
Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “Complexity of Compositional Model Checking of Computation Tree Logic on Simple Structures,” 3326:89–102. Springer, 2005. https://doi.org/10.1007/978-3-540-30536-1_13.
View | DOI
 
[17]
2005 | Conference Paper | IST-REx-ID: 3893
Chatterjee, Krishnendu. “Two-Player Nonzero-Sum ω-Regular Games,” 3653:413–27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2005. https://doi.org/10.1007/11539452_32.
View | DOI
 
[16]
2005 | Conference Paper | IST-REx-ID: 3892
Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziński. “Games with Secure Equilibria,” 3657:141–61. Springer, 2005. https://doi.org/10.1007/11561163_7.
View | DOI
 
[15]
2005 | Conference Paper | IST-REx-ID: 4541
Chatterjee, Krishnendu, and Thomas A Henzinger. “Semiperfect-Information Games,” 3821:1–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2005. https://doi.org/10.1007/11590156_1.
View | DOI
 
[14]
2005 | Conference Paper | IST-REx-ID: 4553
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “The Complexity of Stochastic Rabin and Streett Games,” 3580:878–90. Springer, 2005. https://doi.org/10.1007/11523468_71.
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 4554
Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziński. “Mean-Payoff Parity Games,” 178–87. IEEE, 2005. https://doi.org/10.1109/LICS.2005.26.
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 4560
Chakrabarti, Arindam, Krishnendu Chatterjee, Thomas A Henzinger, Orna Kupferman, and Ritankar Majumdar. “Verifying Quantitative Properties Using Bound Functions,” 3725:50–64. Springer, 2005. https://doi.org/10.1007/11560548_7.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 4557
Chatterjee, Krishnendu, Thomas A Henzinger, Ranjit Jhala, and Ritankar Majumdar. “Counterexample-Guided Planning,” 104–11. AUAI Press, 2005.
View | Download (ext.)
 
[10]
2004 | Conference Paper | IST-REx-ID: 3894
Chatterjee, Krishnendu, Ritankar Majumdar, and Marcin Jurdziński. “On Nash Equilibria in Stochastic Games,” 3210:26–40. Springer, 2004. https://doi.org/10.1007/978-3-540-30124-0_6.
View | DOI
 
[9]
2004 | Conference Paper | IST-REx-ID: 3895
Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziński. “Games with Secure Equilibria,” 160–69. IEEE, 2004. https://doi.org/10.1109/LICS.2004.1319610.
View | DOI
 
[8]
2004 | Conference Paper | IST-REx-ID: 4555
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Trading Memory for Randomness,” 206–17. IEEE, 2004. https://doi.org/10.1109/QEST.2004.10051.
View | DOI
 
[7]
2004 | Conference Paper | IST-REx-ID: 4558
Chatterjee, Krishnendu, Marcin Jurdziński, and Thomas A Henzinger. “Quantitative Stochastic Parity Games,” 121–30. SIAM, 2004.
View
 
[6]
2004 | Journal Article | IST-REx-ID: 4556
Chatterjee, Krishnendu, Di Ma, Ritankar Majumdar, Tian Zhao, Thomas A Henzinger, and Jens Palsberg. “Stack Size Analysis for Interrupt-Driven Programs.” Information and Computation. Elsevier, 2004. https://doi.org/10.1016/j.ic.2004.06.001.
View | DOI
 
[5]
2003 | Conference Paper | IST-REx-ID: 3897
Chatterjee, Krishnendu, Marcin Jurdziński, and Thomas A Henzinger. “Simple Stochastic Parity Games,” 2803:100–113. Springer, 2003. https://doi.org/10.1007/978-3-540-45220-1_11.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3898
Chatterjee, Krishnendu, Di Ma, Ritankar Majumdar, Tian Zhao, Thomas A Henzinger, and Jens Palsberg. “Stack Size Analysis for Interrupt-Driven Programs,” 2694:109–26. Springer, 2003. https://doi.org/10.1007/3-540-44898-5_7.
View | DOI
 
[3]
2003 | Journal Article | IST-REx-ID: 3593
Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “A Branching Time Temporal Framework for Quantitative Reasoning.” Journal of Automated Reasoning. Springer, 2003. https://doi.org/10.1023/A:1023217515688.
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 3448
Mallick, Sanhita, Krishnendu Chatterjee, Arif Merchant, and Pallab Dasgupta. “Implementation of Shape Grammar for Plan Analysis.” Elsevier, 2002.
View
 
[1]
2001 | Conference Paper | IST-REx-ID: 3447
Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “Weighted Quantified Computation Tree Logic.” Elsevier, 2001.
View
 
Marked Publication(s)

Search

Filter Publications