Krishnendu Chatterjee

Chatterjee Group

431 Publications

Mark all

[431]
2024 | Conference Paper | IST-REx-ID: 15006 | OA
Hirvonen, J., Schmid, L., Chatterjee, K., & Schmid, S. (2024). On the convergence time in graphical games: A locality-sensitive approach. In 27th International Conference on Principles of Distributed Systems (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, V., Staab, M., Hilbe, C., Chatterjee, K., & Kleshnina, M. (2024). Efficiency and resilience of cooperation in asymmetric social dilemmas. Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences. 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, J., Joshi, S. S., Tkadlec, J., & Chatterjee, K. (2024). Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. Public Library of Science. 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, K., Meggendorfer, T., Saona Urmeneta, R. J., & Svoboda, J. (2023). Faster algorithm for turn-based stochastic games with bounded treewidth. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 4590–4605). Florence, Italy: Society for Industrial and Applied Mathematics. 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, K., Henzinger, T. A., Lechner, M., & Zikelic, D. (2023). A learner-verifier framework for neural network controllers and certificates of stochastic systems. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13993, pp. 3–25). Paris, France: Springer Nature. 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, J., Tkadlec, J., Kaveh, K., & Chatterjee, K. (2023). Coexistence times in the Moran process with environmental heterogeneity. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. The Royal Society. 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, L., Ekbatani, F., Hilbe, C., & Chatterjee, K. (2023). Quantitative assessment can stabilize indirect reciprocity under imperfect information. Nature Communications. Springer Nature. 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, M., Zikelic, D., Chatterjee, K., Henzinger, T. A., & Rus, D. (2023). Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 14964–14973). Washington, DC, United States: Association for the Advancement of Artificial Intelligence. 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, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2023). Automated tail bound analysis for probabilistic recurrence relations. In Computer Aided Verification (Vol. 13966, pp. 16–39). Paris, France: Springer Nature. 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., Chatterjee, K., Meggendorfer, T., & Zikelic, D. (2023). MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In International Conference on Computer Aided Verification (Vol. 13966, pp. 86–112). Paris, France: Springer Nature. 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, K., Katoen, J. P., Mohr, S., Weininger, M., & Winkler, T. (2023). Stochastic games with lexicographic objectives. Formal Methods in System Design. Springer Nature. 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, C., Chatterjee, K., Meggendorfer, T., & Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In 48th International Symposium on Mathematical Foundations of Computer Science (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, M., Chatterjee, K., Henzinger, T. A., Lechner, M., & Zikelic, D. (2023). Learning provably stabilizing neural controllers for discrete-time stochastic systems. In 21st International Symposium on Automated Technology for Verification and Analysis (Vol. 14215, pp. 357–379). Singapore, Singapore: Springer Nature. https://doi.org/10.1007/978-3-031-45329-8_17
View | DOI
 
[418]
2023 | Journal Article | IST-REx-ID: 14657 | OA
Tkadlec, J., Kaveh, K., Chatterjee, K., & Nowak, M. A. (2023). Evolutionary dynamics of mutants that modify population structure. Journal of the Royal Society, Interface. The Royal Society. 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, M., Hilbe, C., Simsa, S., Chatterjee, K., & Nowak, M. A. (2023). The effect of environmental information on evolution of cooperation in stochastic games. Nature Communications. Springer Nature. 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, M., Chatterjee, K., Maddah-Ali, M. A., Schmid, S., Svoboda, J., & Yeo, M. X. (2023). R2: Boosting liquidity in payment channel networks with online admission control. In 27th International Conference on Financial Cryptography and Data Security (Vol. 13950, pp. 309–325). Bol, Brac, Croatia: Springer Nature. https://doi.org/10.1007/978-3-031-47754-6_18
View | DOI
 
[415]
2023 | Journal Article | IST-REx-ID: 14778 | OA
Chatterjee, K., Kafshdar Goharshady, E., Novotný, P., Zárevúcky, J., & Zikelic, D. (2023). On lexicographic proof rules for probabilistic termination. Formal Aspects of Computing. Association for Computing Machinery. https://doi.org/10.1145/3585391
[Published Version] View | Files available | DOI | arXiv
 
[414]
2023 | Conference Paper | IST-REx-ID: 14830
Zikelic, D., Lechner, M., Henzinger, T. A., & Chatterjee, K. (2023). Learning control policies for stochastic systems with reach-avoid guarantees. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 11926–11935). Washington, DC, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v37i10.26407
[Preprint] View | Files available | DOI | arXiv
 
[413]
2023 | Conference Paper | IST-REx-ID: 15023 | OA
Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., & Henzinger, T. A. (2023). Compositional policy learning in stochastic control systems with formal guarantees. In 37th Conference on Neural Information Processing Systems. New Orleans, LO, United States.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[412]
2022 | Conference Paper | IST-REx-ID: 12102 | OA
Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., & Zikelic, D. (2022). 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). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2022). Complexity of spatial games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11
[Published Version] View | Files available | DOI
 
[410]
2022 | Preprint | IST-REx-ID: 12677 | OA
Chatterjee, K., Mohammadi, M., & Saona Urmeneta, R. J. (n.d.). Repeated prophet inequality with near-optimal bounds. arXiv. 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, J., Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2022). Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. Springer Nature. 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, K., Svoboda, J., Zikelic, D., Pavlogiannis, A., & Tkadlec, J. (2022). Social balance on networks: Local minima and best-edge dynamics. Physical Review E. American Physical Society. 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, L., Hilbe, C., Chatterjee, K., & Nowak, M. (2022). Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology. Public Library of Science. 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, K., Saona Urmeneta, R. J., & Ziliotto, B. (2022). Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences. 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, K., & Doyen, L. (2022). Graph planning with expected finite horizon. Journal of Computer and System Sciences. Elsevier. 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, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2022). Sound and complete certificates for auantitative termination analysis of probabilistic programs. In Proceedings of the 34th International Conference on Computer Aided Verification (Vol. 13371, pp. 55–78). Haifa, Israel: Springer. 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, M., Zikelic, D., Chatterjee, K., & Henzinger, T. A. (2022). 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. 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, D., Lechner, M., Chatterjee, K., & Henzinger, T. A. (n.d.). Learning stabilizing policies in stochastic control systems. arXiv. 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, D., Lechner, M., Henzinger, T. A., & Chatterjee, K. (n.d.). Learning control policies for stochastic systems with reach-avoid guarantees. arXiv. 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, K., Henzinger, M. H., Kale, S. S., & Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In 48th International Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz Zentrum für Informatik. 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, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Quantitative verification on product graphs of small treewidth. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, P., Horák, K., Aradhye, A., Bošanský, B., & Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In 30th International Joint Conference on Artificial Intelligence (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence. 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, S., Chatterjee, K., & Vardi, M. Y. (2021). On satisficing in quantitative games. In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12651, pp. 20–37). Luxembourg City, Luxembourg: Springer Nature. 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, M., Žikelić, Ð., Chatterjee, K., & Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In 35th Conference on Neural Information Processing Systems. Virtual. 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, M., Schmid, U., & Chatterjee, K. (2021). Optimal strategies for selecting coordinators. Discrete Applied Mathematics. Elsevier. 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, M., Streipert, S. S., Filar, J. A., & Chatterjee, K. (2021). Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. Public Library of Science. 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, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2021). Fast and strong amplifiers of natural selection. Nature Communications. Springer Nature. 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, J., Sun, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2021). Quantitative analysis of assertion violations in probabilistic programs. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1171–1186). Online: Association for Computing Machinery. 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, A., Chatterjee, K., Fu, H., Goharshady, A. K., & Mahdavi, M. (2021). Polynomial reachability witnesses via Stellensätze. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 772–787). Online: Association for Computing Machinery. 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, K., Dvorak, W., Henzinger, M. H., & Svozil, A. (2021). Symbolic time and space tradeoffs for probabilistic verification. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. 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, K., & Doyen, L. (2021). Stochastic processes with expected stopping time. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. 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, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., & Toman, V. (2021). Stateless model checking under a reads-value-from equivalence. In 33rd International Conference on Computer-Aided Verification (Vol. 12759, pp. 341–366). Virtual: Springer Nature. 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, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., & Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3485541
[Published Version] View | Files available | DOI | arXiv
 
[386]
2021 | Journal Article | IST-REx-ID: 9293 | OA
Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. Elsevier. 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, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. Springer. 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, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., & Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In 24th International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual: Springer Nature. 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, K., Goharshady, E. K., Novotný, P., & Zikelic, D. (2021). Proving non-termination by program reversal. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1033–1048). Online: Association for Computing Machinery. 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, K., Goharshady, A. K., Novotný, P., & Zikelic, D. (2021). RevTerm. Association for Computing Machinery. 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, L., Shati, P., Hilbe, C., & Chatterjee, K. (2021). The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. Springer Nature. 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, L., Chatterjee, K., Hilbe, C., & Nowak, M. A. (2021). A unified framework of direct and indirect reciprocity. Nature Human Behaviour. Springer Nature. 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, L., Chatterjee, K., & Schmid, S. (2020). 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). Neuchâtel, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Henzinger, T. A., & Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, P., Chatterjee, K., Kretinsky, J., Weininger, M., & Winkler, T. (2020). Approximating values of generalized-reachability stochastic games. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 102–115). Saarbrücken, Germany: Association for Computing Machinery. 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, K., McAvoy, A., Chatterjee, K., & Nowak, M. A. (2020). The Moran process on 2-chromatic graphs. PLOS Computational Biology. Public Library of Science. 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, M., Streipert, S., Filar, J., & Chatterjee, K. (2020). Prioritised learning in snowdrift-type games. Mathematics. MDPI. https://doi.org/10.3390/math8111945
[Published Version] View | Files available | DOI | WoS
 
[373]
2020 | Journal Article | IST-REx-ID: 8788
Pavlogiannis, A., Schaumberger, N., Schmid, U., & Chatterjee, K. (2020). Precedence-aware automated competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE. https://doi.org/10.1109/TCAD.2020.3012803
View | DOI | WoS
 
[372]
2020 | Conference Paper | IST-REx-ID: 8193
Chatterjee, K., Chmelik, M., Karkhanis, D., Novotný, P., & Royer, A. (2020). Multiple-environment Markov decision processes: Efficient analysis and applications. In Proceedings of the 30th International Conference on Automated Planning and Scheduling (Vol. 30, pp. 48–56). Nancy, France: Association for the Advancement of Artificial Intelligence.
View | Files available
 
[371]
2020 | Conference Paper | IST-REx-ID: 8272 | OA
Chatterjee, K., Katoen, J. P., Weininger, M., & Winkler, T. (2020). Stochastic games with lexicographic reachability-safety objectives. In International Conference on Computer Aided Verification (Vol. 12225, pp. 398–420). Springer Nature. 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, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2020). Limits on amplifiers of natural selection under death-Birth updating. PLoS Computational Biology. Public Library of Science. 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, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2020). Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. Royal Society. 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, P., Fu, H., Chatterjee, K., Deng, Y., & Xu, M. (2020). Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In Proceedings of the ACM on Programming Languages (Vol. 4). ACM. https://doi.org/10.1145/3371093
[Published Version] View | Files available | DOI | arXiv
 
[367]
2020 | Journal Article | IST-REx-ID: 15055 | OA
Brázdil, T., Chatterjee, K., Novotný, P., & Vahala, J. (2020). Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence. 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, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2020). Optimal and perfectly parallel algorithms for on-demand data-flow analysis. In European Symposium on Programming (Vol. 12075, pp. 112–140). Dublin, Ireland: Springer Nature. 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, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K., & Pavlogiannis, A. (2020). Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In Automated Technology for Verification and Analysis (Vol. 12302, pp. 253–270). Hanoi, Vietnam: Springer Nature. 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, K., Fu, H., Goharshady, A. K., & Goharshady, E. K. (2020). Polynomial invariant generation for non-deterministic recursive programs. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 672–687). London, United Kingdom: Association for Computing Machinery. 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, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Henzinger, T. A., & Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6
[Published Version] View | Files available | DOI
 
[360]
2019 | Conference Paper | IST-REx-ID: 5948
Fu, H., & Chatterjee, K. (2019). Termination of nondeterministic probabilistic programs. In International Conference on Verification, Model Checking, and Abstract Interpretation (Vol. 11388, pp. 468–490). Cascais, Portugal: Springer Nature. 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, G., Bloem, R., Chatterjee, K., Henzinger, T. A., Konighofer, B., & Pranger, S. (2019). Run-time optimization for learned controllers through quantitative games. In 31st International Conference on Computer-Aided Verification (Vol. 11561, pp. 630–649). New York, NY, United States: Springer. 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, O. P., Hilbe, C., Chatterjee, K., & Nowak, M. A. (2019). Social dilemmas among unequals. Nature. Springer Nature. 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, P., Brázdil, T., Chatterjee, K., Křetínský, J., Lampert, C., & Toman, V. (2019). Strategy representation by decision trees with linear classifiers. In 16th International Conference on Quantitative Evaluation of Systems (Vol. 11785, pp. 109–128). Glasgow, United Kingdom: Springer Nature. 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, T., Chatterjee, K., Kucera, A., Novotný, P., & Velan, D. (2019). Deciding fast termination for probabilistic VASS with nondeterminism. In International Symposium on Automated Technology for Verification and Analysis (Vol. 11781, pp. 462–478). Taipei, Taiwan: Springer Nature. 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, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2019). Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. Springer Nature. 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, K., Pavlogiannis, A., & Toman, V. (2019). Value-centric dynamic partial order reduction. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications (Vol. 3). Athens, Greece: ACM. 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, K., & Doyen, L. (2019). Graph planning with expected finite horizon. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Vancouver, BC, Canada: IEEE. 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, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (2019). 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). Athens, Greece: ACM. https://doi.org/10.1145/3360555
[Published Version] View | Files available | DOI | arXiv
 
[351]
2019 | Journal Article | IST-REx-ID: 6380 | OA
Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. ACM. https://doi.org/10.1145/3290366
[Published Version] View | Files available | DOI
 
[350]
2019 | Conference Paper | IST-REx-ID: 6056 | OA
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE. 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, K., Goharshady, A. K., & Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319
[Submitted Version] View | Files available | DOI | WoS
 
[348]
2019 | Conference Paper | IST-REx-ID: 6175 | OA
Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. 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, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322
[Submitted Version] View | Files available | DOI | WoS
 
[346]
2019 | Journal Article | IST-REx-ID: 7158 | OA
Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3363525
[Submitted Version] View | Files available | DOI | WoS
 
[345]
2019 | Journal Article | IST-REx-ID: 7014 | OA
Chatterjee, K., Fu, H., & Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. ACM. 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, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2018). Quasipolynomial set-based symbolic algorithms for parity games. In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57, pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k
[Published Version] View | Files available | DOI | arXiv
 
[343]
2018 | Conference Paper | IST-REx-ID: 325 | OA
Agrawal, S., Chatterjee, K., & Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[342]
2018 | Book Chapter | IST-REx-ID: 59
Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.), Handbook of Model Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27
View | DOI
 
[341]
2018 | Book Chapter | IST-REx-ID: 86 | OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer. 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, J., Hilbe, C., Rand, D., Chatterjee, K., & Nowak, M. (2018). Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. Nature Publishing Group. 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, T., Chatterjee, K., Kučera, A., Novotný, P., Velan, D., & Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE. https://doi.org/10.1145/3209108.3209191
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[338]
2018 | Journal Article | IST-REx-ID: 157 | OA
Hilbe, C., Šimsa, Š., Chatterjee, K., & Nowak, M. (2018). Evolution of cooperation in stochastic games. Nature. Nature Publishing Group. 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, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2018). Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter (pp. 2341–2356). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States: ACM. 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, M., Fu, H., & Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. 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, C., Chatterjee, K., & Nowak, M. (2018). Partners and rivals in direct reciprocity. Nature Human Behaviour. Nature Publishing Group. 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, S., Bartocci, E., Chatterjee, K., Katoen, J. P., & Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. 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, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. 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, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., & Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. 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, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). 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, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. 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, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. 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, K., Chemlík, M., & Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[327]
2018 | Conference Paper | IST-REx-ID: 35 | OA
Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.
View | Files available | Download None (ext.) | WoS | arXiv
 
[326]
2018 | Journal Article | IST-REx-ID: 738 | OA
Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. Springer. 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, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Language acquisition with communication between learners. Journal of the Royal Society Interface. The Royal Society. 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, A., Tkadlec, J., Chatterjee, K., & Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. Springer Nature. 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, K., Goharshady, A. K., Ibsen-Jensen, R., & Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Goharshady, A. K., & Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer. 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, A. K., Behrouz, A., & Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In Proceedings of the IEEE International Conference on Blockchain (pp. 1343–1348). Halifax, Canada: IEEE. 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, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). 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, K., Fu, H., Goharshady, A. K., & Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI. 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, C., Schmid, L., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Indirect reciprocity with private, noisy, and incomplete information. PNAS. National Academy of Sciences. 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, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM. 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, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic. 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, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports. Nature Publishing Group. 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, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158118
[Published Version] View | Files available | DOI | arXiv
 
[311]
2017 | Technical Report | IST-REx-ID: 5455 | OA
Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria. 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, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. 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, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. IST Austria. 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, K., Ibsen-Jensen, R., & Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Henzinger, M. H., & Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Doyen, L., & Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, & R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460, pp. 367–381). Springer. 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, K., Fu, H., & Murhekar, A. (2017). Automated recurrence analysis for almost linear expected runtime bounds. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 118–139). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. 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, P., Chatterjee, K., Daca, P., Kretinsky, J., & Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. 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, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik. 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, A., Zhang, M., Reiter, J., Božić, I., Allen, B., Kundu, D., … Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. Nature Publishing Group. 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, C., Martinez, V., Chatterjee, K., & Nowak, M. (2017). Memory-n strategies of direct reciprocity. PNAS. National Academy of Sciences. 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, K., Doyen, L., Filiot, E., & Raskin, J. (2017). Doomsday equilibria for omega-regular games. Information and Computation. Elsevier. 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, K., & Piterman, N. (2017). Obligation blackwell games and p-automata. Journal of Symbolic Logic. Cambridge University Press. 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, K., Henzinger, T. A., & Otop, J. (2017). Bidirectional nested weighted automata (Vol. 85). Presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., & Velner, Y. (2017). The complexity of mean-payoff pushdown games. Journal of the ACM. ACM. https://doi.org/10.1145/3121408
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[295]
2017 | Journal Article | IST-REx-ID: 717 | OA
Chatterjee, K., & Velner, Y. (2017). Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. Academic Press. 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, K., & Ehlers, R. (2017). Special issue: Synthesis and SYNT 2014. Acta Informatica. Springer. https://doi.org/10.1007/s00236-017-0299-0
View | DOI
 
[293]
2017 | Journal Article | IST-REx-ID: 1407 | OA
Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier. 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, T., Chatterjee, K., Forejt, V., & Kučera, A. (2017). Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. Elsevier. 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, J., Makohon Moore, A., Gerold, J., Božić, I., Chatterjee, K., Iacobuzio Donahue, C., … Nowak, M. (2017). Reconstructing metastatic seeding patterns of human cancers. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms14114
[Published Version] View | Files available | DOI | WoS
 
[290]
2017 | Journal Article | IST-REx-ID: 1065 | OA
Chatterjee, K., & Osang, G. F. (2017). Pushdown reachability with constant treewidth. Information Processing Letters. Elsevier. 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, K., Henzinger, T. A., Otop, J., & Velner, Y. (2017). Quantitative fair simulation games. Information and Computation. Elsevier. 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, K., Kragl, B., Mishra, S., & Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer. 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, K., Novotný, P., Pérez, G., Raskin, J., & Zikelic, D. (2017). Optimizing expectation with guarantees in POMDPs. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3725–3732). San Francisco, CA, United States: AAAI Press.
[Submitted Version] View | Download Submitted Version (ext.) | WoS
 
[286]
2017 | Journal Article | IST-REx-ID: 744 | OA
Priklopil, T., Chatterjee, K., & Nowak, M. (2017). Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. Elsevier. 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, K., Novotný, P., & Zikelic, D. (2017). Stochastic invariants for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles of Programming Languages, Paris, France: ACM. 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, A., Tkadlec, J., Chatterjee, K., & Nowak , M. (2017). Strong amplifiers of natural selection. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:51
[Published Version] View | Files available | DOI
 
[283]
2017 | Conference Paper | IST-REx-ID: 639 | OA
Chatterjee, K., Fu, H., & Goharshady, A. K. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. 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, K., Goharshady, A. K., & Pavlogiannis, A. (2017). JTDec: A tool for tree decompositions in soot. In D. D’Souza (Ed.) (Vol. 10482, pp. 59–66). Presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India: Springer. 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, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2016). Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., & Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. 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, K., Henzinger, T. A., & Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Henzinger, T. A., & Otop, J. (2016). Quantitative automata under probabilistic semantics. In Proceedings of the 31st Annual ACM/IEEE Symposium (pp. 76–85). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2933588
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[277]
2016 | Conference Paper | IST-REx-ID: 1140 | OA
Chatterjee, K., Dvoák, W., Henzinger, M. H., & Loitzenbauer, V. (2016). 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 (pp. 197–206). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2935304
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[276]
2016 | Conference Paper | IST-REx-ID: 1182 | OA
Chatterjee, K., Ibsen-Jensen, R., & Tkadlec, J. (2016). Robust draws in balanced knockout tournaments (Vol. 2016–January, pp. 172–179). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA: AAAI Press.
[Preprint] View | Files available | Download Preprint (ext.)
 
[275]
2016 | Conference Paper | IST-REx-ID: 1245
Pandey, V., & Chatterjee, K. (2016). Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In Proceedings of the ACM Conference on Computer Supported Cooperative Work (Vol. 26, pp. 365–368). San Francisco, CA, USA: ACM. https://doi.org/10.1145/2818052.2869122
View | DOI
 
[274]
2016 | Conference Paper | IST-REx-ID: 1324
Chatterjee, K., & Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling (Vol. 2016–January, pp. 88–96). London, United Kingdom: AAAI Press.
View | Download None (ext.)
 
[273]
2016 | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., & Novotný, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 1465–1466). Singapore: ACM.
[Preprint] View | Download Preprint (ext.)
 
[272]
2016 | Conference Paper | IST-REx-ID: 1335 | OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Quantitative monitor automata (Vol. 9837, pp. 23–38). Presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom: Springer. 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, K., & Ibsen-Jensen, R. (2016). The complexity of deciding legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands: IOS Press. 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, K., & Doyen, L. (2016). Perfect-information stochastic games with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934513
[Preprint] View | DOI | Download Preprint (ext.)
 
[269]
2016 | Journal Article | IST-REx-ID: 1477 | OA
Chatterjee, K., Chmelik, M., & Tracol, M. (2016). What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. Elsevier. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. Elsevier. 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, K., Pavlogiannis, A., & Velner, Y. (2016). Quantitative interprocedural analysis. IST Austria. 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, K., Chmelik, M., & Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.
View | Files available
 
[265]
2016 | Technical Report | IST-REx-ID: 5449 | OA
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Amplification on undirected population structures: Comets beat stars. IST Austria. 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, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria. 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, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Strong amplifiers of natural selection. IST Austria. 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, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs (Vol. 57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. 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, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. 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, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria. 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, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. 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, K., Fu, H., & Goharshady, A. K. (2016). Termination analysis of probabilistic programs through Positivstellensatz’s (Vol. 9779, pp. 3–22). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. 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, K., & Ibsen-Jensen, R. (2015). 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 (Vol. 2015, pp. 1018–1029). San Diego, CA, United States: SIAM. https://doi.org/10.1137/1.9781611973730.69
[Preprint] View | DOI | arXiv
 
[256]
2015 | Journal Article | IST-REx-ID: 1559 | OA
Ibsen-Jensen, R., Chatterjee, K., & Nowak, M. (2015). Computational complexity of ecological and evolutionary spatial dynamics. PNAS. National Academy of Sciences. 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, K., Doyen, L., & Vardi, M. (2015). The complexity of synthesis from probabilistic components. In 42nd International Colloquium (Vol. 9135, pp. 108–120). Kyoto, Japan: Springer Nature. 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, A., Chatterjee, K., Adlam, B., & Nowak, M. (2015). Cellular cooperation with shift updating and repulsion. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/srep17147
[Published Version] View | Files available | DOI
 
[253]
2015 | Journal Article | IST-REx-ID: 1673 | OA
Adlam, B., Chatterjee, K., & Nowak, M. (2015). Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London. 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., Chmelik, M., Leahy, K., Eniser, H., Chatterjee, K., Cěrná, I., & Belta, C. (2015). 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 (pp. 233–238). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728617
View | DOI
 
[251]
2015 | Journal Article | IST-REx-ID: 1694
Chatterjee, K., & Prabhu, V. (2015). Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. IEEE. https://doi.org/10.1109/TAC.2015.2404612
View | DOI
 
[250]
2015 | Journal Article | IST-REx-ID: 1698 | OA
Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., & Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. Information and Computation. Elsevier. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Optimal cost almost-sure reachability in POMDPs. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3496–3502). Austin, TX, USA: AAAI Press.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[248]
2015 | Conference Paper | IST-REx-ID: 1838 | OA
Bloem, R., Chatterjee, K., Jacobs, S., & Könighofer, R. (2015). Assume-guarantee synthesis for concurrent reactive programs with partial information (Vol. 9035, pp. 517–532). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. 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, T., Chatterjee, K., Forejt, V., & Kučera, A. (2015). Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. 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, K., & Chmelik, M. (2015). POMDPs under probabilistic semantics. Artificial Intelligence. Elsevier. 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., Chatterjee, K., & Sznajder, N. (2015). Probabilistic opacity for Markov decision processes. Information Processing Letters. Elsevier. 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, K., Joglekar, M., & Shah, N. (2015). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. Elsevier. 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, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2015). Randomness for free. Information and Computation. Elsevier. 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, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. ACM. https://doi.org/10.1145/2699430
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[241]
2015 | Conference Paper | IST-REx-ID: 1661 | OA
Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE. 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, K., Doyen, L., Randour, M., & Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. Information and Computation. Elsevier. 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, K., & Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. Information and Computation. Elsevier. 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, U., Chatterjee, K., & Gulwani, S. (2015). Automatic generation of alternative starting positions for simple traditional board games. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 2, pp. 745–752). Austin, TX, USA: AAAI Press.
View | Files available | Download None (ext.)
 
[237]
2015 | Conference Paper | IST-REx-ID: 1732 | OA
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE. 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, K., Ibsen-Jensen, R., & Hansen, K. (2015). The patience of concurrent stochastic games with safety and reachability objectives. IST Austria. 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, K., Komárková, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.32
View | Files available | DOI
 
[234]
2015 | Conference Paper | IST-REx-ID: 1656
Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.72
View | Files available | DOI | arXiv
 
[233]
2015 | Technical Report | IST-REx-ID: 5429 | OA
Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. 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, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. 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, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. IST Austria. 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, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. In 42nd International Colloquium (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature. 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, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria. 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, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria. 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, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. IST Austria. 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, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria. 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, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria. 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, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue, C., … Nowak, M. (2015). Reconstructing robust phylogenies of metastatic cancers. IST Austria. 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, K., Chmelik, M., & Davies, J. (2015). A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria. 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, J., Kanodia, A., Gupta, R., Nowak, M., & Chatterjee, K. (2015). Biological auctions with multiple rewards. Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society. 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, K., Chmelik, M., & Daca, P. (2015). CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. Springer. 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, K., Ibsen-Jensen, R., Pavlogiannis, A., & Goyal, P. (2015). Faster algorithms for algebraic path properties in recursive state machines with constant treewidth. ACM SIGPLAN Notices. Mumbai, India: ACM. 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, K., Pavlogiannis, A., & Velner, Y. (2015). Quantitative interprocedural analysis. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . Mumbai, India: ACM. https://doi.org/10.1145/2676726.2676968
View | Files available | DOI
 
[218]
2015 | Conference Paper | IST-REx-ID: 1607 | OA
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs (Vol. 9206, pp. 140–157). Presented at the CAV: Computer Aided Verification, San Francisco, CA, USA: Springer. 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, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2015). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In Real-Time Systems Symposium (Vol. 2015, pp. 118–127). Rome, Italy: IEEE. https://doi.org/10.1109/RTSS.2014.9
View | Files available | DOI
 
[216]
2015 | Technical Report | IST-REx-ID: 5441 | OA
Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria. 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., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2015). 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 (pp. 259–268). Seattle, WA, United States: ACM. 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, T., & Chatterjee, K. (2015). Evolution of decisions in population games with sequentially searching individuals. Games. MDPI. https://doi.org/10.3390/g6040413
[Published Version] View | Files available | DOI
 
[213]
2015 | Conference Paper | IST-REx-ID: 1603 | OA
Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., & Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. 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, K., Henzinger, M. H., Krinninger, S., Loitzenbauer, V., & Raskin, M. (2014). Approximating the minimum cycle mean. Theoretical Computer Science. Elsevier. 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, S., Tripakis, S., Seshia, S., & Chatterjee, K. (2014). Game theoretic secure localization in wireless sensor networks (pp. 85–90). Presented at the IOT: Internet of Things, Cambridge, USA: IEEE. https://doi.org/10.1109/IOT.2014.7030120
View | DOI
 
[210]
2014 | Conference Paper | IST-REx-ID: 2027 | OA
Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez & J.-F. Raskin (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 98–114). Sydney, Australia: Society of Industrial and Applied Mathematics. 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, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B., … Könighofer, R. (2014). Synthesizing robust systems. Acta Informatica. Springer. 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, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, A. (2014). Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., Randour, M., & Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. Springer. 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, K., & Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. ACM. 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, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_37
View | Files available | DOI
 
[204]
2014 | Conference Paper | IST-REx-ID: 1903
Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer. 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, K., & Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). ACM. 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, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2629686
[Submitted Version] View | Files available | DOI
 
[201]
2014 | Conference Paper | IST-REx-ID: 2162 | OA
Chatterjee, K., & Ibsen-Jensen, R. (2014). The complexity of ergodic mean payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer. 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, K., Doyen, L., Nain, S., & Vardi, M. (2014). The complexity of partial-observation stochastic parity games with finite-memory strategies (Vol. 8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. 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, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2014). Perfect-information stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. 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, K., Ibsen-Jensen, R., & Majumdar, R. (2014). Edit distance for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany: Springer. 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, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. 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, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. 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, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. 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, K., & Doyen, L. (2014). Games with a weak adversary. In Lecture Notes in Computer Science (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer. 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, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria. 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, K., & Doyen, L. (2014). Games with a weak adversary. IST Austria. 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, K., & Ibsen-Jensen, R. (2014). The value 1 problem for concurrent mean-payoff games. IST Austria. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. 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, K., Kössler, A., Pavlogiannis, A., & Schmid, U. (2014). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria. 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, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria. 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, K., Henzinger, T. A., & Otop, J. (2014). Nested weighted automata. IST Austria. 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, K., Ibsen-Jensen, R., & Nowak, M. (2014). The complexity of evolution on graphs. IST Austria. 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, K., Doyen, L., Filiot, E., & Raskin, J.-F. (2014). Doomsday equilibria for omega-regular games. In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 78–97). San Diego, CA, United States: Springer Nature. 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, K., Pavlogiannis, A., Adlam, B., & Nowak, M. (2014). The time scale of evolutionary innovation. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1003818
[Published Version] View | Files available | DOI
 
[182]
2014 | Research Data Reference | IST-REx-ID: 9739
Chatterjee, K., Pavlogiannis, A., Adlam, B., & Novak, M. (2014). Detailed proofs for “The time scale of evolutionary innovation.” Public Library of Science. 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, K., Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Polynomial-time algorithms for energy games with special weight structures. Algorithmica. Springer. 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, K., Chmelik, M., & Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. 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, K., Henzinger, T. A., Otop, J., & Velner, Y. (2014). Quantitative fair simulation games. IST Austria. 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, K., & Fijalkow, N. (2013). Infinite-state games with finitary conditions. In 22nd EACSL Annual Conference on Computer Science Logic (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.181
[Published Version] View | Files available | DOI
 
[177]
2013 | Conference Paper | IST-REx-ID: 2238
Chatterjee, K., Forejt, V., & Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_17
View | DOI
 
[176]
2013 | Conference (Editor) | IST-REx-ID: 2292
Chatterjee, K., & Sgall, J. (Eds.). (2013). Mathematical Foundations of Computer Science 2013 (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical Foundations of Computer Science, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40313-2
View | DOI
 
[175]
2013 | Journal Article | IST-REx-ID: 2299 | OA
Godhal, Y., Chatterjee, K., & Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. Springer. 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, K., Gaiser, A., & Kretinsky, J. (2013). Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. 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, K., & Ła̧Cki, J. (2013). Faster algorithms for Markov decision processes with low treewidth. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. 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, K., Alfaro, L., & Majumdar, R. (2013). The complexity of coverage. International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S0129054113400066
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[171]
2013 | Journal Article | IST-REx-ID: 2817 | OA
Novak, S., Chatterjee, K., & Nowak, M. (2013). Density games. Journal of Theoretical Biology. Elsevier. 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, K., & Prabhu, V. (2013). Quantitative timed simulation functions and refinement metrics for real-time systems. In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control (Vol. 1, pp. 273–282). Philadelphia, PA USA: Springer. https://doi.org/10.1145/2461328.2461370
[Preprint] View | DOI | Download Preprint (ext.)
 
[169]
2013 | Journal Article | IST-REx-ID: 2824
Chatterjee, K., & Prabhu, V. (2013). Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2013.04.003
View | DOI
 
[168]
2013 | Journal Article | IST-REx-ID: 2836 | OA
Chatterjee, K., & Raman, V. (2013). Assume-guarantee synthesis for digital contract signing. Formal Aspects of Computing. Springer. 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, K., De Alfaro, L., & Henzinger, T. A. (2013). Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. Elsevier. 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, K., De Alfaro, L., Faella, M., Majumdar, R., & Raman, V. (2013). Code aware resource management. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-012-0170-4
View | DOI
 
[165]
2013 | Journal Article | IST-REx-ID: 2831 | OA
Chatterjee, K., Henzinger, M. H., Joglekar, M., & Shah, N. (2013). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods in System Design. Springer. 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, K., Doyen, L., Randour, M., & Raskin, J. (2013). Looking at mean-payoff and total-payoff through windows. Presented at the ATVA: Automated Technology for Verification and Analysis, Hanoi, Vietnam: Springer. 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, J., Bozic, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for Tumor Progression. IST Austria. 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, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., & Ibsen-Jensen, R. (2013). Qualitative analysis of concurrent mean-payoff games. IST Austria. 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, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with ω-regular objectives. IST Austria. 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, K., & Ibsen-Jensen, R. (2013). The complexity of ergodic games. IST Austria. 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, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2013). Perfect-information stochastic mean-payoff parity games. IST Austria. 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, K., Ibsen-Jensen, R., & Majumdar, R. (2013). Edit distance for timed automata. IST Austria. 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, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In 13th International Conference on Formal Methods in Computer-Aided Design (pp. 18–25). Portland, OR, United States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679386
View | Files available | DOI
 
[155]
2013 | Technical Report | IST-REx-ID: 5406 | OA
Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013). Distributed synthesis for LTL Fragments. IST Austria. 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, K., Doyen, L., Nain, S., & Vardi, M. (2013). The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria. 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, U., Chatterjee, K., & Gulwani, S. (2013). Automatic generation of alternative starting positions for traditional board games. IST Austria. 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, K., & Velner, Y. (2013). Hyperplane separation technique for multidimensional mean-payoff games. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentinia: Springer. 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, B., Reiter, J., Chatterjee, K., & Nowak, M. (2013). Forgiver triumphs in alternating prisoner’s dilemma . Public Library of Science. https://doi.org/10.1371/journal.pone.0080814.s001
[Published Version] View | Files available | DOI
 
[150]
2013 | Conference Paper | IST-REx-ID: 10902
Chatterjee, K., Chaubal, S., & Rubin, S. (2013). How to travel between languages. In 7th International Conference on Language and Automata Theory and Applications (Vol. 7810, pp. 214–225). Berlin, Heidelberg: Springer Nature. https://doi.org/10.1007/978-3-642-37064-9_20
View | DOI
 
[149]
2013 | Journal Article | IST-REx-ID: 2247 | OA
Zagorsky, B., Reiter, J., Chatterjee, K., & Nowak, M. (2013). Forgiver triumphs in alternating prisoner’s dilemma . PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0080814
[Published Version] View | Files available | DOI
 
[148]
2013 | Journal Article | IST-REx-ID: 2858 | OA
Reiter, J., Božić, I., Allen, B., Chatterjee, K., & Nowak, M. (2013). The effect of one additional driver mutation on tumor progression. Evolutionary Applications. Wiley-Blackwell. https://doi.org/10.1111/eva.12020
[Published Version] View | Files available | DOI
 
[147]
2013 | Journal Article | IST-REx-ID: 2816 | OA
Božić, I., Reiter, J., Allen, B., Antal, T., Chatterjee, K., Shah, P., … Nowak, M. (2013). Evolutionary dynamics of cancer in response to targeted combination therapy. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.00747
[Published Version] View | Files available | DOI
 
[146]
2013 | Conference Paper | IST-REx-ID: 2000 | OA
Reiter, J., Božić, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for tumor progression. In Proceedings of 25th Int. Conf. on Computer Aided Verification (Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer. 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, T., Chatterjee, K., Forejt, V., & Kučera, A. (2013). Trading performance for stability in Markov decision processes. In 28th Annual ACM/IEEE Symposium (pp. 331–340). New Orleans, LA, United States: IEEE. 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, K., Kößler, A., & Schmid, U. (2013). Automated analysis of real-time scheduling using graph games. In Proceedings of the 16th International conference on Hybrid systems: Computation and control (pp. 163–172). Philadelphia, PA, United States: ACM. https://doi.org/10.1145/2461328.2461356
View | Files available | DOI
 
[143]
2012 | Conference Paper | IST-REx-ID: 2715 | OA
Chatterjee, K., Joglekar, M., & Shah, N. (2012). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Vol. 18, pp. 461–473). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461
[Published Version] View | Files available | DOI
 
[142]
2012 | Conference Paper | IST-REx-ID: 10904
Chatterjee, K., Randour, M., & Raskin, J.-F. (2012). Strategy synthesis for multi-dimensional quantitative objectives. In M. Koutny & I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory (Vol. 7454, pp. 115–131). Berlin, Heidelberg: Springer. 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, K., Zufferey, D., & Nowak, M. (2012). Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. Elsevier. 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, K., Henzinger, T. A., & Prabhu, V. (2012). Finite automata with time delay blocks. In roceedings of the tenth ACM international conference on Embedded software (pp. 43–52). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380370
[Preprint] View | DOI | Download Preprint (ext.)
 
[139]
2012 | Conference Paper | IST-REx-ID: 2947 | OA
Chatterjee, K., Chmelik, M., & Majumdar, R. (2012). Equivalence of games with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399). Presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India: Springer. 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, B., Chatterjee, K., Kučera, A., & Novotný, P. (2012). Efficient controller synthesis for consumption games with multiple resource types (Vol. 7358, pp. 23–38). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer. 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, K., & Raman, V. (2012). Synthesizing protocols for digital contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. 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, K., & Doyen, L. (2012). Games and Markov decision processes with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic: Springer. 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, K. (2012). The complexity of stochastic Müller games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2011.11.004
View | DOI | Download None (ext.)
 
[134]
2012 | Journal Article | IST-REx-ID: 3314
Chatterjee, K., & Majumdar, R. (2012). Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S0129054112400308
View | DOI
 
[133]
2012 | Journal Article | IST-REx-ID: 3846 | OA
Chatterjee, K., & Henzinger, T. A. (2012). A survey of stochastic ω regular games. Journal of Computer and System Sciences. Elsevier. 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, K., Doyen, L., & Henzinger, T. A. (2012). A survey of partial-observation stochastic parity games. Formal Methods in System Design. Springer. 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, K., & Doyen, L. (2012). Energy parity games. Theoretical Computer Science. Elsevier. 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, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., & Henzinger, M. H. (2012). An O(n2) time algorithm for alternating Büchi games. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1386–1399). Kyoto, Japan: SIAM. 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, K., & Velner, Y. (2012). Mean payoff pushdown games. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.30
View | Files available | DOI
 
[127]
2012 | Technical Report | IST-REx-ID: 5377 | OA
Chatterjee, K., & Velner, Y. (2012). Mean-payoff pushdown games. IST Austria. 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, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations. IST Austria. 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, K., & Doyen, L. (2012). 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. Dubrovnik, Croatia: IEEE. 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, K. (2012). Robustness of structurally equivalent concurrent parity games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia: Springer. 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, K., & Tracol, M. (2012). Decidable problems for probabilistic automata on infinite words. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE. 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, K., Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In Algorithms – ESA 2012 (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer. 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, K., Reiter, J., & Nowak, M. (2012). Evolutionary dynamics of biological auctions. Theoretical Population Biology. Academic Press. 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, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2011). Specification-centered robustness. In 6th IEEE International Symposium on Industrial and Embedded Systems (pp. 176–185). Vasteras, Sweden: IEEE. 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, K., & Majumdar, R. (2011). Minimum attention controller synthesis for omega regular objectives. In U. Fahrenberg & S. Tripakis (Eds.) (Vol. 6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark: Springer. https://doi.org/10.1007/978-3-642-24310-3_11
View | DOI
 
[118]
2011 | Conference Paper | IST-REx-ID: 3351 | OA
Chatterjee, K., Doyen, L., & Singh, R. (2011). On memoryless quantitative objectives. In O. Owe, M. Steffen, & J. A. Telle (Eds.) (Vol. 6914, pp. 148–159). Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer. 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, K., De Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1970398.1970404
View | Files available | DOI
 
[116]
2011 | Conference Paper | IST-REx-ID: 3349 | OA
Chatterjee, K., & Fijalkow, N. (2011). A reduction from parity games to simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. 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, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. 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, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[113]
2011 | Journal Article | IST-REx-ID: 3315 | OA
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games: Complexity and robustness. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., De Alfaro, L., & Pritam, R. (2011). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. ArXiv.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[111]
2011 | Conference Paper | IST-REx-ID: 3342 | OA
Chatterjee, K., Henzinger, M. H., Joglekar, M., & Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. 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, K., & Fijalkow, N. (2011). Finitary languages (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. 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, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, A. (2011). Two views on multiple mean payoff objectives in Markov Decision Processes. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. 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, K., & Prabhu, V. (2011). Synthesis of memory efficient real time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA: Springer. https://doi.org/10.1145/1967701.1967734
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[107]
2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee, K. (2011). Graph games with reachability objectives. In G. Delzanno & I. Potapov (Eds.) (Vol. 6945, pp. 1–1). Presented at the RP: Reachability Problems, Genoa, Italy: Springer. https://doi.org/10.1007/978-3-642-24288-5_1
View | DOI
 
[106]
2011 | Conference Paper | IST-REx-ID: 3343 | OA
Chatterjee, K., & Henzinger, M. H. (2011). Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States: SIAM. 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, P., Chatterjee, K., & Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. https://doi.org/10.1109/CSF.2011.21
[Submitted Version] View | Files available | DOI
 
[104]
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee, K., Henzinger, T. A., & Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, & C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_17
View | DOI
 
[103]
2011 | Technical Report | IST-REx-ID: 5379 | OA
Chatterjee, K., & Henzinger, M. H. (2011). An O(n2) time algorithm for alternating Büchi games. IST Austria. 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, K., & Doyen, L. (2011). Partial-observation stochastic games: How to win when belief fails. IST Austria. 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, K. (2011). Bounded rationality in concurrent parity games. IST Austria. 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, K. (2011). Robustness of structurally equivalent concurrent parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0006
[Published Version] View | Files available | DOI
 
[99]
2011 | Preprint | IST-REx-ID: 3338 | OA
Chatterjee, K. (2011). Bounded rationality in concurrent parity games. arXiv. ArXiv.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[98]
2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33
[Submitted Version] View | Files available | DOI
 
[97]
2011 | Technical Report | IST-REx-ID: 5385 | OA
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria. 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, K., & Tracol, M. (2011). Decidable problems for probabilistic automata on infinite words. IST Austria. 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, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. 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, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland: Springer. 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, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov decision processes. IST Austria. 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, K., & Doyen, L. (2010). The complexity of partial-observation parity games (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. 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, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. 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, K., & Henzinger, T. A. (Eds.). (2010). Formal modeling and analysis of timed systems (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-15297-9
View | Files available | DOI
 
[89]
2010 | Conference Paper | IST-REx-ID: 3866 | OA
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, & P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. 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, K., De Alfaro, L., Majumdar, R., & Raman, V. (2010). Algorithms for game metrics. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., & Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Horn, F., & Löding, C. (2010). Obliging games (Vol. 6269, pp. 284–296). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_20
View | DOI
 
[85]
2010 | Conference Paper | IST-REx-ID: 3851 | OA
Chatterjee, K., & Doyen, L. (2010). Energy parity games (Vol. 6199, pp. 599–610). Presented at the ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France: Springer. 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, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Doyen, L., & Henzinger, T. A. (2010). Quantitative languages. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1805950.1805953
[Submitted Version] View | Files available | DOI
 
[82]
2010 | Conference Paper | IST-REx-ID: 3864 | OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer. 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, K., De Alfaro, L., Raman, V., & Sánchez, C. (2010). Analyzing the impact of change in multi-threaded programs. In D. Rosenblum & G. Taenzer (Eds.) (Vol. 6013, pp. 293–307). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. https://doi.org/10.1007/978-3-642-12029-9_21
View | DOI
 
[80]
2010 | Journal Article | IST-REx-ID: 3863 | OA
Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. Information and Computation. Elsevier. 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, K., Henzinger, T. A., & Piterman, N. (2010). Strategy logic. Information and Computation. Elsevier. 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, K., Doyen, L., & Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria. 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, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. 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, K., & Fijalkow, N. (2010). Topological, automata-theoretic and logical characterization of finitary languages. IST Austria. https://doi.org/10.15479/AT:IST-2010-0002
[Published Version] View | Files available | DOI
 
[74]
2010 | Conference Paper | IST-REx-ID: 3857
Chatterjee, K., & Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer. 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, K., Doyen, L., & Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. 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, K., & Majumdar, R. (2010). Discounting in games across time scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. 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, K., & Henzinger, T. A. (2009). Probabilistic systems with limsup and liminf objectives (Vol. 5489, pp. 32–45). Presented at the ILC: Infinity in Logic and Computation, Springer. 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, K., Doyen, L., & Henzinger, T. A. (2009). Probabilistic weighted automata (Vol. 5710, pp. 244–258). Presented at the CONCUR: Concurrency Theory, Bologna, Italy: Springer. 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, K., Henzinger, T. A., & Horn, F. (2009). Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1614431.1614432
[Submitted Version] View | Files available | DOI
 
[68]
2009 | Journal Article | IST-REx-ID: 3869
Chatterjee, K., De Alfaro, L., Faella, M., & Legay, A. (2009). Qualitative logics and equivalences for probabilistic systems. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-5(2:7)2009
View | DOI
 
[67]
2009 | Conference Paper | IST-REx-ID: 4542 | OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Alternating weighted automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland: Springer. 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, K., Doyen, L., & Henzinger, T. A. (2009). A survey of stochastic games with limsup and liminf objectives (Vol. 5556, pp. 1–15). Presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece: Springer. 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, K., Henzinger, T. A., & Horn, F. (2009). Stochastic games with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia: Springer. https://doi.org/10.1007/978-3-642-03816-7_4
View | DOI
 
[64]
2009 | Conference Paper | IST-REx-ID: 4544 | OA
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2009). Termination criteria for solving concurrent safety and reachability games (pp. 197–206). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/10.1137/1.9781611973068.23
View | Files available | DOI | Download (ext.)
 
[63]
2009 | Conference Paper | IST-REx-ID: 4540
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Expressiveness and closure properties for quantitative languages (pp. 199–208). Presented at the LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.2009.16
View | Files available | DOI
 
[62]
2009 | Conference Paper | IST-REx-ID: 4569 | OA
Bloem, R., Chatterjee, K., Henzinger, T. A., & Jobstmann, B. (2009). Better quality in synthesis through quantitative objectives (Vol. 5643, pp. 140–156). Presented at the CAV: Computer Aided Verification, Grenoble, France: Springer. 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, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T. A. (2009). Alpaga: A tool for solving parity games with imperfect information (Vol. 5505, pp. 58–61). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. 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, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2009). Gist: A solver for probabilistic games. IST Austria. 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, K., Henzinger, T. A., & Horn, F. (2009). Improved lower bounds for request-response and finitary Streett games. IST Austria. 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, K. (2009). Probabilistic automata on infinite words: Decidability and undecidability results. IST Austria. 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, K., Doyen, L., & Henzinger, T. A. (2009). Qualitative analysis of partially-observable Markov decision processes. IST Austria. 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. T., Chatterjee, K., De Alfaro, L., Faella, M., Pye, I., & Raman, V. (2008). Assigning trust to Wikipedia content. Presented at the WikiSym: International Symposium on Wikis, ACM. https://doi.org/10.1145/1822258.1822293
View | DOI
 
[55]
2008 | Conference Paper | IST-REx-ID: 3502
Chatterjee, K., De Alfaro, L., & Pye, I. (2008). Robust content-driven reputation (pp. 33–42). Presented at the AISec: Artificial Intelligence and Security, ACM. https://doi.org/10.1145/1456377.1456387
View | DOI
 
[54]
2008 | Conference Paper | IST-REx-ID: 3504 | OA
Chatterjee, K., De Alfaro, L., Majumdar, R., & Raman, V. (2008). Algorithms for game metrics (Vol. 2, pp. 107–118). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745
[Published Version] View | Files available | DOI
 
[53]
2008 | Conference Paper | IST-REx-ID: 3875
Chatterjee, K., Henzinger, T. A., & Sen, K. (2008). Model-checking omega-regular properties of interval Markov chains (Vol. 4962, pp. 302–317). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-78499-9_22
View | DOI
 
[52]
2008 | Conference Paper | IST-REx-ID: 3873
Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2008). Controller synthesis with budget constraints (Vol. 4981, pp. 72–86). Presented at the HSCC: Hybrid Systems - Computation and Control, Springer. https://doi.org/DOI: 10.1007/978-3-540-78929-1_6
View | DOI
 
[51]
2008 | Conference Paper | IST-REx-ID: 3876
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2008). Timed parity games: complexity and robustness (Vol. 5215, pp. 124–140). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Springer. https://doi.org/10.1007/978-3-540-85778-5_10
View | Files available | DOI
 
[50]
2008 | Conference Paper | IST-REx-ID: 3877
Chatterjee, K., Henzinger, T. A., & Jobstmann, B. (2008). Environment assumptions for synthesis (Vol. 5201, pp. 147–161). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-85361-9_14
View | DOI
 
[49]
2008 | Conference Paper | IST-REx-ID: 3878 | OA
Chatterjee, K., De Alfaro, L., & Majumdar, R. (2008). The complexity of coverage (Vol. 5356, pp. 91–106). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Springer. https://doi.org/10.1007/978-3-540-89330-1_7
View | DOI | Download (ext.)
 
[48]
2008 | Conference Paper | IST-REx-ID: 3874
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2008). Trading infinite memory for uniform randomness in timed games (Vol. 4981, pp. 87–100). Presented at the HSCC: Hybrid Systems - Computation and Control, Springer. https://doi.org/10.1007/978-3-540-78929-1_7
View | DOI
 
[47]
2008 | Conference Paper | IST-REx-ID: 3879
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2008). Quantitative languages (Vol. 5213, pp. 385–400). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/978-3-540-87531-4_28
View | DOI
 
[46]
2008 | Book Chapter | IST-REx-ID: 3872
Chatterjee, K., & Henzinger, T. A. (2008). Value iteration. In 25 Years in Model Checking (Vol. 5000, pp. 107–138). Springer. https://doi.org/10.1007/978-3-540-69850-0_7
View | DOI
 
[45]
2008 | Conference Paper | IST-REx-ID: 3880
Berwanger, D., Chatterjee, K., Doyen, L., Henzinger, T. A., & Raje, S. (2008). Strategy construction for parity games with imperfect information (Vol. 5201, pp. 325–339). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-85361-9
View | Files available | DOI
 
[44]
2008 | Journal Article | IST-REx-ID: 4534
Chatterjee, K., & Henzinger, T. A. (2008). Reduction of stochastic parity to stochastic mean-payoff games. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2007.08.035
View | DOI | Download (ext.)
 
[43]
2008 | Conference Paper | IST-REx-ID: 4546
Chatterjee, K., Ghosal, A., Henzinger, T. A., Iercan, D., Kirsch, C., Pinello, C., & Sangiovanni Vincentelli, A. (2008). Logical reliability of interacting real-time tasks (pp. 909–914). Presented at the DATE: Design, Automation and Test in Europe, IEEE. https://doi.org/10.1145/1403375.1403595
View | DOI | Download (ext.)
 
[42]
2008 | Journal Article | IST-REx-ID: 4548
Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2008). Stochastic limit-average games are in EXPTIME. International Journal of Game Theory. Springer. https://doi.org/10.1007/s00182-007-0110-5
View | DOI | Download (ext.)
 
[41]
2007 | Conference Paper | IST-REx-ID: 3883
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2007). Generalized parity games (Vol. 4423, pp. 153–167). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-71389-0_12
View | DOI
 
[40]
2007 | Journal Article | IST-REx-ID: 3882
Chatterjee, K. (2007). Concurrent games with tail objectives. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2007.07.047
View | DOI
 
[39]
2007 | Conference Paper | IST-REx-ID: 3884
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2007). Strategy logic (Vol. 4703, pp. 59–73). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, L., Chatterjee, K., Faella, M., & Legay, A. (2007). Qualitative logics and equivalences for probabilistic systems (pp. 237–248). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2007.15
View | DOI
 
[37]
2007 | Conference Paper | IST-REx-ID: 3887
Chatterjee, K. (2007). Markov decision processes with multiple long-run average objectives (Vol. 4855, pp. 473–484). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-77050-3_39
View | DOI
 
[36]
2007 | Conference Paper | IST-REx-ID: 3886
Chatterjee, K. (2007). Stochastic Müller games are PSPACE-complete (Vol. 4855, pp. 436–448). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-77050-3_36
View | DOI
 
[35]
2007 | Conference Paper | IST-REx-ID: 3885
Chatterjee, K. (2007). Optimal strategy synthesis in stochastic Müller games (Vol. 4423, pp. 138–152). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-71389-0_11
View | DOI
 
[34]
2007 | Conference Paper | IST-REx-ID: 4537
Chatterjee, K., & Henzinger, T. A. (2007). Assume-guarantee synthesis (Vol. 4424, pp. 261–275). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. https://doi.org/10.1007/978-3-540-71209-1_21
View | DOI
 
[33]
2007 | Journal Article | IST-REx-ID: 4547
Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2007). Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-3(3:4)2007
View | DOI
 
[32]
2007 | Thesis | IST-REx-ID: 4559
Chatterjee, K. (2007). Stochastic ω-Regular Games. University of California, Berkeley.
View | Download (ext.)
 
[31]
2006 | Conference Paper | IST-REx-ID: 3449
Chatterjee, K., Jagadeesan, R., & Pitcher, C. (2006). Games for controls (pp. 70–82). Presented at the CSF: Computer Security Foundations, IEEE. https://doi.org/10.1109/CSFW.2006.14
View | DOI
 
[30]
2006 | Conference Paper | IST-REx-ID: 3499
Chatterjee, K. (2006). Nash equilibrium for upward-closed objectives (Vol. 4207, pp. 271–286). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_18
View | DOI
 
[29]
2006 | Conference Paper | IST-REx-ID: 3500
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2006). Algorithms for Büchi Games. Presented at the GDV: Games in Design and Verification, ACM.
View | Download (ext.)
 
[28]
2006 | Conference Paper | IST-REx-ID: 3890
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2006). The complexity of quantitative concurrent parity games (pp. 678–687). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/10.1145/1109557.1109631
View | DOI
 
[27]
2006 | Conference Paper | IST-REx-ID: 3889
Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2006). Algorithms for omega-regular games with imperfect information (Vol. 4207, pp. 287–302). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_19
View | DOI
 
[26]
2006 | Conference Paper | IST-REx-ID: 3891
Chatterjee, K. (2006). Concurrent games with tail objectives (Vol. 4207, pp. 256–270). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_17
View | DOI
 
[25]
2006 | Conference Paper | IST-REx-ID: 3888
Chatterjee, K., & Henzinger, T. A. (2006). Strategy improvement for stochastic Rabin and Streett games (Vol. 4137, pp. 375–389). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/11817949_25
View | DOI
 
[24]
2006 | Conference Paper | IST-REx-ID: 4539
Chatterjee, K., & Henzinger, T. A. (2006). Finitary winning in omega-regular games (Vol. 3920, pp. 257–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. https://doi.org/10.1007/11691372_17
View | DOI
 
[23]
2006 | Conference Paper | IST-REx-ID: 4538
Chatterjee, K., & Henzinger, T. A. (2006). Strategy improvement and randomized subexponential algorithms for stochastic parity games (Vol. 3884, pp. 512–523). Presented at the STACS: Theoretical Aspects of Computer Science, Springer. https://doi.org/10.1007/11672142_42
View | DOI
 
[22]
2006 | Conference Paper | IST-REx-ID: 4551
Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2006). Markov decision processes with multiple objectives (Vol. 3884, pp. 325–336). Presented at the STACS: Theoretical Aspects of Computer Science, Springer. https://doi.org/10.1007/11672142_26
View | DOI
 
[21]
2006 | Journal Article | IST-REx-ID: 4550
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2006). Games with secure equilibria. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2006.07.032
View | DOI
 
[20]
2006 | Conference Paper | IST-REx-ID: 4549
Chatterjee, K., De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., & Stoelinga, M. (2006). Compositional quantitative reasoning (pp. 179–188). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2006.11
View | DOI
 
[19]
2006 | Conference Paper | IST-REx-ID: 4552
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2006). Strategy improvement for concurrent reachability games (pp. 291–300). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2006.48
View | DOI
 
[18]
2005 | Conference Paper | IST-REx-ID: 3896
Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2005). Complexity of compositional model checking of computation tree logic on simple structures (Vol. 3326, pp. 89–102). Presented at the IWDC: International Workshop on Distributed Computing , Springer. https://doi.org/10.1007/978-3-540-30536-1_13
View | DOI
 
[17]
2005 | Conference Paper | IST-REx-ID: 3893
Chatterjee, K. (2005). Two-player nonzero-sum ω-regular games (Vol. 3653, pp. 413–427). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/11539452_32
View | DOI
 
[16]
2005 | Conference Paper | IST-REx-ID: 3892
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2005). Games with secure equilibria (Vol. 3657, pp. 141–161). Presented at the FMCO: Formal Methods for Components and Objects, Springer. https://doi.org/10.1007/11561163_7
View | DOI
 
[15]
2005 | Conference Paper | IST-REx-ID: 4541
Chatterjee, K., & Henzinger, T. A. (2005). Semiperfect-information games (Vol. 3821, pp. 1–18). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/11590156_1
View | DOI
 
[14]
2005 | Conference Paper | IST-REx-ID: 4553
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2005). The complexity of stochastic Rabin and Streett games (Vol. 3580, pp. 878–890). Presented at the ICALP: Automata, Languages and Programming, Springer. https://doi.org/10.1007/11523468_71
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 4554
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2005). Mean-payoff parity games (pp. 178–187). Presented at the LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.2005.26
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 4560
Chakrabarti, A., Chatterjee, K., Henzinger, T. A., Kupferman, O., & Majumdar, R. (2005). Verifying quantitative properties using bound functions (Vol. 3725, pp. 50–64). Presented at the CHARME: Correct Hardware Design and Verification Methods, Springer. https://doi.org/10.1007/11560548_7
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 4557
Chatterjee, K., Henzinger, T. A., Jhala, R., & Majumdar, R. (2005). Counterexample-guided planning (pp. 104–111). Presented at the UAI: Uncertainty in Artificial Intelligence, AUAI Press.
View | Download (ext.)
 
[10]
2004 | Conference Paper | IST-REx-ID: 3894
Chatterjee, K., Majumdar, R., & Jurdziński, M. (2004). On Nash equilibria in stochastic games (Vol. 3210, pp. 26–40). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/978-3-540-30124-0_6
View | DOI
 
[9]
2004 | Conference Paper | IST-REx-ID: 3895
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2004). Games with secure equilibria (pp. 160–169). Presented at the LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.2004.1319610
View | DOI
 
[8]
2004 | Conference Paper | IST-REx-ID: 4555
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2004). Trading memory for randomness (pp. 206–217). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2004.10051
View | DOI
 
[7]
2004 | Conference Paper | IST-REx-ID: 4558
Chatterjee, K., Jurdziński, M., & Henzinger, T. A. (2004). Quantitative stochastic parity games (pp. 121–130). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
View
 
[6]
2004 | Journal Article | IST-REx-ID: 4556
Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., & Palsberg, J. (2004). Stack size analysis for interrupt-driven programs. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2004.06.001
View | DOI
 
[5]
2003 | Conference Paper | IST-REx-ID: 3897
Chatterjee, K., Jurdziński, M., & Henzinger, T. A. (2003). Simple stochastic parity games (Vol. 2803, pp. 100–113). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/978-3-540-45220-1_11
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3898
Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., & Palsberg, J. (2003). Stack size analysis for interrupt-driven programs (Vol. 2694, pp. 109–126). Presented at the SAS: Static Analysis Symposium, Springer. https://doi.org/10.1007/3-540-44898-5_7
View | DOI
 
[3]
2003 | Journal Article | IST-REx-ID: 3593
Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2003). A branching time temporal framework for quantitative reasoning. Journal of Automated Reasoning. Springer. https://doi.org/10.1023/A:1023217515688
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 3448
Mallick, S., Chatterjee, K., Merchant, A., & Dasgupta, P. (2002). Implementation of shape grammar for plan analysis. Presented at the IT-Built: Information Technology For Built Environment, Elsevier.
View
 
[1]
2001 | Conference Paper | IST-REx-ID: 3447
Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2001). Weighted quantified computation tree logic. Presented at the CIT: Conference on Information Technology, Elsevier.
View
 
Marked Publication(s)

Search

Filter Publications

431 Publications

Mark all

[431]
2024 | Conference Paper | IST-REx-ID: 15006 | OA
Hirvonen, J., Schmid, L., Chatterjee, K., & Schmid, S. (2024). On the convergence time in graphical games: A locality-sensitive approach. In 27th International Conference on Principles of Distributed Systems (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, V., Staab, M., Hilbe, C., Chatterjee, K., & Kleshnina, M. (2024). Efficiency and resilience of cooperation in asymmetric social dilemmas. Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences. 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, J., Joshi, S. S., Tkadlec, J., & Chatterjee, K. (2024). Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. Public Library of Science. 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, K., Meggendorfer, T., Saona Urmeneta, R. J., & Svoboda, J. (2023). Faster algorithm for turn-based stochastic games with bounded treewidth. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 4590–4605). Florence, Italy: Society for Industrial and Applied Mathematics. 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, K., Henzinger, T. A., Lechner, M., & Zikelic, D. (2023). A learner-verifier framework for neural network controllers and certificates of stochastic systems. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13993, pp. 3–25). Paris, France: Springer Nature. 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, J., Tkadlec, J., Kaveh, K., & Chatterjee, K. (2023). Coexistence times in the Moran process with environmental heterogeneity. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. The Royal Society. 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, L., Ekbatani, F., Hilbe, C., & Chatterjee, K. (2023). Quantitative assessment can stabilize indirect reciprocity under imperfect information. Nature Communications. Springer Nature. 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, M., Zikelic, D., Chatterjee, K., Henzinger, T. A., & Rus, D. (2023). Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 14964–14973). Washington, DC, United States: Association for the Advancement of Artificial Intelligence. 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, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2023). Automated tail bound analysis for probabilistic recurrence relations. In Computer Aided Verification (Vol. 13966, pp. 16–39). Paris, France: Springer Nature. 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., Chatterjee, K., Meggendorfer, T., & Zikelic, D. (2023). MDPs as distribution transformers: Affine invariant synthesis for safety objectives. In International Conference on Computer Aided Verification (Vol. 13966, pp. 86–112). Paris, France: Springer Nature. 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, K., Katoen, J. P., Mohr, S., Weininger, M., & Winkler, T. (2023). Stochastic games with lexicographic objectives. Formal Methods in System Design. Springer Nature. 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, C., Chatterjee, K., Meggendorfer, T., & Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In 48th International Symposium on Mathematical Foundations of Computer Science (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, M., Chatterjee, K., Henzinger, T. A., Lechner, M., & Zikelic, D. (2023). Learning provably stabilizing neural controllers for discrete-time stochastic systems. In 21st International Symposium on Automated Technology for Verification and Analysis (Vol. 14215, pp. 357–379). Singapore, Singapore: Springer Nature. https://doi.org/10.1007/978-3-031-45329-8_17
View | DOI
 
[418]
2023 | Journal Article | IST-REx-ID: 14657 | OA
Tkadlec, J., Kaveh, K., Chatterjee, K., & Nowak, M. A. (2023). Evolutionary dynamics of mutants that modify population structure. Journal of the Royal Society, Interface. The Royal Society. 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, M., Hilbe, C., Simsa, S., Chatterjee, K., & Nowak, M. A. (2023). The effect of environmental information on evolution of cooperation in stochastic games. Nature Communications. Springer Nature. 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, M., Chatterjee, K., Maddah-Ali, M. A., Schmid, S., Svoboda, J., & Yeo, M. X. (2023). R2: Boosting liquidity in payment channel networks with online admission control. In 27th International Conference on Financial Cryptography and Data Security (Vol. 13950, pp. 309–325). Bol, Brac, Croatia: Springer Nature. https://doi.org/10.1007/978-3-031-47754-6_18
View | DOI
 
[415]
2023 | Journal Article | IST-REx-ID: 14778 | OA
Chatterjee, K., Kafshdar Goharshady, E., Novotný, P., Zárevúcky, J., & Zikelic, D. (2023). On lexicographic proof rules for probabilistic termination. Formal Aspects of Computing. Association for Computing Machinery. https://doi.org/10.1145/3585391
[Published Version] View | Files available | DOI | arXiv
 
[414]
2023 | Conference Paper | IST-REx-ID: 14830
Zikelic, D., Lechner, M., Henzinger, T. A., & Chatterjee, K. (2023). Learning control policies for stochastic systems with reach-avoid guarantees. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 11926–11935). Washington, DC, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v37i10.26407
[Preprint] View | Files available | DOI | arXiv
 
[413]
2023 | Conference Paper | IST-REx-ID: 15023 | OA
Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., & Henzinger, T. A. (2023). Compositional policy learning in stochastic control systems with formal guarantees. In 37th Conference on Neural Information Processing Systems. New Orleans, LO, United States.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[412]
2022 | Conference Paper | IST-REx-ID: 12102 | OA
Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., & Zikelic, D. (2022). 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). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2022). Complexity of spatial games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11
[Published Version] View | Files available | DOI
 
[410]
2022 | Preprint | IST-REx-ID: 12677 | OA
Chatterjee, K., Mohammadi, M., & Saona Urmeneta, R. J. (n.d.). Repeated prophet inequality with near-optimal bounds. arXiv. 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, J., Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2022). Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. Springer Nature. 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, K., Svoboda, J., Zikelic, D., Pavlogiannis, A., & Tkadlec, J. (2022). Social balance on networks: Local minima and best-edge dynamics. Physical Review E. American Physical Society. 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, L., Hilbe, C., Chatterjee, K., & Nowak, M. (2022). Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology. Public Library of Science. 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, K., Saona Urmeneta, R. J., & Ziliotto, B. (2022). Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences. 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, K., & Doyen, L. (2022). Graph planning with expected finite horizon. Journal of Computer and System Sciences. Elsevier. 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, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2022). Sound and complete certificates for auantitative termination analysis of probabilistic programs. In Proceedings of the 34th International Conference on Computer Aided Verification (Vol. 13371, pp. 55–78). Haifa, Israel: Springer. 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, M., Zikelic, D., Chatterjee, K., & Henzinger, T. A. (2022). 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. 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, D., Lechner, M., Chatterjee, K., & Henzinger, T. A. (n.d.). Learning stabilizing policies in stochastic control systems. arXiv. 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, D., Lechner, M., Henzinger, T. A., & Chatterjee, K. (n.d.). Learning control policies for stochastic systems with reach-avoid guarantees. arXiv. 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, K., Henzinger, M. H., Kale, S. S., & Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In 48th International Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz Zentrum für Informatik. 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, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Quantitative verification on product graphs of small treewidth. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, P., Horák, K., Aradhye, A., Bošanský, B., & Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In 30th International Joint Conference on Artificial Intelligence (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence. 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, S., Chatterjee, K., & Vardi, M. Y. (2021). On satisficing in quantitative games. In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12651, pp. 20–37). Luxembourg City, Luxembourg: Springer Nature. 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, M., Žikelić, Ð., Chatterjee, K., & Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In 35th Conference on Neural Information Processing Systems. Virtual. 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, M., Schmid, U., & Chatterjee, K. (2021). Optimal strategies for selecting coordinators. Discrete Applied Mathematics. Elsevier. 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, M., Streipert, S. S., Filar, J. A., & Chatterjee, K. (2021). Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. Public Library of Science. 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, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2021). Fast and strong amplifiers of natural selection. Nature Communications. Springer Nature. 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, J., Sun, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2021). Quantitative analysis of assertion violations in probabilistic programs. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1171–1186). Online: Association for Computing Machinery. 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, A., Chatterjee, K., Fu, H., Goharshady, A. K., & Mahdavi, M. (2021). Polynomial reachability witnesses via Stellensätze. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 772–787). Online: Association for Computing Machinery. 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, K., Dvorak, W., Henzinger, M. H., & Svozil, A. (2021). Symbolic time and space tradeoffs for probabilistic verification. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. 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, K., & Doyen, L. (2021). Stochastic processes with expected stopping time. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. 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, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., & Toman, V. (2021). Stateless model checking under a reads-value-from equivalence. In 33rd International Conference on Computer-Aided Verification (Vol. 12759, pp. 341–366). Virtual: Springer Nature. 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, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., & Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3485541
[Published Version] View | Files available | DOI | arXiv
 
[386]
2021 | Journal Article | IST-REx-ID: 9293 | OA
Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. Elsevier. 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, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. Springer. 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, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., & Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In 24th International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual: Springer Nature. 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, K., Goharshady, E. K., Novotný, P., & Zikelic, D. (2021). Proving non-termination by program reversal. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1033–1048). Online: Association for Computing Machinery. 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, K., Goharshady, A. K., Novotný, P., & Zikelic, D. (2021). RevTerm. Association for Computing Machinery. 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, L., Shati, P., Hilbe, C., & Chatterjee, K. (2021). The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. Springer Nature. 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, L., Chatterjee, K., Hilbe, C., & Nowak, M. A. (2021). A unified framework of direct and indirect reciprocity. Nature Human Behaviour. Springer Nature. 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, L., Chatterjee, K., & Schmid, S. (2020). 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). Neuchâtel, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Henzinger, T. A., & Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, P., Chatterjee, K., Kretinsky, J., Weininger, M., & Winkler, T. (2020). Approximating values of generalized-reachability stochastic games. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 102–115). Saarbrücken, Germany: Association for Computing Machinery. 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, K., McAvoy, A., Chatterjee, K., & Nowak, M. A. (2020). The Moran process on 2-chromatic graphs. PLOS Computational Biology. Public Library of Science. 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, M., Streipert, S., Filar, J., & Chatterjee, K. (2020). Prioritised learning in snowdrift-type games. Mathematics. MDPI. https://doi.org/10.3390/math8111945
[Published Version] View | Files available | DOI | WoS
 
[373]
2020 | Journal Article | IST-REx-ID: 8788
Pavlogiannis, A., Schaumberger, N., Schmid, U., & Chatterjee, K. (2020). Precedence-aware automated competitive analysis of real-time scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE. https://doi.org/10.1109/TCAD.2020.3012803
View | DOI | WoS
 
[372]
2020 | Conference Paper | IST-REx-ID: 8193
Chatterjee, K., Chmelik, M., Karkhanis, D., Novotný, P., & Royer, A. (2020). Multiple-environment Markov decision processes: Efficient analysis and applications. In Proceedings of the 30th International Conference on Automated Planning and Scheduling (Vol. 30, pp. 48–56). Nancy, France: Association for the Advancement of Artificial Intelligence.
View | Files available
 
[371]
2020 | Conference Paper | IST-REx-ID: 8272 | OA
Chatterjee, K., Katoen, J. P., Weininger, M., & Winkler, T. (2020). Stochastic games with lexicographic reachability-safety objectives. In International Conference on Computer Aided Verification (Vol. 12225, pp. 398–420). Springer Nature. 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, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2020). Limits on amplifiers of natural selection under death-Birth updating. PLoS Computational Biology. Public Library of Science. 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, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2020). Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. Royal Society. 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, P., Fu, H., Chatterjee, K., Deng, Y., & Xu, M. (2020). Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In Proceedings of the ACM on Programming Languages (Vol. 4). ACM. https://doi.org/10.1145/3371093
[Published Version] View | Files available | DOI | arXiv
 
[367]
2020 | Journal Article | IST-REx-ID: 15055 | OA
Brázdil, T., Chatterjee, K., Novotný, P., & Vahala, J. (2020). Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence. 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, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2020). Optimal and perfectly parallel algorithms for on-demand data-flow analysis. In European Symposium on Programming (Vol. 12075, pp. 112–140). Dublin, Ireland: Springer Nature. 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, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K., & Pavlogiannis, A. (2020). Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In Automated Technology for Verification and Analysis (Vol. 12302, pp. 253–270). Hanoi, Vietnam: Springer Nature. 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, K., Fu, H., Goharshady, A. K., & Goharshady, E. K. (2020). Polynomial invariant generation for non-deterministic recursive programs. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 672–687). London, United Kingdom: Association for Computing Machinery. 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, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Henzinger, T. A., & Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6
[Published Version] View | Files available | DOI
 
[360]
2019 | Conference Paper | IST-REx-ID: 5948
Fu, H., & Chatterjee, K. (2019). Termination of nondeterministic probabilistic programs. In International Conference on Verification, Model Checking, and Abstract Interpretation (Vol. 11388, pp. 468–490). Cascais, Portugal: Springer Nature. 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, G., Bloem, R., Chatterjee, K., Henzinger, T. A., Konighofer, B., & Pranger, S. (2019). Run-time optimization for learned controllers through quantitative games. In 31st International Conference on Computer-Aided Verification (Vol. 11561, pp. 630–649). New York, NY, United States: Springer. 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, O. P., Hilbe, C., Chatterjee, K., & Nowak, M. A. (2019). Social dilemmas among unequals. Nature. Springer Nature. 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, P., Brázdil, T., Chatterjee, K., Křetínský, J., Lampert, C., & Toman, V. (2019). Strategy representation by decision trees with linear classifiers. In 16th International Conference on Quantitative Evaluation of Systems (Vol. 11785, pp. 109–128). Glasgow, United Kingdom: Springer Nature. 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, T., Chatterjee, K., Kucera, A., Novotný, P., & Velan, D. (2019). Deciding fast termination for probabilistic VASS with nondeterminism. In International Symposium on Automated Technology for Verification and Analysis (Vol. 11781, pp. 462–478). Taipei, Taiwan: Springer Nature. 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, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2019). Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. Springer Nature. 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, K., Pavlogiannis, A., & Toman, V. (2019). Value-centric dynamic partial order reduction. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications (Vol. 3). Athens, Greece: ACM. 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, K., & Doyen, L. (2019). Graph planning with expected finite horizon. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Vancouver, BC, Canada: IEEE. 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, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (2019). 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). Athens, Greece: ACM. https://doi.org/10.1145/3360555
[Published Version] View | Files available | DOI | arXiv
 
[351]
2019 | Journal Article | IST-REx-ID: 6380 | OA
Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. ACM. https://doi.org/10.1145/3290366
[Published Version] View | Files available | DOI
 
[350]
2019 | Conference Paper | IST-REx-ID: 6056 | OA
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE. 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, K., Goharshady, A. K., & Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319
[Submitted Version] View | Files available | DOI | WoS
 
[348]
2019 | Conference Paper | IST-REx-ID: 6175 | OA
Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. 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, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322
[Submitted Version] View | Files available | DOI | WoS
 
[346]
2019 | Journal Article | IST-REx-ID: 7158 | OA
Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3363525
[Submitted Version] View | Files available | DOI | WoS
 
[345]
2019 | Journal Article | IST-REx-ID: 7014 | OA
Chatterjee, K., Fu, H., & Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. ACM. 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, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2018). Quasipolynomial set-based symbolic algorithms for parity games. In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57, pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k
[Published Version] View | Files available | DOI | arXiv
 
[343]
2018 | Conference Paper | IST-REx-ID: 325 | OA
Agrawal, S., Chatterjee, K., & Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[342]
2018 | Book Chapter | IST-REx-ID: 59
Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.), Handbook of Model Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27
View | DOI
 
[341]
2018 | Book Chapter | IST-REx-ID: 86 | OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer. 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, J., Hilbe, C., Rand, D., Chatterjee, K., & Nowak, M. (2018). Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. Nature Publishing Group. 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, T., Chatterjee, K., Kučera, A., Novotný, P., Velan, D., & Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE. https://doi.org/10.1145/3209108.3209191
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
[338]
2018 | Journal Article | IST-REx-ID: 157 | OA
Hilbe, C., Šimsa, Š., Chatterjee, K., & Nowak, M. (2018). Evolution of cooperation in stochastic games. Nature. Nature Publishing Group. 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, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2018). Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter (pp. 2341–2356). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States: ACM. 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, M., Fu, H., & Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. 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, C., Chatterjee, K., & Nowak, M. (2018). Partners and rivals in direct reciprocity. Nature Human Behaviour. Nature Publishing Group. 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, S., Bartocci, E., Chatterjee, K., Katoen, J. P., & Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. 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, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. 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, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., & Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. 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, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). 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, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. 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, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. 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, K., Chemlík, M., & Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[327]
2018 | Conference Paper | IST-REx-ID: 35 | OA
Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.
View | Files available | Download None (ext.) | WoS | arXiv
 
[326]
2018 | Journal Article | IST-REx-ID: 738 | OA
Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. Springer. 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, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Language acquisition with communication between learners. Journal of the Royal Society Interface. The Royal Society. 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, A., Tkadlec, J., Chatterjee, K., & Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. Springer Nature. 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, K., Goharshady, A. K., Ibsen-Jensen, R., & Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Goharshady, A. K., & Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer. 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, A. K., Behrouz, A., & Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In Proceedings of the IEEE International Conference on Blockchain (pp. 1343–1348). Halifax, Canada: IEEE. 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, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). 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, K., Fu, H., Goharshady, A. K., & Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI. 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, C., Schmid, L., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Indirect reciprocity with private, noisy, and incomplete information. PNAS. National Academy of Sciences. 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, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM. 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, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic. 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, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports. Nature Publishing Group. 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, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158118
[Published Version] View | Files available | DOI | arXiv
 
[311]
2017 | Technical Report | IST-REx-ID: 5455 | OA
Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria. 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, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. 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, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. IST Austria. 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, K., Ibsen-Jensen, R., & Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Henzinger, M. H., & Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Doyen, L., & Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, & R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460, pp. 367–381). Springer. 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, K., Fu, H., & Murhekar, A. (2017). Automated recurrence analysis for almost linear expected runtime bounds. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 118–139). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. 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, P., Chatterjee, K., Daca, P., Kretinsky, J., & Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. 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, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik. 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, A., Zhang, M., Reiter, J., Božić, I., Allen, B., Kundu, D., … Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. Nature Publishing Group. 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, C., Martinez, V., Chatterjee, K., & Nowak, M. (2017). Memory-n strategies of direct reciprocity. PNAS. National Academy of Sciences. 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, K., Doyen, L., Filiot, E., & Raskin, J. (2017). Doomsday equilibria for omega-regular games. Information and Computation. Elsevier. 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, K., & Piterman, N. (2017). Obligation blackwell games and p-automata. Journal of Symbolic Logic. Cambridge University Press. 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, K., Henzinger, T. A., & Otop, J. (2017). Bidirectional nested weighted automata (Vol. 85). Presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., & Velner, Y. (2017). The complexity of mean-payoff pushdown games. Journal of the ACM. ACM. https://doi.org/10.1145/3121408
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[295]
2017 | Journal Article | IST-REx-ID: 717 | OA
Chatterjee, K., & Velner, Y. (2017). Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. Academic Press. 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, K., & Ehlers, R. (2017). Special issue: Synthesis and SYNT 2014. Acta Informatica. Springer. https://doi.org/10.1007/s00236-017-0299-0
View | DOI
 
[293]
2017 | Journal Article | IST-REx-ID: 1407 | OA
Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier. 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, T., Chatterjee, K., Forejt, V., & Kučera, A. (2017). Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. Elsevier. 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, J., Makohon Moore, A., Gerold, J., Božić, I., Chatterjee, K., Iacobuzio Donahue, C., … Nowak, M. (2017). Reconstructing metastatic seeding patterns of human cancers. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms14114
[Published Version] View | Files available | DOI | WoS
 
[290]
2017 | Journal Article | IST-REx-ID: 1065 | OA
Chatterjee, K., & Osang, G. F. (2017). Pushdown reachability with constant treewidth. Information Processing Letters. Elsevier. 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, K., Henzinger, T. A., Otop, J., & Velner, Y. (2017). Quantitative fair simulation games. Information and Computation. Elsevier. 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, K., Kragl, B., Mishra, S., & Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer. 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, K., Novotný, P., Pérez, G., Raskin, J., & Zikelic, D. (2017). Optimizing expectation with guarantees in POMDPs. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3725–3732). San Francisco, CA, United States: AAAI Press.
[Submitted Version] View | Download Submitted Version (ext.) | WoS
 
[286]
2017 | Journal Article | IST-REx-ID: 744 | OA
Priklopil, T., Chatterjee, K., & Nowak, M. (2017). Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. Elsevier. 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, K., Novotný, P., & Zikelic, D. (2017). Stochastic invariants for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles of Programming Languages, Paris, France: ACM. 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, A., Tkadlec, J., Chatterjee, K., & Nowak , M. (2017). Strong amplifiers of natural selection. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:51
[Published Version] View | Files available | DOI
 
[283]
2017 | Conference Paper | IST-REx-ID: 639 | OA
Chatterjee, K., Fu, H., & Goharshady, A. K. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. 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, K., Goharshady, A. K., & Pavlogiannis, A. (2017). JTDec: A tool for tree decompositions in soot. In D. D’Souza (Ed.) (Vol. 10482, pp. 59–66). Presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India: Springer. 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, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2016). Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., & Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. 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, K., Henzinger, T. A., & Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Henzinger, T. A., & Otop, J. (2016). Quantitative automata under probabilistic semantics. In Proceedings of the 31st Annual ACM/IEEE Symposium (pp. 76–85). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2933588
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[277]
2016 | Conference Paper | IST-REx-ID: 1140 | OA
Chatterjee, K., Dvoák, W., Henzinger, M. H., & Loitzenbauer, V. (2016). 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 (pp. 197–206). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2935304
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[276]
2016 | Conference Paper | IST-REx-ID: 1182 | OA
Chatterjee, K., Ibsen-Jensen, R., & Tkadlec, J. (2016). Robust draws in balanced knockout tournaments (Vol. 2016–January, pp. 172–179). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA: AAAI Press.
[Preprint] View | Files available | Download Preprint (ext.)
 
[275]
2016 | Conference Paper | IST-REx-ID: 1245
Pandey, V., & Chatterjee, K. (2016). Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In Proceedings of the ACM Conference on Computer Supported Cooperative Work (Vol. 26, pp. 365–368). San Francisco, CA, USA: ACM. https://doi.org/10.1145/2818052.2869122
View | DOI
 
[274]
2016 | Conference Paper | IST-REx-ID: 1324
Chatterjee, K., & Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling (Vol. 2016–January, pp. 88–96). London, United Kingdom: AAAI Press.
View | Download None (ext.)
 
[273]
2016 | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., & Novotný, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 1465–1466). Singapore: ACM.
[Preprint] View | Download Preprint (ext.)
 
[272]
2016 | Conference Paper | IST-REx-ID: 1335 | OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Quantitative monitor automata (Vol. 9837, pp. 23–38). Presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom: Springer. 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, K., & Ibsen-Jensen, R. (2016). The complexity of deciding legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands: IOS Press. 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, K., & Doyen, L. (2016). Perfect-information stochastic games with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934513
[Preprint] View | DOI | Download Preprint (ext.)
 
[269]
2016 | Journal Article | IST-REx-ID: 1477 | OA
Chatterjee, K., Chmelik, M., & Tracol, M. (2016). What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. Elsevier. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. Elsevier. 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, K., Pavlogiannis, A., & Velner, Y. (2016). Quantitative interprocedural analysis. IST Austria. 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, K., Chmelik, M., & Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.
View | Files available
 
[265]
2016 | Technical Report | IST-REx-ID: 5449 | OA
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Amplification on undirected population structures: Comets beat stars. IST Austria. 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, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria. 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, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Strong amplifiers of natural selection. IST Austria. 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, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs (Vol. 57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. 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, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. 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, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria. 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, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. 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, K., Fu, H., & Goharshady, A. K. (2016). Termination analysis of probabilistic programs through Positivstellensatz’s (Vol. 9779, pp. 3–22). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. 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, K., & Ibsen-Jensen, R. (2015). 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 (Vol. 2015, pp. 1018–1029). San Diego, CA, United States: SIAM. https://doi.org/10.1137/1.9781611973730.69
[Preprint] View | DOI | arXiv
 
[256]
2015 | Journal Article | IST-REx-ID: 1559 | OA
Ibsen-Jensen, R., Chatterjee, K., & Nowak, M. (2015). Computational complexity of ecological and evolutionary spatial dynamics. PNAS. National Academy of Sciences. 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, K., Doyen, L., & Vardi, M. (2015). The complexity of synthesis from probabilistic components. In 42nd International Colloquium (Vol. 9135, pp. 108–120). Kyoto, Japan: Springer Nature. 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, A., Chatterjee, K., Adlam, B., & Nowak, M. (2015). Cellular cooperation with shift updating and repulsion. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/srep17147
[Published Version] View | Files available | DOI
 
[253]
2015 | Journal Article | IST-REx-ID: 1673 | OA
Adlam, B., Chatterjee, K., & Nowak, M. (2015). Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London. 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., Chmelik, M., Leahy, K., Eniser, H., Chatterjee, K., Cěrná, I., & Belta, C. (2015). 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 (pp. 233–238). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728617
View | DOI
 
[251]
2015 | Journal Article | IST-REx-ID: 1694
Chatterjee, K., & Prabhu, V. (2015). Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. IEEE. https://doi.org/10.1109/TAC.2015.2404612
View | DOI
 
[250]
2015 | Journal Article | IST-REx-ID: 1698 | OA
Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., & Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. Information and Computation. Elsevier. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Optimal cost almost-sure reachability in POMDPs. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3496–3502). Austin, TX, USA: AAAI Press.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[248]
2015 | Conference Paper | IST-REx-ID: 1838 | OA
Bloem, R., Chatterjee, K., Jacobs, S., & Könighofer, R. (2015). Assume-guarantee synthesis for concurrent reactive programs with partial information (Vol. 9035, pp. 517–532). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. 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, T., Chatterjee, K., Forejt, V., & Kučera, A. (2015). Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. 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, K., & Chmelik, M. (2015). POMDPs under probabilistic semantics. Artificial Intelligence. Elsevier. 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., Chatterjee, K., & Sznajder, N. (2015). Probabilistic opacity for Markov decision processes. Information Processing Letters. Elsevier. 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, K., Joglekar, M., & Shah, N. (2015). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. Elsevier. 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, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2015). Randomness for free. Information and Computation. Elsevier. 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, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. ACM. https://doi.org/10.1145/2699430
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[241]
2015 | Conference Paper | IST-REx-ID: 1661 | OA
Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE. 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, K., Doyen, L., Randour, M., & Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. Information and Computation. Elsevier. 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, K., & Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. Information and Computation. Elsevier. 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, U., Chatterjee, K., & Gulwani, S. (2015). Automatic generation of alternative starting positions for simple traditional board games. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 2, pp. 745–752). Austin, TX, USA: AAAI Press.
View | Files available | Download None (ext.)
 
[237]
2015 | Conference Paper | IST-REx-ID: 1732 | OA
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE. 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, K., Ibsen-Jensen, R., & Hansen, K. (2015). The patience of concurrent stochastic games with safety and reachability objectives. IST Austria. 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, K., Komárková, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.32
View | Files available | DOI
 
[234]
2015 | Conference Paper | IST-REx-ID: 1656
Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.72
View | Files available | DOI | arXiv
 
[233]
2015 | Technical Report | IST-REx-ID: 5429 | OA
Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. 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, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. 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, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. IST Austria. 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, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. In 42nd International Colloquium (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature. 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, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria. 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, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria. 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, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. IST Austria. 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, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria. 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, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria. 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, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue, C., … Nowak, M. (2015). Reconstructing robust phylogenies of metastatic cancers. IST Austria. 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, K., Chmelik, M., & Davies, J. (2015). A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria. 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, J., Kanodia, A., Gupta, R., Nowak, M., & Chatterjee, K. (2015). Biological auctions with multiple rewards. Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society. 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, K., Chmelik, M., & Daca, P. (2015). CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. Springer. 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, K., Ibsen-Jensen, R., Pavlogiannis, A., & Goyal, P. (2015). Faster algorithms for algebraic path properties in recursive state machines with constant treewidth. ACM SIGPLAN Notices. Mumbai, India: ACM. 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, K., Pavlogiannis, A., & Velner, Y. (2015). Quantitative interprocedural analysis. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . Mumbai, India: ACM. https://doi.org/10.1145/2676726.2676968
View | Files available | DOI
 
[218]
2015 | Conference Paper | IST-REx-ID: 1607 | OA
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs (Vol. 9206, pp. 140–157). Presented at the CAV: Computer Aided Verification, San Francisco, CA, USA: Springer. 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, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2015). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In Real-Time Systems Symposium (Vol. 2015, pp. 118–127). Rome, Italy: IEEE. https://doi.org/10.1109/RTSS.2014.9
View | Files available | DOI
 
[216]
2015 | Technical Report | IST-REx-ID: 5441 | OA
Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria. 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., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2015). 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 (pp. 259–268). Seattle, WA, United States: ACM. 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, T., & Chatterjee, K. (2015). Evolution of decisions in population games with sequentially searching individuals. Games. MDPI. https://doi.org/10.3390/g6040413
[Published Version] View | Files available | DOI
 
[213]
2015 | Conference Paper | IST-REx-ID: 1603 | OA
Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., & Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. 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, K., Henzinger, M. H., Krinninger, S., Loitzenbauer, V., & Raskin, M. (2014). Approximating the minimum cycle mean. Theoretical Computer Science. Elsevier. 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, S., Tripakis, S., Seshia, S., & Chatterjee, K. (2014). Game theoretic secure localization in wireless sensor networks (pp. 85–90). Presented at the IOT: Internet of Things, Cambridge, USA: IEEE. https://doi.org/10.1109/IOT.2014.7030120
View | DOI
 
[210]
2014 | Conference Paper | IST-REx-ID: 2027 | OA
Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez & J.-F. Raskin (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 98–114). Sydney, Australia: Society of Industrial and Applied Mathematics. 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, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B., … Könighofer, R. (2014). Synthesizing robust systems. Acta Informatica. Springer. 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, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, A. (2014). Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., Randour, M., & Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. Springer. 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, K., & Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. ACM. 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, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_37
View | Files available | DOI
 
[204]
2014 | Conference Paper | IST-REx-ID: 1903
Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer. 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, K., & Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). ACM. 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, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2629686
[Submitted Version] View | Files available | DOI
 
[201]
2014 | Conference Paper | IST-REx-ID: 2162 | OA
Chatterjee, K., & Ibsen-Jensen, R. (2014). The complexity of ergodic mean payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer. 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, K., Doyen, L., Nain, S., & Vardi, M. (2014). The complexity of partial-observation stochastic parity games with finite-memory strategies (Vol. 8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. 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, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2014). Perfect-information stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. 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, K., Ibsen-Jensen, R., & Majumdar, R. (2014). Edit distance for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany: Springer. 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, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. 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, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. 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, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. 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, K., & Doyen, L. (2014). Games with a weak adversary. In Lecture Notes in Computer Science (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer. 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, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria. 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, K., & Doyen, L. (2014). Games with a weak adversary. IST Austria. 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, K., & Ibsen-Jensen, R. (2014). The value 1 problem for concurrent mean-payoff games. IST Austria. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. 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, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. 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, K., Kössler, A., Pavlogiannis, A., & Schmid, U. (2014). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria. 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, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria. 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, K., Henzinger, T. A., & Otop, J. (2014). Nested weighted automata. IST Austria. 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, K., Ibsen-Jensen, R., & Nowak, M. (2014). The complexity of evolution on graphs. IST Austria. 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, K., Doyen, L., Filiot, E., & Raskin, J.-F. (2014). Doomsday equilibria for omega-regular games. In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 78–97). San Diego, CA, United States: Springer Nature. 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, K., Pavlogiannis, A., Adlam, B., & Nowak, M. (2014). The time scale of evolutionary innovation. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1003818
[Published Version] View | Files available | DOI
 
[182]
2014 | Research Data Reference | IST-REx-ID: 9739
Chatterjee, K., Pavlogiannis, A., Adlam, B., & Novak, M. (2014). Detailed proofs for “The time scale of evolutionary innovation.” Public Library of Science. 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, K., Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Polynomial-time algorithms for energy games with special weight structures. Algorithmica. Springer. 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, K., Chmelik, M., & Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. 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, K., Henzinger, T. A., Otop, J., & Velner, Y. (2014). Quantitative fair simulation games. IST Austria. 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, K., & Fijalkow, N. (2013). Infinite-state games with finitary conditions. In 22nd EACSL Annual Conference on Computer Science Logic (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.181
[Published Version] View | Files available | DOI
 
[177]
2013 | Conference Paper | IST-REx-ID: 2238
Chatterjee, K., Forejt, V., & Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_17
View | DOI
 
[176]
2013 | Conference (Editor) | IST-REx-ID: 2292
Chatterjee, K., & Sgall, J. (Eds.). (2013). Mathematical Foundations of Computer Science 2013 (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical Foundations of Computer Science, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40313-2
View | DOI
 
[175]
2013 | Journal Article | IST-REx-ID: 2299 | OA
Godhal, Y., Chatterjee, K., & Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. Springer. 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, K., Gaiser, A., & Kretinsky, J. (2013). Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. 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, K., & Ła̧Cki, J. (2013). Faster algorithms for Markov decision processes with low treewidth. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. 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, K., Alfaro, L., & Majumdar, R. (2013). The complexity of coverage. International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S0129054113400066
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[171]
2013 | Journal Article | IST-REx-ID: 2817 | OA
Novak, S., Chatterjee, K., & Nowak, M. (2013). Density games. Journal of Theoretical Biology. Elsevier. 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, K., & Prabhu, V. (2013). Quantitative timed simulation functions and refinement metrics for real-time systems. In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control (Vol. 1, pp. 273–282). Philadelphia, PA USA: Springer. https://doi.org/10.1145/2461328.2461370
[Preprint] View | DOI | Download Preprint (ext.)
 
[169]
2013 | Journal Article | IST-REx-ID: 2824
Chatterjee, K., & Prabhu, V. (2013). Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2013.04.003
View | DOI
 
[168]
2013 | Journal Article | IST-REx-ID: 2836 | OA
Chatterjee, K., & Raman, V. (2013). Assume-guarantee synthesis for digital contract signing. Formal Aspects of Computing. Springer. 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, K., De Alfaro, L., & Henzinger, T. A. (2013). Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. Elsevier. 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, K., De Alfaro, L., Faella, M., Majumdar, R., & Raman, V. (2013). Code aware resource management. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-012-0170-4
View | DOI
 
[165]
2013 | Journal Article | IST-REx-ID: 2831 | OA
Chatterjee, K., Henzinger, M. H., Joglekar, M., & Shah, N. (2013). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods in System Design. Springer. 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, K., Doyen, L., Randour, M., & Raskin, J. (2013). Looking at mean-payoff and total-payoff through windows. Presented at the ATVA: Automated Technology for Verification and Analysis, Hanoi, Vietnam: Springer. 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, J., Bozic, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for Tumor Progression. IST Austria. 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, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., & Ibsen-Jensen, R. (2013). Qualitative analysis of concurrent mean-payoff games. IST Austria. 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, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with ω-regular objectives. IST Austria. 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, K., & Ibsen-Jensen, R. (2013). The complexity of ergodic games. IST Austria. 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, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2013). Perfect-information stochastic mean-payoff parity games. IST Austria. 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, K., Ibsen-Jensen, R., & Majumdar, R. (2013). Edit distance for timed automata. IST Austria. 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, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In 13th International Conference on Formal Methods in Computer-Aided Design (pp. 18–25). Portland, OR, United States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679386
View | Files available | DOI
 
[155]
2013 | Technical Report | IST-REx-ID: 5406 | OA
Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013). Distributed synthesis for LTL Fragments. IST Austria. 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, K., Doyen, L., Nain, S., & Vardi, M. (2013). The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria. 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, U., Chatterjee, K., & Gulwani, S. (2013). Automatic generation of alternative starting positions for traditional board games. IST Austria. 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, K., & Velner, Y. (2013). Hyperplane separation technique for multidimensional mean-payoff games. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentinia: Springer. 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, B., Reiter, J., Chatterjee, K., & Nowak, M. (2013). Forgiver triumphs in alternating prisoner’s dilemma . Public Library of Science. https://doi.org/10.1371/journal.pone.0080814.s001
[Published Version] View | Files available | DOI
 
[150]
2013 | Conference Paper | IST-REx-ID: 10902
Chatterjee, K., Chaubal, S., & Rubin, S. (2013). How to travel between languages. In 7th International Conference on Language and Automata Theory and Applications (Vol. 7810, pp. 214–225). Berlin, Heidelberg: Springer Nature. https://doi.org/10.1007/978-3-642-37064-9_20
View | DOI
 
[149]
2013 | Journal Article | IST-REx-ID: 2247 | OA
Zagorsky, B., Reiter, J., Chatterjee, K., & Nowak, M. (2013). Forgiver triumphs in alternating prisoner’s dilemma . PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0080814
[Published Version] View | Files available | DOI
 
[148]
2013 | Journal Article | IST-REx-ID: 2858 | OA
Reiter, J., Božić, I., Allen, B., Chatterjee, K., & Nowak, M. (2013). The effect of one additional driver mutation on tumor progression. Evolutionary Applications. Wiley-Blackwell. https://doi.org/10.1111/eva.12020
[Published Version] View | Files available | DOI
 
[147]
2013 | Journal Article | IST-REx-ID: 2816 | OA
Božić, I., Reiter, J., Allen, B., Antal, T., Chatterjee, K., Shah, P., … Nowak, M. (2013). Evolutionary dynamics of cancer in response to targeted combination therapy. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.00747
[Published Version] View | Files available | DOI
 
[146]
2013 | Conference Paper | IST-REx-ID: 2000 | OA
Reiter, J., Božić, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for tumor progression. In Proceedings of 25th Int. Conf. on Computer Aided Verification (Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer. 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, T., Chatterjee, K., Forejt, V., & Kučera, A. (2013). Trading performance for stability in Markov decision processes. In 28th Annual ACM/IEEE Symposium (pp. 331–340). New Orleans, LA, United States: IEEE. 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, K., Kößler, A., & Schmid, U. (2013). Automated analysis of real-time scheduling using graph games. In Proceedings of the 16th International conference on Hybrid systems: Computation and control (pp. 163–172). Philadelphia, PA, United States: ACM. https://doi.org/10.1145/2461328.2461356
View | Files available | DOI
 
[143]
2012 | Conference Paper | IST-REx-ID: 2715 | OA
Chatterjee, K., Joglekar, M., & Shah, N. (2012). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Vol. 18, pp. 461–473). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461
[Published Version] View | Files available | DOI
 
[142]
2012 | Conference Paper | IST-REx-ID: 10904
Chatterjee, K., Randour, M., & Raskin, J.-F. (2012). Strategy synthesis for multi-dimensional quantitative objectives. In M. Koutny & I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory (Vol. 7454, pp. 115–131). Berlin, Heidelberg: Springer. 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, K., Zufferey, D., & Nowak, M. (2012). Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. Elsevier. 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, K., Henzinger, T. A., & Prabhu, V. (2012). Finite automata with time delay blocks. In roceedings of the tenth ACM international conference on Embedded software (pp. 43–52). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380370
[Preprint] View | DOI | Download Preprint (ext.)
 
[139]
2012 | Conference Paper | IST-REx-ID: 2947 | OA
Chatterjee, K., Chmelik, M., & Majumdar, R. (2012). Equivalence of games with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399). Presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India: Springer. 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, B., Chatterjee, K., Kučera, A., & Novotný, P. (2012). Efficient controller synthesis for consumption games with multiple resource types (Vol. 7358, pp. 23–38). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer. 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, K., & Raman, V. (2012). Synthesizing protocols for digital contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. 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, K., & Doyen, L. (2012). Games and Markov decision processes with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic: Springer. 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, K. (2012). The complexity of stochastic Müller games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2011.11.004
View | DOI | Download None (ext.)
 
[134]
2012 | Journal Article | IST-REx-ID: 3314
Chatterjee, K., & Majumdar, R. (2012). Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S0129054112400308
View | DOI
 
[133]
2012 | Journal Article | IST-REx-ID: 3846 | OA
Chatterjee, K., & Henzinger, T. A. (2012). A survey of stochastic ω regular games. Journal of Computer and System Sciences. Elsevier. 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, K., Doyen, L., & Henzinger, T. A. (2012). A survey of partial-observation stochastic parity games. Formal Methods in System Design. Springer. 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, K., & Doyen, L. (2012). Energy parity games. Theoretical Computer Science. Elsevier. 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, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., & Henzinger, M. H. (2012). An O(n2) time algorithm for alternating Büchi games. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1386–1399). Kyoto, Japan: SIAM. 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, K., & Velner, Y. (2012). Mean payoff pushdown games. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.30
View | Files available | DOI
 
[127]
2012 | Technical Report | IST-REx-ID: 5377 | OA
Chatterjee, K., & Velner, Y. (2012). Mean-payoff pushdown games. IST Austria. 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, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations. IST Austria. 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, K., & Doyen, L. (2012). 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. Dubrovnik, Croatia: IEEE. 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, K. (2012). Robustness of structurally equivalent concurrent parity games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia: Springer. 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, K., & Tracol, M. (2012). Decidable problems for probabilistic automata on infinite words. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE. 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, K., Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In Algorithms – ESA 2012 (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer. 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, K., Reiter, J., & Nowak, M. (2012). Evolutionary dynamics of biological auctions. Theoretical Population Biology. Academic Press. 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, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2011). Specification-centered robustness. In 6th IEEE International Symposium on Industrial and Embedded Systems (pp. 176–185). Vasteras, Sweden: IEEE. 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, K., & Majumdar, R. (2011). Minimum attention controller synthesis for omega regular objectives. In U. Fahrenberg & S. Tripakis (Eds.) (Vol. 6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark: Springer. https://doi.org/10.1007/978-3-642-24310-3_11
View | DOI
 
[118]
2011 | Conference Paper | IST-REx-ID: 3351 | OA
Chatterjee, K., Doyen, L., & Singh, R. (2011). On memoryless quantitative objectives. In O. Owe, M. Steffen, & J. A. Telle (Eds.) (Vol. 6914, pp. 148–159). Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer. 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, K., De Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1970398.1970404
View | Files available | DOI
 
[116]
2011 | Conference Paper | IST-REx-ID: 3349 | OA
Chatterjee, K., & Fijalkow, N. (2011). A reduction from parity games to simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. 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, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. 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, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[113]
2011 | Journal Article | IST-REx-ID: 3315 | OA
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games: Complexity and robustness. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., De Alfaro, L., & Pritam, R. (2011). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. ArXiv.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[111]
2011 | Conference Paper | IST-REx-ID: 3342 | OA
Chatterjee, K., Henzinger, M. H., Joglekar, M., & Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. 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, K., & Fijalkow, N. (2011). Finitary languages (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. 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, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, A. (2011). Two views on multiple mean payoff objectives in Markov Decision Processes. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. 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, K., & Prabhu, V. (2011). Synthesis of memory efficient real time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA: Springer. https://doi.org/10.1145/1967701.1967734
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[107]
2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee, K. (2011). Graph games with reachability objectives. In G. Delzanno & I. Potapov (Eds.) (Vol. 6945, pp. 1–1). Presented at the RP: Reachability Problems, Genoa, Italy: Springer. https://doi.org/10.1007/978-3-642-24288-5_1
View | DOI
 
[106]
2011 | Conference Paper | IST-REx-ID: 3343 | OA
Chatterjee, K., & Henzinger, M. H. (2011). Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States: SIAM. 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, P., Chatterjee, K., & Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. https://doi.org/10.1109/CSF.2011.21
[Submitted Version] View | Files available | DOI
 
[104]
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee, K., Henzinger, T. A., & Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, & C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_17
View | DOI
 
[103]
2011 | Technical Report | IST-REx-ID: 5379 | OA
Chatterjee, K., & Henzinger, M. H. (2011). An O(n2) time algorithm for alternating Büchi games. IST Austria. 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, K., & Doyen, L. (2011). Partial-observation stochastic games: How to win when belief fails. IST Austria. 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, K. (2011). Bounded rationality in concurrent parity games. IST Austria. 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, K. (2011). Robustness of structurally equivalent concurrent parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0006
[Published Version] View | Files available | DOI
 
[99]
2011 | Preprint | IST-REx-ID: 3338 | OA
Chatterjee, K. (2011). Bounded rationality in concurrent parity games. arXiv. ArXiv.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[98]
2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33
[Submitted Version] View | Files available | DOI
 
[97]
2011 | Technical Report | IST-REx-ID: 5385 | OA
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria. 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, K., & Tracol, M. (2011). Decidable problems for probabilistic automata on infinite words. IST Austria. 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, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. 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, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland: Springer. 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, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov decision processes. IST Austria. 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, K., & Doyen, L. (2010). The complexity of partial-observation parity games (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. 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, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. 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, K., & Henzinger, T. A. (Eds.). (2010). Formal modeling and analysis of timed systems (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-15297-9
View | Files available | DOI
 
[89]
2010 | Conference Paper | IST-REx-ID: 3866 | OA
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, & P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. 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, K., De Alfaro, L., Majumdar, R., & Raman, V. (2010). Algorithms for game metrics. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., & Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Horn, F., & Löding, C. (2010). Obliging games (Vol. 6269, pp. 284–296). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_20
View | DOI
 
[85]
2010 | Conference Paper | IST-REx-ID: 3851 | OA
Chatterjee, K., & Doyen, L. (2010). Energy parity games (Vol. 6199, pp. 599–610). Presented at the ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France: Springer. 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, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, K., Doyen, L., & Henzinger, T. A. (2010). Quantitative languages. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1805950.1805953
[Submitted Version] View | Files available | DOI
 
[82]
2010 | Conference Paper | IST-REx-ID: 3864 | OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer. 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, K., De Alfaro, L., Raman, V., & Sánchez, C. (2010). Analyzing the impact of change in multi-threaded programs. In D. Rosenblum & G. Taenzer (Eds.) (Vol. 6013, pp. 293–307). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. https://doi.org/10.1007/978-3-642-12029-9_21
View | DOI
 
[80]
2010 | Journal Article | IST-REx-ID: 3863 | OA
Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. Information and Computation. Elsevier. 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, K., Henzinger, T. A., & Piterman, N. (2010). Strategy logic. Information and Computation. Elsevier. 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, K., Doyen, L., & Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria. 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, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. 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, K., & Fijalkow, N. (2010). Topological, automata-theoretic and logical characterization of finitary languages. IST Austria. https://doi.org/10.15479/AT:IST-2010-0002
[Published Version] View | Files available | DOI
 
[74]
2010 | Conference Paper | IST-REx-ID: 3857
Chatterjee, K., & Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer. 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, K., Doyen, L., & Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. 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, K., & Majumdar, R. (2010). Discounting in games across time scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. 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, K., & Henzinger, T. A. (2009). Probabilistic systems with limsup and liminf objectives (Vol. 5489, pp. 32–45). Presented at the ILC: Infinity in Logic and Computation, Springer. 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, K., Doyen, L., & Henzinger, T. A. (2009). Probabilistic weighted automata (Vol. 5710, pp. 244–258). Presented at the CONCUR: Concurrency Theory, Bologna, Italy: Springer. 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, K., Henzinger, T. A., & Horn, F. (2009). Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1614431.1614432
[Submitted Version] View | Files available | DOI
 
[68]
2009 | Journal Article | IST-REx-ID: 3869
Chatterjee, K., De Alfaro, L., Faella, M., & Legay, A. (2009). Qualitative logics and equivalences for probabilistic systems. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-5(2:7)2009
View | DOI
 
[67]
2009 | Conference Paper | IST-REx-ID: 4542 | OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Alternating weighted automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland: Springer. 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, K., Doyen, L., & Henzinger, T. A. (2009). A survey of stochastic games with limsup and liminf objectives (Vol. 5556, pp. 1–15). Presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece: Springer. 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, K., Henzinger, T. A., & Horn, F. (2009). Stochastic games with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia: Springer. https://doi.org/10.1007/978-3-642-03816-7_4
View | DOI
 
[64]
2009 | Conference Paper | IST-REx-ID: 4544 | OA
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2009). Termination criteria for solving concurrent safety and reachability games (pp. 197–206). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/10.1137/1.9781611973068.23
View | Files available | DOI | Download (ext.)
 
[63]
2009 | Conference Paper | IST-REx-ID: 4540
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Expressiveness and closure properties for quantitative languages (pp. 199–208). Presented at the LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.2009.16
View | Files available | DOI
 
[62]
2009 | Conference Paper | IST-REx-ID: 4569 | OA
Bloem, R., Chatterjee, K., Henzinger, T. A., & Jobstmann, B. (2009). Better quality in synthesis through quantitative objectives (Vol. 5643, pp. 140–156). Presented at the CAV: Computer Aided Verification, Grenoble, France: Springer. 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, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T. A. (2009). Alpaga: A tool for solving parity games with imperfect information (Vol. 5505, pp. 58–61). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. 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, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2009). Gist: A solver for probabilistic games. IST Austria. 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, K., Henzinger, T. A., & Horn, F. (2009). Improved lower bounds for request-response and finitary Streett games. IST Austria. 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, K. (2009). Probabilistic automata on infinite words: Decidability and undecidability results. IST Austria. 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, K., Doyen, L., & Henzinger, T. A. (2009). Qualitative analysis of partially-observable Markov decision processes. IST Austria. 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. T., Chatterjee, K., De Alfaro, L., Faella, M., Pye, I., & Raman, V. (2008). Assigning trust to Wikipedia content. Presented at the WikiSym: International Symposium on Wikis, ACM. https://doi.org/10.1145/1822258.1822293
View | DOI
 
[55]
2008 | Conference Paper | IST-REx-ID: 3502
Chatterjee, K., De Alfaro, L., & Pye, I. (2008). Robust content-driven reputation (pp. 33–42). Presented at the AISec: Artificial Intelligence and Security, ACM. https://doi.org/10.1145/1456377.1456387
View | DOI
 
[54]
2008 | Conference Paper | IST-REx-ID: 3504 | OA
Chatterjee, K., De Alfaro, L., Majumdar, R., & Raman, V. (2008). Algorithms for game metrics (Vol. 2, pp. 107–118). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745
[Published Version] View | Files available | DOI
 
[53]
2008 | Conference Paper | IST-REx-ID: 3875
Chatterjee, K., Henzinger, T. A., & Sen, K. (2008). Model-checking omega-regular properties of interval Markov chains (Vol. 4962, pp. 302–317). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-78499-9_22
View | DOI
 
[52]
2008 | Conference Paper | IST-REx-ID: 3873
Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2008). Controller synthesis with budget constraints (Vol. 4981, pp. 72–86). Presented at the HSCC: Hybrid Systems - Computation and Control, Springer. https://doi.org/DOI: 10.1007/978-3-540-78929-1_6
View | DOI
 
[51]
2008 | Conference Paper | IST-REx-ID: 3876
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2008). Timed parity games: complexity and robustness (Vol. 5215, pp. 124–140). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Springer. https://doi.org/10.1007/978-3-540-85778-5_10
View | Files available | DOI
 
[50]
2008 | Conference Paper | IST-REx-ID: 3877
Chatterjee, K., Henzinger, T. A., & Jobstmann, B. (2008). Environment assumptions for synthesis (Vol. 5201, pp. 147–161). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-85361-9_14
View | DOI
 
[49]
2008 | Conference Paper | IST-REx-ID: 3878 | OA
Chatterjee, K., De Alfaro, L., & Majumdar, R. (2008). The complexity of coverage (Vol. 5356, pp. 91–106). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Springer. https://doi.org/10.1007/978-3-540-89330-1_7
View | DOI | Download (ext.)
 
[48]
2008 | Conference Paper | IST-REx-ID: 3874
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2008). Trading infinite memory for uniform randomness in timed games (Vol. 4981, pp. 87–100). Presented at the HSCC: Hybrid Systems - Computation and Control, Springer. https://doi.org/10.1007/978-3-540-78929-1_7
View | DOI
 
[47]
2008 | Conference Paper | IST-REx-ID: 3879
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2008). Quantitative languages (Vol. 5213, pp. 385–400). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/978-3-540-87531-4_28
View | DOI
 
[46]
2008 | Book Chapter | IST-REx-ID: 3872
Chatterjee, K., & Henzinger, T. A. (2008). Value iteration. In 25 Years in Model Checking (Vol. 5000, pp. 107–138). Springer. https://doi.org/10.1007/978-3-540-69850-0_7
View | DOI
 
[45]
2008 | Conference Paper | IST-REx-ID: 3880
Berwanger, D., Chatterjee, K., Doyen, L., Henzinger, T. A., & Raje, S. (2008). Strategy construction for parity games with imperfect information (Vol. 5201, pp. 325–339). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-85361-9
View | Files available | DOI
 
[44]
2008 | Journal Article | IST-REx-ID: 4534
Chatterjee, K., & Henzinger, T. A. (2008). Reduction of stochastic parity to stochastic mean-payoff games. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2007.08.035
View | DOI | Download (ext.)
 
[43]
2008 | Conference Paper | IST-REx-ID: 4546
Chatterjee, K., Ghosal, A., Henzinger, T. A., Iercan, D., Kirsch, C., Pinello, C., & Sangiovanni Vincentelli, A. (2008). Logical reliability of interacting real-time tasks (pp. 909–914). Presented at the DATE: Design, Automation and Test in Europe, IEEE. https://doi.org/10.1145/1403375.1403595
View | DOI | Download (ext.)
 
[42]
2008 | Journal Article | IST-REx-ID: 4548
Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2008). Stochastic limit-average games are in EXPTIME. International Journal of Game Theory. Springer. https://doi.org/10.1007/s00182-007-0110-5
View | DOI | Download (ext.)
 
[41]
2007 | Conference Paper | IST-REx-ID: 3883
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2007). Generalized parity games (Vol. 4423, pp. 153–167). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-71389-0_12
View | DOI
 
[40]
2007 | Journal Article | IST-REx-ID: 3882
Chatterjee, K. (2007). Concurrent games with tail objectives. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2007.07.047
View | DOI
 
[39]
2007 | Conference Paper | IST-REx-ID: 3884
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2007). Strategy logic (Vol. 4703, pp. 59–73). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, L., Chatterjee, K., Faella, M., & Legay, A. (2007). Qualitative logics and equivalences for probabilistic systems (pp. 237–248). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2007.15
View | DOI
 
[37]
2007 | Conference Paper | IST-REx-ID: 3887
Chatterjee, K. (2007). Markov decision processes with multiple long-run average objectives (Vol. 4855, pp. 473–484). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-77050-3_39
View | DOI
 
[36]
2007 | Conference Paper | IST-REx-ID: 3886
Chatterjee, K. (2007). Stochastic Müller games are PSPACE-complete (Vol. 4855, pp. 436–448). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-77050-3_36
View | DOI
 
[35]
2007 | Conference Paper | IST-REx-ID: 3885
Chatterjee, K. (2007). Optimal strategy synthesis in stochastic Müller games (Vol. 4423, pp. 138–152). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-71389-0_11
View | DOI
 
[34]
2007 | Conference Paper | IST-REx-ID: 4537
Chatterjee, K., & Henzinger, T. A. (2007). Assume-guarantee synthesis (Vol. 4424, pp. 261–275). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. https://doi.org/10.1007/978-3-540-71209-1_21
View | DOI
 
[33]
2007 | Journal Article | IST-REx-ID: 4547
Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2007). Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-3(3:4)2007
View | DOI
 
[32]
2007 | Thesis | IST-REx-ID: 4559
Chatterjee, K. (2007). Stochastic ω-Regular Games. University of California, Berkeley.
View | Download (ext.)
 
[31]
2006 | Conference Paper | IST-REx-ID: 3449
Chatterjee, K., Jagadeesan, R., & Pitcher, C. (2006). Games for controls (pp. 70–82). Presented at the CSF: Computer Security Foundations, IEEE. https://doi.org/10.1109/CSFW.2006.14
View | DOI
 
[30]
2006 | Conference Paper | IST-REx-ID: 3499
Chatterjee, K. (2006). Nash equilibrium for upward-closed objectives (Vol. 4207, pp. 271–286). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_18
View | DOI
 
[29]
2006 | Conference Paper | IST-REx-ID: 3500
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2006). Algorithms for Büchi Games. Presented at the GDV: Games in Design and Verification, ACM.
View | Download (ext.)
 
[28]
2006 | Conference Paper | IST-REx-ID: 3890
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2006). The complexity of quantitative concurrent parity games (pp. 678–687). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/10.1145/1109557.1109631
View | DOI
 
[27]
2006 | Conference Paper | IST-REx-ID: 3889
Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2006). Algorithms for omega-regular games with imperfect information (Vol. 4207, pp. 287–302). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_19
View | DOI
 
[26]
2006 | Conference Paper | IST-REx-ID: 3891
Chatterjee, K. (2006). Concurrent games with tail objectives (Vol. 4207, pp. 256–270). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_17
View | DOI
 
[25]
2006 | Conference Paper | IST-REx-ID: 3888
Chatterjee, K., & Henzinger, T. A. (2006). Strategy improvement for stochastic Rabin and Streett games (Vol. 4137, pp. 375–389). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/11817949_25
View | DOI
 
[24]
2006 | Conference Paper | IST-REx-ID: 4539
Chatterjee, K., & Henzinger, T. A. (2006). Finitary winning in omega-regular games (Vol. 3920, pp. 257–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. https://doi.org/10.1007/11691372_17
View | DOI
 
[23]
2006 | Conference Paper | IST-REx-ID: 4538
Chatterjee, K., & Henzinger, T. A. (2006). Strategy improvement and randomized subexponential algorithms for stochastic parity games (Vol. 3884, pp. 512–523). Presented at the STACS: Theoretical Aspects of Computer Science, Springer. https://doi.org/10.1007/11672142_42
View | DOI
 
[22]
2006 | Conference Paper | IST-REx-ID: 4551
Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2006). Markov decision processes with multiple objectives (Vol. 3884, pp. 325–336). Presented at the STACS: Theoretical Aspects of Computer Science, Springer. https://doi.org/10.1007/11672142_26
View | DOI
 
[21]
2006 | Journal Article | IST-REx-ID: 4550
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2006). Games with secure equilibria. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2006.07.032
View | DOI
 
[20]
2006 | Conference Paper | IST-REx-ID: 4549
Chatterjee, K., De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., & Stoelinga, M. (2006). Compositional quantitative reasoning (pp. 179–188). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2006.11
View | DOI
 
[19]
2006 | Conference Paper | IST-REx-ID: 4552
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2006). Strategy improvement for concurrent reachability games (pp. 291–300). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2006.48
View | DOI
 
[18]
2005 | Conference Paper | IST-REx-ID: 3896
Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2005). Complexity of compositional model checking of computation tree logic on simple structures (Vol. 3326, pp. 89–102). Presented at the IWDC: International Workshop on Distributed Computing , Springer. https://doi.org/10.1007/978-3-540-30536-1_13
View | DOI
 
[17]
2005 | Conference Paper | IST-REx-ID: 3893
Chatterjee, K. (2005). Two-player nonzero-sum ω-regular games (Vol. 3653, pp. 413–427). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/11539452_32
View | DOI
 
[16]
2005 | Conference Paper | IST-REx-ID: 3892
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2005). Games with secure equilibria (Vol. 3657, pp. 141–161). Presented at the FMCO: Formal Methods for Components and Objects, Springer. https://doi.org/10.1007/11561163_7
View | DOI
 
[15]
2005 | Conference Paper | IST-REx-ID: 4541
Chatterjee, K., & Henzinger, T. A. (2005). Semiperfect-information games (Vol. 3821, pp. 1–18). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/11590156_1
View | DOI
 
[14]
2005 | Conference Paper | IST-REx-ID: 4553
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2005). The complexity of stochastic Rabin and Streett games (Vol. 3580, pp. 878–890). Presented at the ICALP: Automata, Languages and Programming, Springer. https://doi.org/10.1007/11523468_71
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 4554
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2005). Mean-payoff parity games (pp. 178–187). Presented at the LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.2005.26
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 4560
Chakrabarti, A., Chatterjee, K., Henzinger, T. A., Kupferman, O., & Majumdar, R. (2005). Verifying quantitative properties using bound functions (Vol. 3725, pp. 50–64). Presented at the CHARME: Correct Hardware Design and Verification Methods, Springer. https://doi.org/10.1007/11560548_7
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 4557
Chatterjee, K., Henzinger, T. A., Jhala, R., & Majumdar, R. (2005). Counterexample-guided planning (pp. 104–111). Presented at the UAI: Uncertainty in Artificial Intelligence, AUAI Press.
View | Download (ext.)
 
[10]
2004 | Conference Paper | IST-REx-ID: 3894
Chatterjee, K., Majumdar, R., & Jurdziński, M. (2004). On Nash equilibria in stochastic games (Vol. 3210, pp. 26–40). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/978-3-540-30124-0_6
View | DOI
 
[9]
2004 | Conference Paper | IST-REx-ID: 3895
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2004). Games with secure equilibria (pp. 160–169). Presented at the LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.2004.1319610
View | DOI
 
[8]
2004 | Conference Paper | IST-REx-ID: 4555
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2004). Trading memory for randomness (pp. 206–217). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2004.10051
View | DOI
 
[7]
2004 | Conference Paper | IST-REx-ID: 4558
Chatterjee, K., Jurdziński, M., & Henzinger, T. A. (2004). Quantitative stochastic parity games (pp. 121–130). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
View
 
[6]
2004 | Journal Article | IST-REx-ID: 4556
Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., & Palsberg, J. (2004). Stack size analysis for interrupt-driven programs. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2004.06.001
View | DOI
 
[5]
2003 | Conference Paper | IST-REx-ID: 3897
Chatterjee, K., Jurdziński, M., & Henzinger, T. A. (2003). Simple stochastic parity games (Vol. 2803, pp. 100–113). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/978-3-540-45220-1_11
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3898
Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., & Palsberg, J. (2003). Stack size analysis for interrupt-driven programs (Vol. 2694, pp. 109–126). Presented at the SAS: Static Analysis Symposium, Springer. https://doi.org/10.1007/3-540-44898-5_7
View | DOI
 
[3]
2003 | Journal Article | IST-REx-ID: 3593
Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2003). A branching time temporal framework for quantitative reasoning. Journal of Automated Reasoning. Springer. https://doi.org/10.1023/A:1023217515688
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 3448
Mallick, S., Chatterjee, K., Merchant, A., & Dasgupta, P. (2002). Implementation of shape grammar for plan analysis. Presented at the IT-Built: Information Technology For Built Environment, Elsevier.
View
 
[1]
2001 | Conference Paper | IST-REx-ID: 3447
Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2001). Weighted quantified computation tree logic. Presented at the CIT: Conference on Information Technology, Elsevier.
View
 
Marked Publication(s)

Search

Filter Publications