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. 27th International Conference on Principles of Distributed Systems. OPODIS: Conference on Principles of Distributed Systems, LIPIcs, vol. 286, 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. 121(10), e2315558121.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
[429]
2024 | Journal Article | IST-REx-ID: 15297 | OA
Svoboda J, Joshi SS, Tkadlec J, Chatterjee K. 2024. Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. 20(3), e1012008.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[428]
2023 | Conference Paper | IST-REx-ID: 12676 | OA
Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. 2023. Faster algorithm for turn-based stochastic games with bounded treewidth. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 4590–4605.
[Published Version] View | DOI | Download Published Version (ext.)
 
[427]
2023 | Conference Paper | IST-REx-ID: 13142 | OA
Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. A learner-verifier framework for neural network controllers and certificates of stochastic systems. Tools and Algorithms for the Construction and Analysis of Systems . TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13993, 3–25.
[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. 479(2271), 20220685.
[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. 14, 2086.
[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 TA, Rus D. 2023. Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 14964–14973.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[423]
2023 | Conference Paper | IST-REx-ID: 14318 | OA
Sun Y, Fu H, Chatterjee K, Goharshady AK. 2023. Automated tail bound analysis for probabilistic recurrence relations. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 16–39.
[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. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 86–112.
[Published Version] View | Files available | DOI
 
[421]
2023 | Journal Article | IST-REx-ID: 12738 | OA
Chatterjee K, Katoen JP, Mohr S, Weininger M, Winkler T. 2023. Stochastic games with lexicographic objectives. Formal Methods in System Design.
[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. 48th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 272, 15.
[Published Version] View | Files available | DOI | arXiv
 
[419]
2023 | Conference Paper | IST-REx-ID: 14559
Ansaripour M, Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. Learning provably stabilizing neural controllers for discrete-time stochastic systems. 21st International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 14215, 357–379.
View | DOI
 
[418]
2023 | Journal Article | IST-REx-ID: 14657 | OA
Tkadlec J, Kaveh K, Chatterjee K, Nowak MA. 2023. Evolutionary dynamics of mutants that modify population structure. Journal of the Royal Society, Interface. 20(208), 20230355.
[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 MA. 2023. The effect of environmental information on evolution of cooperation in stochastic games. Nature Communications. 14, 4153.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[416]
2023 | Conference Paper | IST-REx-ID: 14736
Bastankhah M, Chatterjee K, Maddah-Ali MA, Schmid S, Svoboda J, Yeo MX. 2023. R2: Boosting liquidity in payment channel networks with online admission control. 27th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 13950, 309–325.
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. 35(2), 11.
[Published Version] View | Files available | DOI | arXiv
 
[414]
2023 | Conference Paper | IST-REx-ID: 14830
Zikelic D, Lechner M, Henzinger TA, Chatterjee K. 2023. Learning control policies for stochastic systems with reach-avoid guarantees. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 11926–11935.
[Preprint] View | Files available | DOI | arXiv
 
[413]
2023 | Conference Paper | IST-REx-ID: 15023 | OA
Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. 2023. Compositional policy learning in stochastic control systems with formal guarantees. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[412]
2022 | Conference Paper | IST-REx-ID: 12102 | OA
Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. 2022. Algorithms and hardness results for computing cores of Markov chains. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 29.
[Published Version] View | Files available | DOI
 
[411]
2022 | Conference Paper | IST-REx-ID: 12101 | OA
Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2022. Complexity of spatial games. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 11:1-11:14.
[Published Version] View | Files available | DOI
 
[410]
2022 | Preprint | IST-REx-ID: 12677 | OA
Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. 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 MA. 2022. Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. 12(1), 1526.
[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. 106(3), 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. 18(6), e1010149.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[406]
2022 | Journal Article | IST-REx-ID: 9311 | OA
Chatterjee K, Saona Urmeneta RJ, Ziliotto B. 2022. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 47(1), 100–119.
[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. 129, 1–21.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[404]
2022 | Conference Paper | IST-REx-ID: 12000 | OA
Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. 2022. Sound and complete certificates for auantitative termination analysis of probabilistic programs. Proceedings of the 34th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13371, 55–78.
[Published Version] View | Files available | DOI | WoS
 
[403]
2022 | Journal Article | IST-REx-ID: 12511 | OA
Lechner M, Zikelic D, Chatterjee K, Henzinger TA. 2022. Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. 36(7), 7326–7336.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[402]
2022 | Preprint | IST-REx-ID: 14601 | OA
Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. arXiv, 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 TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. arXiv, 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 MH, Kale SS, Svozil A. 2021. Faster algorithms for bounded liveness in graphs and game graphs. 48th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 198, 124.
[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. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 42.
[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. 30th International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conferences on Artificial Intelligence Organization, 4182–4189.
[Published Version] View | DOI | Download Published Version (ext.)
 
[397]
2021 | Conference Paper | IST-REx-ID: 12767 | OA
Bansal S, Chatterjee K, Vardi MY. 2021. On satisficing in quantitative games. 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 12651, 20–37.
[Published Version] View | Files available | DOI | arXiv
 
[396]
2021 | Conference Paper | IST-REx-ID: 10667 | OA
Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, .
[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. 289(1), 392–415.
[Published Version] View | Files available | DOI | WoS
 
[394]
2021 | Journal Article | IST-REx-ID: 9381 | OA
Kleshnina M, Streipert SS, Filar JA, Chatterjee K. 2021. Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. 17(4), e1008523.
[Published Version] View | Files available | DOI | WoS
 
[393]
2021 | Journal Article | IST-REx-ID: 9640 | OA
Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2021. Fast and strong amplifiers of natural selection. Nature Communications. 12(1), 4009.
[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 AK. 2021. Quantitative analysis of assertion violations in probabilistic programs. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 1171–1186.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[391]
2021 | Conference Paper | IST-REx-ID: 9645 | OA
Asadi A, Chatterjee K, Fu H, Goharshady AK, Mahdavi M. 2021. Polynomial reachability witnesses via Stellensätze. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 772–787.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[390]
2021 | Conference Paper | IST-REx-ID: 10002 | OA
Chatterjee K, Dvorak W, Henzinger MH, Svozil A. 2021. Symbolic time and space tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.
[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. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.
[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. 33rd International Conference on Computer-Aided Verification . CAV: Computer Aided Verification , LNCS, vol. 12759, 341–366.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[387]
2021 | Journal Article | IST-REx-ID: 10191 | OA
Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 5(OOPSLA), 164.
[Published Version] View | Files available | DOI | arXiv
 
[386]
2021 | Journal Article | IST-REx-ID: 9293 | OA
Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2021. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 297(8), 103499.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[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. 57, 401–428.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[384]
2021 | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee K, Goharshady EK, Novotný P, Zárevúcky J, Zikelic D. 2021. On lexicographic proof rules for probabilistic termination. 24th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[383]
2021 | Conference Paper | IST-REx-ID: 9644 | OA
Chatterjee K, Goharshady EK, Novotný P, Zikelic D. 2021. Proving non-termination by program reversal. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 1033–1048.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[382]
2021 | Research Data Reference | IST-REx-ID: 15284 | OA
Chatterjee K, Goharshady AK, Novotný P, Zikelic D. 2021. RevTerm, Association for Computing Machinery, 10.1145/3410304.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[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. 11(1), 17443.
[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 MA. 2021. A unified framework of direct and indirect reciprocity. Nature Human Behaviour. 5(10), 1292–1302.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[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. Proceedings of the 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153, 21.
[Preprint] View | Files available | DOI | arXiv
 
[378]
2020 | Conference Paper | IST-REx-ID: 8600 | OA
Chatterjee K, Henzinger TA, Otop J. 2020. Multi-dimensional long-run average problems for vector addition systems with states. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 23.
[Published Version] View | Files available | DOI | arXiv
 
[377]
2020 | Conference Paper | IST-REx-ID: 8533 | OA
Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 22:1-22:13.
[Published Version] View | Files available | DOI | arXiv
 
[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. Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science . LICS: Symposium on Logic in Computer Science, 102–115.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[375]
2020 | Journal Article | IST-REx-ID: 8767 | OA
Kaveh K, McAvoy A, Chatterjee K, Nowak MA. 2020. The Moran process on 2-chromatic graphs. PLOS Computational Biology. 16(11), e1008402.
[Published Version] View | Files available | DOI | WoS
 
[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. 8(11), 1945.
[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. 39(11), 3981–3992.
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. Proceedings of the 30th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 30, 48–56.
View | Files available
 
[371]
2020 | Conference Paper | IST-REx-ID: 8272 | OA
Chatterjee K, Katoen JP, Weininger M, Winkler T. 2020. Stochastic games with lexicographic reachability-safety objectives. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 12225, 398–420.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[370]
2020 | Journal Article | IST-REx-ID: 7212 | OA
Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2020. Limits on amplifiers of natural selection under death-Birth updating. PLoS computational biology. 16, e1007494.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[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, 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. Proceedings of the ACM on Programming Languages. vol. 4, 25.
[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. 34(06), 9794–9801.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[366]
2020 | Conference Paper | IST-REx-ID: 7810 | OA
Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2020. Optimal and perfectly parallel algorithms for on-demand data-flow analysis. European Symposium on Programming. ESOP: Programming Languages and Systems, LNCS, vol. 12075, 112–140.
[Published Version] View | Files available | DOI | WoS
 
[365]
2020 | Conference Paper | IST-REx-ID: 8728 | OA
Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. 2020. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 12302, 253–270.
[Submitted Version] View | Files available | DOI | WoS
 
[364]
2020 | Conference Paper | IST-REx-ID: 8089 | OA
Chatterjee K, Fu H, Goharshady AK, Goharshady EK. 2020. Polynomial invariant generation for non-deterministic recursive programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 672–687.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[363]
2019 | Conference Paper | IST-REx-ID: 6887 | OA
Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 7.
[Published Version] View | Files available | DOI
 
[362]
2019 | Conference Paper | IST-REx-ID: 6885 | OA
Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 27.
[Published Version] View | Files available | DOI
 
[361]
2019 | Conference Paper | IST-REx-ID: 6889 | OA
Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.
[Published Version] View | Files available | DOI
 
[360]
2019 | Conference Paper | IST-REx-ID: 5948
Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs. International Conference on Verification, Model Checking, and Abstract Interpretation. VMCAI: Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 11388, 468–490.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[359]
2019 | Conference Paper | IST-REx-ID: 6462 | OA
Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. 2019. Run-time optimization for learned controllers through quantitative games. 31st International Conference on Computer-Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 11561, 630–649.
[Published Version] View | Files available | DOI | WoS
 
[358]
2019 | Journal Article | IST-REx-ID: 6836 | OA
Hauser OP, Hilbe C, Chatterjee K, Nowak MA. 2019. Social dilemmas among unequals. Nature. 572(7770), 524–527.
[Submitted Version] View | Files available | DOI | WoS
 
[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. 16th International Conference on Quantitative Evaluation of Systems. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11785, 109–128.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[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. International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated TEchnology for Verification and Analysis, LNCS, vol. 11781, 462–478.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[355]
2019 | Journal Article | IST-REx-ID: 7210 | OA
Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2019. Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. 2, 138.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[354]
2019 | Conference Paper | IST-REx-ID: 10190 | OA
Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 124.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[353]
2019 | Conference Paper | IST-REx-ID: 7402 | OA
Chatterjee K, Doyen L. 2019. Graph planning with expected finite horizon. 34th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[352]
2019 | Conference Paper | IST-REx-ID: 6780 | OA
Huang M, Fu H, Chatterjee K, Goharshady AK. 2019. Modular verification for almost-sure termination of probabilistic programs. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 129.
[Published Version] View | Files available | DOI | arXiv
 
[351]
2019 | Journal Article | IST-REx-ID: 6380 | OA
Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 3(POPL), 53.
[Published Version] View | Files available | DOI
 
[350]
2019 | Conference Paper | IST-REx-ID: 6056 | OA
Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Probabilistic smart contracts: Secure randomness on the blockchain. IEEE International Conference on Blockchain and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency, 8751326.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[349]
2019 | Conference Paper | IST-REx-ID: 6378 | OA
Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. Proceedings of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing vol. Part F147772, 374–381.
[Submitted Version] View | Files available | DOI | WoS
 
[348]
2019 | Conference Paper | IST-REx-ID: 6175 | OA
Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 204–220.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[347]
2019 | Conference Paper | IST-REx-ID: 6490 | OA
Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on Applied Computing vol. Part F147772, 400–408.
[Submitted Version] View | Files available | DOI | WoS
 
[346]
2019 | Journal Article | IST-REx-ID: 7158 | OA
Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 41(4), 23.
[Submitted Version] View | Files available | DOI | WoS
 
[345]
2019 | Journal Article | IST-REx-ID: 7014 | OA
Chatterjee K, Fu H, Goharshady AK. 2019. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 41(4), 20.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[344]
2018 | Conference Paper | IST-REx-ID: 10883 | OA
Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2018. Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253.
[Published Version] View | Files available | DOI | arXiv
 
[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. POPL: Principles of Programming Languages vol. 2, 34.
[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: Handbook of Model Checking. , 921–962.
View | DOI
 
[341]
2018 | Book Chapter | IST-REx-ID: 86 | OA
Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time. In: Principles of Modeling. LNCS, vol. 10760, 143–161.
[Submitted Version] View | Files available | DOI
 
[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. 9(1), 555.
[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. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033, 185–194.
[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. 559(7713), 246–249.
[Submitted Version] View | Files available | DOI | WoS
 
[337]
2018 | Conference Paper | IST-REx-ID: 310 | OA
Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. SODA: Symposium on Discrete Algorithms, 2341–2356.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[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. 16th Asian Symposium on Programming Languages and Systems, APLAS, LNCS, vol. 11275, 181–201.
[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. 2, 469–477.
[Submitted Version] View | Files available | DOI | WoS
 
[334]
2018 | Conference Paper | IST-REx-ID: 79 | OA
Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11024, 53–70.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[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. TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10805, 385–407.
[Published Version] View | Files available | DOI | WoS
 
[332]
2018 | Conference Paper | IST-REx-ID: 141 | OA
Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.
[Published Version] View | Files available | DOI | WoS
 
[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. 40(2), 7.
[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. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July, 4764–4770.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
[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. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.
[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. ICAPS: International Conference on Automated Planning and Scheduling, ICAPS, vol. 2018, 47–55.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[327]
2018 | Conference Paper | IST-REx-ID: 35 | OA
Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2018. Algorithms and conditional lower bounds for planning problems. 28th International Conference on Automated Planning and Scheduling . ICAPS: International Conference on Automated Planning and Scheduling.
View | Files available | Download None (ext.) | WoS | arXiv
 
[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. 54(1), 166–207.
[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. 15(140), 20180073.
[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 MA. 2018. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 1(1), 71.
[Published Version] View | Files available | DOI | WoS
 
[323]
2018 | Conference Paper | IST-REx-ID: 66 | OA
Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 118, 11.
[Published Version] View | Files available | DOI | arXiv
 
[322]
2018 | Conference Paper | IST-REx-ID: 311 | OA
Chatterjee K, Goharshady AK, Velner Y. 2018. Quantitative analysis of smart contracts. ESOP: European Symposium on Programming, LNCS, vol. 10801, 739–767.
[Published Version] View | Files available | DOI
 
[321]
2018 | Conference Paper | IST-REx-ID: 6340 | OA
Goharshady AK, Behrouz A, Chatterjee K. 2018. Secure Credit Reporting on the Blockchain. Proceedings of the IEEE International Conference on Blockchain. IEEE International Conference on Blockchain, 1343–1348.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[320]
2018 | Journal Article | IST-REx-ID: 6009 | OA
Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2018. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 40(3), 9.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[319]
2018 | Conference Paper | IST-REx-ID: 5977 | OA
Chatterjee K, Fu H, Goharshady AK, Okati N. 2018. Computational approaches for stochastic shortest path on succinct MDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4700–4707.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[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. 115(48), 12241–12246.
[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 MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.
[Published Version] View | Files available | DOI | arXiv
 
[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. 13(2), 15.
[Published Version] View | Files available | DOI
 
[315]
2017 | Journal Article | IST-REx-ID: 467 | OA
Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[314]
2017 | Journal Article | IST-REx-ID: 465 | OA
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).
[Published Version] View | Files available | DOI
 
[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. 7(1), 82.
[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. 2(POPL), 30.
[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, 37p.
[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. 2(POPL), 31.
[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, 36p.
[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. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 61.
[Published Version] View | Files available | DOI
 
[307]
2017 | Conference Paper | IST-REx-ID: 552 | OA
Chatterjee K, Henzinger MH, Svozil A. 2017. Faster algorithms for mean-payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 39.
[Published Version] View | Files available | DOI
 
[306]
2017 | Conference Paper | IST-REx-ID: 553 | OA
Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 55.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[305]
2017 | Book Chapter | IST-REx-ID: 625 | OA
Chatterjee K, Doyen L, Henzinger TA. 2017.The cost of exactness in quantitative reachability. In: Models, Algorithms, Logics and Tools. LNCS, vol. 10460, 367–381.
[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. CAV: Computer Aided Verification, LNCS, vol. 10426, 118–139.
[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. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[302]
2017 | Conference Paper | IST-REx-ID: 6519 | OA
Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82, 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, Chatterjee K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 49(3), 358–366.
[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. 114(18), 4715–4720.
[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. 254, 296–315.
[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. 82(2), 420–452.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[297]
2017 | Conference Paper | IST-REx-ID: 711 | OA
Chatterjee K, Henzinger TA, Otop J. 2017. Bidirectional nested weighted automata. 28th International Conference on Concurrency Theory, CONCUR, LIPIcs, vol. 85, 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. 64(5), 34.
[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. 88, 236–259.
[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. 54(6), 543–544.
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. 23(2), 230–253.
[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. 84, 144–170.
[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, Vogelstein B, Nowak M. 2017. Reconstructing metastatic seeding patterns of human cancers. Nature Communications. 8, 14114.
[Published Version] View | Files available | DOI | WoS
 
[290]
2017 | Journal Article | IST-REx-ID: 1065 | OA
Chatterjee K, Osang GF. 2017. Pushdown reachability with constant treewidth. Information Processing Letters. 122, 25–29.
[Submitted Version] View | Files available | DOI | WoS
 
[289]
2017 | Journal Article | IST-REx-ID: 1066
Chatterjee K, Henzinger TA, Otop J, Velner Y. 2017. Quantitative fair simulation games. Information and Computation. 254(2), 143–166.
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. ESOP: European Symposium on Programming, LNCS, vol. 10201, 287–313.
[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. Proceedings of the 31st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 5, 3725–3732.
[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. 433, 64–72.
[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. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 52, 145–160.
[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, 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 AK. 2017. Non-polynomial worst case analysis of recursive programs. CAV: Computer Aided Verification, LNCS, vol. 10427, 41–63.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[282]
2017 | Conference Paper | IST-REx-ID: 949 | OA
Chatterjee K, Goharshady AK, Pavlogiannis A. 2017. JTDec: A tool for tree decompositions in soot. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 10482, 59–66.
[Submitted Version] View | Files available | DOI | WoS
 
[281]
2016 | Conference Paper | IST-REx-ID: 1068 | OA
Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2016. Conditionally optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 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. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98.
[Published Version] View | Files available | DOI
 
[279]
2016 | Conference Paper | IST-REx-ID: 1090 | OA
Chatterjee K, Henzinger TA, Otop J. 2016. Nested weighted limit-average automata of bounded width. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 24.
[Published Version] View | Files available | DOI
 
[278]
2016 | Conference Paper | IST-REx-ID: 1138 | OA
Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative automata under probabilistic semantics. Proceedings of the 31st Annual ACM/IEEE Symposium. LICS: Logic in Computer Science, 76–85.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[277]
2016 | Conference Paper | IST-REx-ID: 1140 | OA
Chatterjee K, Dvoák W, Henzinger MH, Loitzenbauer V. 2016. Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, , 197–206.
[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. IJCAI: International Joint Conference on Artificial Intelligence vol. 2016–January, 172–179.
[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. Proceedings of the ACM Conference on Computer Supported Cooperative Work. CSCW: Computer Supported Cooperative Work and Social Computing vol. 26, 365–368.
View | DOI
 
[274]
2016 | Conference Paper | IST-REx-ID: 1324
Chatterjee K, Chmelik M. 2016. Indefinite-horizon reachability in Goal-DEC-POMDPs. Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2016–January, 88–96.
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. Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. AAMAS: Autonomous Agents & Multiagent Systems, 1465–1466.
[Preprint] View | Download Preprint (ext.)
 
[272]
2016 | Conference Paper | IST-REx-ID: 1335 | OA
Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative monitor automata. SAS: Static Analysis Symposium, LNCS, vol. 9837, 23–38.
[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. ECAI: European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 285, 1432–1439.
[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. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, vol. 05-08-July-2016, 247–256.
[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. 82(5), 878–911.
[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. 234, 26–48.
[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, 33p.
[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. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2016, 3225–3232.
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, 22p.
[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, 34p.
[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, 34p.
[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. ESA: European Symposium on Algorithms, LIPIcs, vol. 57, 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. POPL: Principles of Programming Languages, POPL, vol. 20–22, 327–342.
[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, 32p.
[Published Version] View | Files available | DOI
 
[259]
2016 | Conference Paper | IST-REx-ID: 1437 | OA
Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL: Principles of Programming Languages, POPL, vol. 20–22, 733–747.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[258]
2016 | Conference Paper | IST-REx-ID: 1386 | OA
Chatterjee K, Fu H, Goharshady AK. 2016. Termination analysis of probabilistic programs through Positivstellensatz’s. CAV: Computer Aided Verification, LNCS, vol. 9779, 3–22.
[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. Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2015, 1018–1029.
[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. 112(51), 15636–15641.
[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. 42nd International Colloquium. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 108–120.
[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. 5, 17147.
[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. 471(2181), 20150114.
[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. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 233–238.
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. 60(9), 2291–2306.
View | DOI
 
[250]
2015 | Journal Article | IST-REx-ID: 1698 | OA
Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. 2015. The complexity of multi-mean-payoff and multi-energy games. Information and Computation. 241(4), 177–196.
[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. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence . IAAI: Innovative Applications of Artificial Intelligence, Artifical Intelligence, vol. 5, 3496–3502.
[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. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 9035, 517–532.
[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. 9035, 181–187.
[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. 221, 46–72.
[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. 115(1), 52–59.
[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. 573(3), 71–89.
[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 TA. 2015. Randomness for free. Information and Computation. 245(12), 3–16.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[242]
2015 | Journal Article | IST-REx-ID: 1856 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2015. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 62(1), 9.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[241]
2015 | Conference Paper | IST-REx-ID: 1661 | OA
Chatterjee K, Henzinger MH, Loitzenbauer V. 2015. Improved algorithms for one-pair and k-pair Streett objectives. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174888.
[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. 242(6), 25–52.
[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. 242(6), 2–24.
[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. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2, 745–752.
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. ICRA: International Conference on Robotics and Automation, 325–330.
[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, 25p.
[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. , 244–256.
View | Files available | DOI
 
[234]
2015 | Conference Paper | IST-REx-ID: 1656
Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174926.
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, 41p.
[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, 51p.
[Published Version] View | Files available | DOI
 
[231]
2015 | Technical Report | IST-REx-ID: 5436 | OA
Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria, 29p.
[Published Version] View | Files available | DOI
 
[230]
2015 | Conference Paper | IST-REx-ID: 1610 | OA
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata. 42nd International Colloquium. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 121–133.
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, 27p.
[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, 31p.
[Published Version] View | Files available | DOI
 
[227]
2015 | Technical Report | IST-REx-ID: 5438 | OA
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata, IST Austria, 15p.
[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, 18p.
[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, 29p.
[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, Vogelstein B, Nowak M. 2015. Reconstructing robust phylogenies of metastatic cancers, IST Austria, 25p.
[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, 23p.
[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. 282(1812).
[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. 47(2), 230–264.
[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. 50(1), 97–109.
[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 . 50(1), 539–551.
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. CAV: Computer Aided Verification, LNCS, vol. 9206, 140–157.
[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. Real-Time Systems Symposium. RTSS: Real-Time Systems Symposium vol. 2015, 118–127.
View | Files available | DOI
 
[216]
2015 | Technical Report | IST-REx-ID: 5441 | OA
Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 24p.
[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. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 259–268.
[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. 6(4), 413–437.
[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. CAV: Computer Aided Verification, LNCS, vol. 9206, 158–177.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[212]
2014 | Journal Article | IST-REx-ID: 1375 | OA
Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. 2014. Approximating the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.
[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. IOT: Internet of Things, 85–90.
View | DOI
 
[210]
2014 | Conference Paper | IST-REx-ID: 2027 | OA
Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of markov decision processes using learning algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ALENEX: Algorithm Engineering and Experiments, LNCS, vol. 8837, 98–114.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[209]
2014 | Journal Article | IST-REx-ID: 2187 | OA
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220.
[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. 10(1).
[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. 51(3–4), 129–163.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[206]
2014 | Journal Article | IST-REx-ID: 2141 | OA
Chatterjee K, Henzinger MH. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), a15.
[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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 544–559.
View | Files available | DOI
 
[204]
2014 | Conference Paper | IST-REx-ID: 1903
Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4.
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). 15(2), 16.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[202]
2014 | Journal Article | IST-REx-ID: 2038 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.
[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. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573, 122–133.
[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. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 242–257.
[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. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 210–225.
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. HSCC: Hybrid Systems - Computation and Control, 303–312.
[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, 33p.
[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, 33p.
[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, 31p.
[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. Lecture Notes in Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573, 110–121.
[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, 34p.
[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, 18p.
[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, 49p.
[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, 12p.
[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, 10p.
[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, 14p.
[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, 24p.
[Published Version] View | Files available | DOI
 
[186]
2014 | Technical Report | IST-REx-ID: 5415 | OA
Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.
[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, 27p.
[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. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 78–97.
[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. 10(9), 7p.
[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, 10.1371/journal.pcbi.1003818.s001.
[Published Version] View | Files available | DOI
 
[181]
2014 | Journal Article | IST-REx-ID: 535 | OA
Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2014. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492.
[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. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490.
View | Files available | DOI
 
[179]
2014 | Technical Report | IST-REx-ID: 5428 | OA
Chatterjee K, Henzinger TA, Otop J, Velner Y. 2014. Quantitative fair simulation games, IST Austria, 26p.
[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. 22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23, 181–196.
[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. 8312, 228–242.
View | DOI
 
[176]
2013 | Conference (Editor) | IST-REx-ID: 2292
Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.
View | DOI
 
[175]
2013 | Journal Article | IST-REx-ID: 2299 | OA
Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.
[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. 8044, 559–575.
[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. 8044, 543–558.
[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. 24(2), 165–185.
[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. 334, 26–34.
[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. Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control vol. 1, 273–282.
[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. 228–229, 83–119.
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. 26(4), 825–859.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[167]
2013 | Journal Article | IST-REx-ID: 2854 | OA
Chatterjee K, De Alfaro L, Henzinger TA. 2013. Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. 79(5), 640–657.
[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. 42(2), 142–174.
View | DOI
 
[165]
2013 | Journal Article | IST-REx-ID: 2831 | OA
Chatterjee K, Henzinger MH, Joglekar M, Shah N. 2013. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods in System Design. 42(3), 301–327.
[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. 8172, 118–132.
[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, 17p.
[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. 23, 165–180.
[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, 33p.
[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, 41p.
[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, 29p.
[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, 22p.
[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, 12p.
[Published Version] View | Files available | DOI
 
[156]
2013 | Conference Paper | IST-REx-ID: 1376
Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 18–25.
View | Files available | DOI
 
[155]
2013 | Technical Report | IST-REx-ID: 5406 | OA
Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL Fragments, IST Austria, 11p.
[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, 17p.
[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, 13p.
[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. 8052, 500–515.
[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, 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. 7th International Conference on Language and Automata Theory and Applications. LATA: Conference on Language and Automata Theory and ApplicationsLNCS, LNCS, vol. 7810, 214–225.
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. 8(12), e80814.
[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. 6(1), 34–45.
[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, Moon Y, Yaqubie A, Kelly N, Le D, Lipson E, Chapman P, Diaz L, Vogelstein B, Nowak M. 2013. Evolutionary dynamics of cancer in response to targeted combination therapy. eLife. 2, e00747.
[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. Proceedings of 25th Int. Conf. on Computer Aided Verification. CAV: Computer Aided VerificationLecture Notes in Computer Science, LNCS, vol. 8044, 101–106.
[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. 28th Annual ACM/IEEE Symposium. LICS: Logic in Computer Science, 331–340.
[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. Proceedings of the 16th International conference on Hybrid systems: Computation and control. HSCC: Hybrid Systems - Computation and Control, 163–172.
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. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 461–473.
[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. CONCUR 2012 - Concurrency Theory. CONCUR: Conference on Concurrency Theory, LNCS, vol. 7454, 115–131.
[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. 301, 161–173.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[140]
2012 | Conference Paper | IST-REx-ID: 2936 | OA
Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. roceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.
[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. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561, 385–399.
[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. CAV: Computer Aided Verification, LNCS, vol. 7358, 23–38.
[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. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 152–168.
[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. MEMICS: Mathematical and Engineering Methods in Computer Science, LNCS, vol. 7119, 37–46.
[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. 211, 29–48.
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. 23(3), 609–625.
View | DOI
 
[133]
2012 | Journal Article | IST-REx-ID: 3846 | OA
Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 78(2), 394–413.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[132]
2012 | Journal Article | IST-REx-ID: 3128 | OA
Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 43(2), 268–284.
[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. 458, 49–60.
[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. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16, 167–182.
[Published Version] View | Files available | DOI
 
[129]
2012 | Conference Paper | IST-REx-ID: 3165 | OA
Chatterjee K, Henzinger MH. 2012. An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1386–1399.
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. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280438.
View | Files available | DOI
 
[127]
2012 | Technical Report | IST-REx-ID: 5377 | OA
Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.
[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, 21p.
[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. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.
[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. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285.
[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. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280437.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[122]
2012 | Conference Paper | IST-REx-ID: 10905 | OA
Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2012. Polynomial-time algorithms for energy games with special weight structures. Algorithms – ESA 2012. ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.
[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. 81(1), 69–80.
[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 TA, Jobstmann B. 2011. Specification-centered robustness. 6th IEEE International Symposium on Industrial and Embedded Systems. SIES: International Symposium on Industrial Embedded Systems, 176–185.
[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. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6919, 145–159.
View | DOI
 
[118]
2011 | Conference Paper | IST-REx-ID: 3351 | OA
Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[117]
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4), 28.
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. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54, 74–86.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[115]
2011 | Conference Paper | IST-REx-ID: 3365 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605, 267–271.
[Submitted Version] View | Files available | DOI
 
[114]
2011 | Preprint | IST-REx-ID: 3363 | OA
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[113]
2011 | Journal Article | IST-REx-ID: 3315 | OA
Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).
[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, .
[Preprint] View | Download Preprint (ext.) | arXiv
 
[111]
2011 | Conference Paper | IST-REx-ID: 3342 | OA
Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. 2011. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. CAV: Computer Aided Verification, LNCS, vol. 6806, 260–276.
[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. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 216–226.
[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. LICS: Logic in Computer Science, 5970225.
[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. HSCC: Hybrid Systems - Computation and Control, 221–230.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[107]
2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee K. 2011. Graph games with reachability objectives. RP: Reachability Problems, LNCS, vol. 6945, 1–1.
View | DOI
 
[106]
2011 | Conference Paper | IST-REx-ID: 3343 | OA
Chatterjee K, Henzinger MH. 2011. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. SODA: Symposium on Discrete Algorithms, 1318–1336.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[105]
2011 | Conference Paper | IST-REx-ID: 3361 | OA
Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.
[Submitted Version] View | Files available | DOI
 
[104]
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.
View | DOI
 
[103]
2011 | Technical Report | IST-REx-ID: 5379 | OA
Chatterjee K, Henzinger MH. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p.
[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, 43p.
[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, 53p.
[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, 18p.
[Published Version] View | Files available | DOI
 
[99]
2011 | Preprint | IST-REx-ID: 3338 | OA
Chatterjee K. 2011. Bounded rationality in concurrent parity games. arXiv, 1–51, .
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[98]
2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.
[Submitted Version] View | Files available | DOI
 
[97]
2011 | Technical Report | IST-REx-ID: 5385 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.
[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, 30p.
[Published Version] View | Files available | DOI
 
[95]
2011 | Conference Paper | IST-REx-ID: 3366 | OA
Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.
[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. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907, 206–218.
[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, 20p.
[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. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 1–14.
[Submitted Version] View | Files available | DOI
 
[91]
2010 | Conference Paper | IST-REx-ID: 3856 | OA
Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[90]
2010 | Conference (Editor) | IST-REx-ID: 3859
Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p.
View | Files available | DOI
 
[89]
2010 | Conference Paper | IST-REx-ID: 3866 | OA
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174, 410–424.
[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. 6(3), 1–27.
[Published Version] View | Files available | DOI
 
[87]
2010 | Conference Paper | IST-REx-ID: 3853 | OA
Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.
[Submitted Version] View | Files available | DOI
 
[86]
2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee K, Horn F, Löding C. 2010. Obliging games. CONCUR: Concurrency Theory, LNCS, vol. 6269, 284–296.
View | DOI
 
[85]
2010 | Conference Paper | IST-REx-ID: 3851 | OA
Chatterjee K, Doyen L. 2010. Energy parity games. ICALP: Automata, Languages and Programming, 37th International Colloquium, LNCS, vol. 6199, 599–610.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[84]
2010 | Conference Paper | IST-REx-ID: 3860 | OA
Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 505–516.
[Submitted Version] View | Files available | DOI
 
[83]
2010 | Journal Article | IST-REx-ID: 3862 | OA
Chatterjee K, Doyen L, Henzinger TA. 2010. Quantitative languages. ACM Transactions on Computational Logic (TOCL). 11(4), 23.
[Submitted Version] View | Files available | DOI
 
[82]
2010 | Conference Paper | IST-REx-ID: 3864 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174, 380–395.
[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. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 293–307.
View | DOI
 
[80]
2010 | Journal Article | IST-REx-ID: 3863 | OA
Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy construction for parity games with imperfect information. Information and Computation. 208(10), 1206–1220.
[Submitted Version] View | Files available | DOI
 
[79]
2010 | Journal Article | IST-REx-ID: 3861 | OA
Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.
[Submitted Version] View | Files available | DOI
 
[78]
2010 | Journal Article | IST-REx-ID: 3867 | OA
Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.
[Published Version] View | Files available | DOI
 
[77]
2010 | Technical Report | IST-REx-ID: 5388 | OA
Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.
[Published Version] View | Files available | DOI
 
[76]
2010 | Conference Paper | IST-REx-ID: 4388 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.
[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, 21p.
[Published Version] View | Files available | DOI
 
[74]
2010 | Conference Paper | IST-REx-ID: 3857
Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words: decidability and undecidability results. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6252, 1–16.
View | Files available | DOI
 
[73]
2010 | Conference Paper | IST-REx-ID: 3855 | OA
Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 258–269.
[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. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 22–29.
[Published Version] View | Files available | DOI | arXiv
 
[71]
2009 | Conference Paper | IST-REx-ID: 3503 | OA
Chatterjee K, Henzinger TA. 2009. Probabilistic systems with limsup and liminf objectives. ILC: Infinity in Logic and Computation, LNCS, vol. 5489, 32–45.
View | DOI | Download (ext.)
 
[70]
2009 | Conference Paper | IST-REx-ID: 3871 | OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Probabilistic weighted automata. CONCUR: Concurrency Theory, LNCS, vol. 5710, 244–258.
[Submitted Version] View | Files available | DOI
 
[69]
2009 | Journal Article | IST-REx-ID: 3870 | OA
Chatterjee K, Henzinger TA, Horn F. 2009. Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). 11(1), 1.
[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. 5(2).
View | DOI
 
[67]
2009 | Conference Paper | IST-REx-ID: 4542 | OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata. FCT: Fundamentals of Computation Theory, LNCS, vol. 5699, 3–13.
[Submitted Version] View | Files available | DOI
 
[66]
2009 | Conference Paper | IST-REx-ID: 4545 | OA
Chatterjee K, Doyen L, Henzinger TA. 2009. A survey of stochastic games with limsup and liminf objectives. ICALP: Automata, Languages and Programming, LNCS, vol. 5556, 1–15.
[Submitted Version] View | Files available | DOI
 
[65]
2009 | Conference Paper | IST-REx-ID: 4543
Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734, 34–54.
View | DOI
 
[64]
2009 | Conference Paper | IST-REx-ID: 4544 | OA
Chatterjee K, De Alfaro L, Henzinger TA. 2009. Termination criteria for solving concurrent safety and reachability games. SODA: Symposium on Discrete Algorithms, 197–206.
View | Files available | DOI | Download (ext.)
 
[63]
2009 | Conference Paper | IST-REx-ID: 4540
Chatterjee K, Doyen L, Henzinger TA. 2009. Expressiveness and closure properties for quantitative languages. LICS: Logic in Computer Science, 199–208.
View | Files available | DOI
 
[62]
2009 | Conference Paper | IST-REx-ID: 4569 | OA
Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. 2009. Better quality in synthesis through quantitative objectives. CAV: Computer Aided Verification, LNCS, vol. 5643, 140–156.
[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 TA. 2009. Alpaga: A tool for solving parity games with imperfect information. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 5505, 58–61.
View | Files available | DOI | Download (ext.)
 
[60]
2009 | Technical Report | IST-REx-ID: 5393 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver for probabilistic games, IST Austria, 12p.
[Published Version] View | Files available | DOI
 
[59]
2009 | Technical Report | IST-REx-ID: 5394 | OA
Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.
[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, 17p.
[Published Version] View | Files available | DOI
 
[57]
2009 | Technical Report | IST-REx-ID: 5395 | OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Qualitative analysis of partially-observable Markov decision processes, IST Austria, 20p.
[Published Version] View | Files available | DOI
 
[56]
2008 | Conference Paper | IST-REx-ID: 3501
Adler BT, Chatterjee K, De Alfaro L, Faella M, Pye I, Raman V. 2008. Assigning trust to Wikipedia content. WikiSym: International Symposium on Wikis.
View | DOI
 
[55]
2008 | Conference Paper | IST-REx-ID: 3502
Chatterjee K, De Alfaro L, Pye I. 2008. Robust content-driven reputation. AISec: Artificial Intelligence and Security, 33–42.
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. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 2, 107–118.
[Published Version] View | Files available | DOI
 
[53]
2008 | Conference Paper | IST-REx-ID: 3875
Chatterjee K, Henzinger TA, Sen K. 2008. Model-checking omega-regular properties of interval Markov chains. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 4962, 302–317.
View | DOI
 
[52]
2008 | Conference Paper | IST-REx-ID: 3873
Chatterjee K, Majumdar R, Henzinger TA. 2008. Controller synthesis with budget constraints. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 4981, 72–86.
View | DOI
 
[51]
2008 | Conference Paper | IST-REx-ID: 3876
Chatterjee K, Henzinger TA, Prabhu V. 2008. Timed parity games: complexity and robustness. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 5215, 124–140.
View | Files available | DOI
 
[50]
2008 | Conference Paper | IST-REx-ID: 3877
Chatterjee K, Henzinger TA, Jobstmann B. 2008. Environment assumptions for synthesis. CONCUR: Concurrency Theory, LNCS, vol. 5201, 147–161.
View | DOI
 
[49]
2008 | Conference Paper | IST-REx-ID: 3878 | OA
Chatterjee K, De Alfaro L, Majumdar R. 2008. The complexity of coverage. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 5356, 91–106.
View | DOI | Download (ext.)
 
[48]
2008 | Conference Paper | IST-REx-ID: 3874
Chatterjee K, Henzinger TA, Prabhu V. 2008. Trading infinite memory for uniform randomness in timed games. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 4981, 87–100.
View | DOI
 
[47]
2008 | Conference Paper | IST-REx-ID: 3879
Chatterjee K, Doyen L, Henzinger TA. 2008. Quantitative languages. CSL: Computer Science Logic, LNCS, vol. 5213, 385–400.
View | DOI
 
[46]
2008 | Book Chapter | IST-REx-ID: 3872
Chatterjee K, Henzinger TA. 2008.Value iteration. In: 25 Years in Model Checking. LNCS, vol. 5000, 107–138.
View | DOI
 
[45]
2008 | Conference Paper | IST-REx-ID: 3880
Berwanger D, Chatterjee K, Doyen L, Henzinger TA, Raje S. 2008. Strategy construction for parity games with imperfect information. CONCUR: Concurrency Theory, LNCS, vol. 5201, 325–339.
View | Files available | DOI
 
[44]
2008 | Journal Article | IST-REx-ID: 4534
Chatterjee K, Henzinger TA. 2008. Reduction of stochastic parity to stochastic mean-payoff games. Information Processing Letters. 106(1), 1–7.
View | DOI | Download (ext.)
 
[43]
2008 | Conference Paper | IST-REx-ID: 4546
Chatterjee K, Ghosal A, Henzinger TA, Iercan D, Kirsch C, Pinello C, Sangiovanni Vincentelli A. 2008. Logical reliability of interacting real-time tasks. DATE: Design, Automation and Test in Europe, 909–914.
View | DOI | Download (ext.)
 
[42]
2008 | Journal Article | IST-REx-ID: 4548
Chatterjee K, Majumdar R, Henzinger TA. 2008. Stochastic limit-average games are in EXPTIME. International Journal of Game Theory. 37(2), 219–234.
View | DOI | Download (ext.)
 
[41]
2007 | Conference Paper | IST-REx-ID: 3883
Chatterjee K, Henzinger TA, Piterman N. 2007. Generalized parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 4423, 153–167.
View | DOI
 
[40]
2007 | Journal Article | IST-REx-ID: 3882
Chatterjee K. 2007. Concurrent games with tail objectives. Theoretical Computer Science. 388(1–3), 181–198.
View | DOI
 
[39]
2007 | Conference Paper | IST-REx-ID: 3884
Chatterjee K, Henzinger TA, Piterman N. 2007. Strategy logic. CONCUR: Concurrency Theory, LNCS, vol. 4703, 59–73.
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. QEST: Quantitative Evaluation of Systems, 237–248.
View | DOI
 
[37]
2007 | Conference Paper | IST-REx-ID: 3887
Chatterjee K. 2007. Markov decision processes with multiple long-run average objectives. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS , vol. 4855, 473–484.
View | DOI
 
[36]
2007 | Conference Paper | IST-REx-ID: 3886
Chatterjee K. 2007. Stochastic Müller games are PSPACE-complete. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS, vol. 4855, 436–448.
View | DOI
 
[35]
2007 | Conference Paper | IST-REx-ID: 3885
Chatterjee K. 2007. Optimal strategy synthesis in stochastic Müller games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS , vol. 4423, 138–152.
View | DOI
 
[34]
2007 | Conference Paper | IST-REx-ID: 4537
Chatterjee K, Henzinger TA. 2007. Assume-guarantee synthesis. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 4424, 261–275.
View | DOI
 
[33]
2007 | Journal Article | IST-REx-ID: 4547
Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2007. Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science. 3(184), 1–23.
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. CSF: Computer Security Foundations, 70–82.
View | DOI
 
[30]
2006 | Conference Paper | IST-REx-ID: 3499
Chatterjee K. 2006. Nash equilibrium for upward-closed objectives. CSL: Computer Science Logic, LNCS , vol. 4207, 271–286.
View | DOI
 
[29]
2006 | Conference Paper | IST-REx-ID: 3500
Chatterjee K, Henzinger TA, Piterman N. 2006. Algorithms for Büchi Games. GDV: Games in Design and Verification.
View | Download (ext.)
 
[28]
2006 | Conference Paper | IST-REx-ID: 3890
Chatterjee K, De Alfaro L, Henzinger TA. 2006. The complexity of quantitative concurrent parity games. SODA: Symposium on Discrete Algorithms, 678–687.
View | DOI
 
[27]
2006 | Conference Paper | IST-REx-ID: 3889
Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2006. Algorithms for omega-regular games with imperfect information. CSL: Computer Science Logic, LNCS, vol. 4207, 287–302.
View | DOI
 
[26]
2006 | Conference Paper | IST-REx-ID: 3891
Chatterjee K. 2006. Concurrent games with tail objectives. CSL: Computer Science Logic, LNCS , vol. 4207, 256–270.
View | DOI
 
[25]
2006 | Conference Paper | IST-REx-ID: 3888
Chatterjee K, Henzinger TA. 2006. Strategy improvement for stochastic Rabin and Streett games. CONCUR: Concurrency Theory, LNCS, vol. 4137, 375–389.
View | DOI
 
[24]
2006 | Conference Paper | IST-REx-ID: 4539
Chatterjee K, Henzinger TA. 2006. Finitary winning in omega-regular games. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 3920, 257–271.
View | DOI
 
[23]
2006 | Conference Paper | IST-REx-ID: 4538
Chatterjee K, Henzinger TA. 2006. Strategy improvement and randomized subexponential algorithms for stochastic parity games. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 3884, 512–523.
View | DOI
 
[22]
2006 | Conference Paper | IST-REx-ID: 4551
Chatterjee K, Majumdar R, Henzinger TA. 2006. Markov decision processes with multiple objectives. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 3884, 325–336.
View | DOI
 
[21]
2006 | Journal Article | IST-REx-ID: 4550
Chatterjee K, Henzinger TA, Jurdziński M. 2006. Games with secure equilibria. Theoretical Computer Science. 365(1–2), 67–82.
View | DOI
 
[20]
2006 | Conference Paper | IST-REx-ID: 4549
Chatterjee K, De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. 2006. Compositional quantitative reasoning. QEST: Quantitative Evaluation of Systems, 179–188.
View | DOI
 
[19]
2006 | Conference Paper | IST-REx-ID: 4552
Chatterjee K, De Alfaro L, Henzinger TA. 2006. Strategy improvement for concurrent reachability games. QEST: Quantitative Evaluation of Systems, 291–300.
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. IWDC: International Workshop on Distributed Computing , LNCS, vol. 3326, 89–102.
View | DOI
 
[17]
2005 | Conference Paper | IST-REx-ID: 3893
Chatterjee K. 2005. Two-player nonzero-sum ω-regular games. CONCUR: Concurrency Theory, LNCS , vol. 3653, 413–427.
View | DOI
 
[16]
2005 | Conference Paper | IST-REx-ID: 3892
Chatterjee K, Henzinger TA, Jurdziński M. 2005. Games with secure equilibria. FMCO: Formal Methods for Components and Objects, LNCS, vol. 3657, 141–161.
View | DOI
 
[15]
2005 | Conference Paper | IST-REx-ID: 4541
Chatterjee K, Henzinger TA. 2005. Semiperfect-information games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS, vol. 3821, 1–18.
View | DOI
 
[14]
2005 | Conference Paper | IST-REx-ID: 4553
Chatterjee K, De Alfaro L, Henzinger TA. 2005. The complexity of stochastic Rabin and Streett games. ICALP: Automata, Languages and Programming, LNCS, vol. 3580, 878–890.
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 4554
Chatterjee K, Henzinger TA, Jurdziński M. 2005. Mean-payoff parity games. LICS: Logic in Computer Science, 178–187.
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 4560
Chakrabarti A, Chatterjee K, Henzinger TA, Kupferman O, Majumdar R. 2005. Verifying quantitative properties using bound functions. CHARME: Correct Hardware Design and Verification Methods, LNCS, vol. 3725, 50–64.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 4557
Chatterjee K, Henzinger TA, Jhala R, Majumdar R. 2005. Counterexample-guided planning. UAI: Uncertainty in Artificial Intelligence, 104–111.
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. CSL: Computer Science Logic, LNCS , vol. 3210, 26–40.
View | DOI
 
[9]
2004 | Conference Paper | IST-REx-ID: 3895
Chatterjee K, Henzinger TA, Jurdziński M. 2004. Games with secure equilibria. LICS: Logic in Computer Science, 160–169.
View | DOI
 
[8]
2004 | Conference Paper | IST-REx-ID: 4555
Chatterjee K, De Alfaro L, Henzinger TA. 2004. Trading memory for randomness. QEST: Quantitative Evaluation of Systems, 206–217.
View | DOI
 
[7]
2004 | Conference Paper | IST-REx-ID: 4558
Chatterjee K, Jurdziński M, Henzinger TA. 2004. Quantitative stochastic parity games. SODA: Symposium on Discrete Algorithms, 121–130.
View
 
[6]
2004 | Journal Article | IST-REx-ID: 4556
Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2004. Stack size analysis for interrupt-driven programs. Information and Computation. 194(2), 144–174.
View | DOI
 
[5]
2003 | Conference Paper | IST-REx-ID: 3897
Chatterjee K, Jurdziński M, Henzinger TA. 2003. Simple stochastic parity games. CSL: Computer Science Logic, LNCS, vol. 2803, 100–113.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3898
Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2003. Stack size analysis for interrupt-driven programs. SAS: Static Analysis Symposium, LNCS, vol. 2694, 109–126.
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. 30(2), 205–232.
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. IT-Built: Information Technology For Built Environment.
View
 
[1]
2001 | Conference Paper | IST-REx-ID: 3447
Chatterjee K, Dasgupta P, Chakrabarti P. 2001. Weighted quantified computation tree logic. CIT: Conference on Information Technology.
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. 27th International Conference on Principles of Distributed Systems. OPODIS: Conference on Principles of Distributed Systems, LIPIcs, vol. 286, 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. 121(10), e2315558121.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
[429]
2024 | Journal Article | IST-REx-ID: 15297 | OA
Svoboda J, Joshi SS, Tkadlec J, Chatterjee K. 2024. Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. 20(3), e1012008.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[428]
2023 | Conference Paper | IST-REx-ID: 12676 | OA
Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. 2023. Faster algorithm for turn-based stochastic games with bounded treewidth. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 4590–4605.
[Published Version] View | DOI | Download Published Version (ext.)
 
[427]
2023 | Conference Paper | IST-REx-ID: 13142 | OA
Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. A learner-verifier framework for neural network controllers and certificates of stochastic systems. Tools and Algorithms for the Construction and Analysis of Systems . TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13993, 3–25.
[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. 479(2271), 20220685.
[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. 14, 2086.
[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 TA, Rus D. 2023. Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 14964–14973.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[423]
2023 | Conference Paper | IST-REx-ID: 14318 | OA
Sun Y, Fu H, Chatterjee K, Goharshady AK. 2023. Automated tail bound analysis for probabilistic recurrence relations. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 16–39.
[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. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 86–112.
[Published Version] View | Files available | DOI
 
[421]
2023 | Journal Article | IST-REx-ID: 12738 | OA
Chatterjee K, Katoen JP, Mohr S, Weininger M, Winkler T. 2023. Stochastic games with lexicographic objectives. Formal Methods in System Design.
[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. 48th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 272, 15.
[Published Version] View | Files available | DOI | arXiv
 
[419]
2023 | Conference Paper | IST-REx-ID: 14559
Ansaripour M, Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. Learning provably stabilizing neural controllers for discrete-time stochastic systems. 21st International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 14215, 357–379.
View | DOI
 
[418]
2023 | Journal Article | IST-REx-ID: 14657 | OA
Tkadlec J, Kaveh K, Chatterjee K, Nowak MA. 2023. Evolutionary dynamics of mutants that modify population structure. Journal of the Royal Society, Interface. 20(208), 20230355.
[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 MA. 2023. The effect of environmental information on evolution of cooperation in stochastic games. Nature Communications. 14, 4153.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[416]
2023 | Conference Paper | IST-REx-ID: 14736
Bastankhah M, Chatterjee K, Maddah-Ali MA, Schmid S, Svoboda J, Yeo MX. 2023. R2: Boosting liquidity in payment channel networks with online admission control. 27th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 13950, 309–325.
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. 35(2), 11.
[Published Version] View | Files available | DOI | arXiv
 
[414]
2023 | Conference Paper | IST-REx-ID: 14830
Zikelic D, Lechner M, Henzinger TA, Chatterjee K. 2023. Learning control policies for stochastic systems with reach-avoid guarantees. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 11926–11935.
[Preprint] View | Files available | DOI | arXiv
 
[413]
2023 | Conference Paper | IST-REx-ID: 15023 | OA
Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. 2023. Compositional policy learning in stochastic control systems with formal guarantees. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[412]
2022 | Conference Paper | IST-REx-ID: 12102 | OA
Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. 2022. Algorithms and hardness results for computing cores of Markov chains. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 29.
[Published Version] View | Files available | DOI
 
[411]
2022 | Conference Paper | IST-REx-ID: 12101 | OA
Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2022. Complexity of spatial games. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 11:1-11:14.
[Published Version] View | Files available | DOI
 
[410]
2022 | Preprint | IST-REx-ID: 12677 | OA
Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. 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 MA. 2022. Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. 12(1), 1526.
[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. 106(3), 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. 18(6), e1010149.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[406]
2022 | Journal Article | IST-REx-ID: 9311 | OA
Chatterjee K, Saona Urmeneta RJ, Ziliotto B. 2022. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 47(1), 100–119.
[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. 129, 1–21.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[404]
2022 | Conference Paper | IST-REx-ID: 12000 | OA
Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. 2022. Sound and complete certificates for auantitative termination analysis of probabilistic programs. Proceedings of the 34th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13371, 55–78.
[Published Version] View | Files available | DOI | WoS
 
[403]
2022 | Journal Article | IST-REx-ID: 12511 | OA
Lechner M, Zikelic D, Chatterjee K, Henzinger TA. 2022. Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. 36(7), 7326–7336.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[402]
2022 | Preprint | IST-REx-ID: 14601 | OA
Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. arXiv, 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 TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. arXiv, 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 MH, Kale SS, Svozil A. 2021. Faster algorithms for bounded liveness in graphs and game graphs. 48th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 198, 124.
[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. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 42.
[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. 30th International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conferences on Artificial Intelligence Organization, 4182–4189.
[Published Version] View | DOI | Download Published Version (ext.)
 
[397]
2021 | Conference Paper | IST-REx-ID: 12767 | OA
Bansal S, Chatterjee K, Vardi MY. 2021. On satisficing in quantitative games. 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 12651, 20–37.
[Published Version] View | Files available | DOI | arXiv
 
[396]
2021 | Conference Paper | IST-REx-ID: 10667 | OA
Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, .
[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. 289(1), 392–415.
[Published Version] View | Files available | DOI | WoS
 
[394]
2021 | Journal Article | IST-REx-ID: 9381 | OA
Kleshnina M, Streipert SS, Filar JA, Chatterjee K. 2021. Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. 17(4), e1008523.
[Published Version] View | Files available | DOI | WoS
 
[393]
2021 | Journal Article | IST-REx-ID: 9640 | OA
Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2021. Fast and strong amplifiers of natural selection. Nature Communications. 12(1), 4009.
[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 AK. 2021. Quantitative analysis of assertion violations in probabilistic programs. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 1171–1186.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[391]
2021 | Conference Paper | IST-REx-ID: 9645 | OA
Asadi A, Chatterjee K, Fu H, Goharshady AK, Mahdavi M. 2021. Polynomial reachability witnesses via Stellensätze. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 772–787.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[390]
2021 | Conference Paper | IST-REx-ID: 10002 | OA
Chatterjee K, Dvorak W, Henzinger MH, Svozil A. 2021. Symbolic time and space tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.
[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. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.
[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. 33rd International Conference on Computer-Aided Verification . CAV: Computer Aided Verification , LNCS, vol. 12759, 341–366.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[387]
2021 | Journal Article | IST-REx-ID: 10191 | OA
Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 5(OOPSLA), 164.
[Published Version] View | Files available | DOI | arXiv
 
[386]
2021 | Journal Article | IST-REx-ID: 9293 | OA
Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2021. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 297(8), 103499.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[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. 57, 401–428.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[384]
2021 | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee K, Goharshady EK, Novotný P, Zárevúcky J, Zikelic D. 2021. On lexicographic proof rules for probabilistic termination. 24th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[383]
2021 | Conference Paper | IST-REx-ID: 9644 | OA
Chatterjee K, Goharshady EK, Novotný P, Zikelic D. 2021. Proving non-termination by program reversal. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 1033–1048.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[382]
2021 | Research Data Reference | IST-REx-ID: 15284 | OA
Chatterjee K, Goharshady AK, Novotný P, Zikelic D. 2021. RevTerm, Association for Computing Machinery, 10.1145/3410304.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[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. 11(1), 17443.
[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 MA. 2021. A unified framework of direct and indirect reciprocity. Nature Human Behaviour. 5(10), 1292–1302.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[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. Proceedings of the 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153, 21.
[Preprint] View | Files available | DOI | arXiv
 
[378]
2020 | Conference Paper | IST-REx-ID: 8600 | OA
Chatterjee K, Henzinger TA, Otop J. 2020. Multi-dimensional long-run average problems for vector addition systems with states. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 23.
[Published Version] View | Files available | DOI | arXiv
 
[377]
2020 | Conference Paper | IST-REx-ID: 8533 | OA
Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 22:1-22:13.
[Published Version] View | Files available | DOI | arXiv
 
[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. Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science . LICS: Symposium on Logic in Computer Science, 102–115.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[375]
2020 | Journal Article | IST-REx-ID: 8767 | OA
Kaveh K, McAvoy A, Chatterjee K, Nowak MA. 2020. The Moran process on 2-chromatic graphs. PLOS Computational Biology. 16(11), e1008402.
[Published Version] View | Files available | DOI | WoS
 
[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. 8(11), 1945.
[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. 39(11), 3981–3992.
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. Proceedings of the 30th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 30, 48–56.
View | Files available
 
[371]
2020 | Conference Paper | IST-REx-ID: 8272 | OA
Chatterjee K, Katoen JP, Weininger M, Winkler T. 2020. Stochastic games with lexicographic reachability-safety objectives. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 12225, 398–420.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[370]
2020 | Journal Article | IST-REx-ID: 7212 | OA
Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2020. Limits on amplifiers of natural selection under death-Birth updating. PLoS computational biology. 16, e1007494.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[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, 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. Proceedings of the ACM on Programming Languages. vol. 4, 25.
[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. 34(06), 9794–9801.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[366]
2020 | Conference Paper | IST-REx-ID: 7810 | OA
Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2020. Optimal and perfectly parallel algorithms for on-demand data-flow analysis. European Symposium on Programming. ESOP: Programming Languages and Systems, LNCS, vol. 12075, 112–140.
[Published Version] View | Files available | DOI | WoS
 
[365]
2020 | Conference Paper | IST-REx-ID: 8728 | OA
Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. 2020. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 12302, 253–270.
[Submitted Version] View | Files available | DOI | WoS
 
[364]
2020 | Conference Paper | IST-REx-ID: 8089 | OA
Chatterjee K, Fu H, Goharshady AK, Goharshady EK. 2020. Polynomial invariant generation for non-deterministic recursive programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 672–687.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[363]
2019 | Conference Paper | IST-REx-ID: 6887 | OA
Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 7.
[Published Version] View | Files available | DOI
 
[362]
2019 | Conference Paper | IST-REx-ID: 6885 | OA
Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 27.
[Published Version] View | Files available | DOI
 
[361]
2019 | Conference Paper | IST-REx-ID: 6889 | OA
Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.
[Published Version] View | Files available | DOI
 
[360]
2019 | Conference Paper | IST-REx-ID: 5948
Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs. International Conference on Verification, Model Checking, and Abstract Interpretation. VMCAI: Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 11388, 468–490.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[359]
2019 | Conference Paper | IST-REx-ID: 6462 | OA
Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. 2019. Run-time optimization for learned controllers through quantitative games. 31st International Conference on Computer-Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 11561, 630–649.
[Published Version] View | Files available | DOI | WoS
 
[358]
2019 | Journal Article | IST-REx-ID: 6836 | OA
Hauser OP, Hilbe C, Chatterjee K, Nowak MA. 2019. Social dilemmas among unequals. Nature. 572(7770), 524–527.
[Submitted Version] View | Files available | DOI | WoS
 
[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. 16th International Conference on Quantitative Evaluation of Systems. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11785, 109–128.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[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. International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated TEchnology for Verification and Analysis, LNCS, vol. 11781, 462–478.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[355]
2019 | Journal Article | IST-REx-ID: 7210 | OA
Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2019. Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. 2, 138.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[354]
2019 | Conference Paper | IST-REx-ID: 10190 | OA
Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 124.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[353]
2019 | Conference Paper | IST-REx-ID: 7402 | OA
Chatterjee K, Doyen L. 2019. Graph planning with expected finite horizon. 34th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[352]
2019 | Conference Paper | IST-REx-ID: 6780 | OA
Huang M, Fu H, Chatterjee K, Goharshady AK. 2019. Modular verification for almost-sure termination of probabilistic programs. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 129.
[Published Version] View | Files available | DOI | arXiv
 
[351]
2019 | Journal Article | IST-REx-ID: 6380 | OA
Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 3(POPL), 53.
[Published Version] View | Files available | DOI
 
[350]
2019 | Conference Paper | IST-REx-ID: 6056 | OA
Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Probabilistic smart contracts: Secure randomness on the blockchain. IEEE International Conference on Blockchain and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency, 8751326.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[349]
2019 | Conference Paper | IST-REx-ID: 6378 | OA
Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. Proceedings of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing vol. Part F147772, 374–381.
[Submitted Version] View | Files available | DOI | WoS
 
[348]
2019 | Conference Paper | IST-REx-ID: 6175 | OA
Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 204–220.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[347]
2019 | Conference Paper | IST-REx-ID: 6490 | OA
Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on Applied Computing vol. Part F147772, 400–408.
[Submitted Version] View | Files available | DOI | WoS
 
[346]
2019 | Journal Article | IST-REx-ID: 7158 | OA
Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 41(4), 23.
[Submitted Version] View | Files available | DOI | WoS
 
[345]
2019 | Journal Article | IST-REx-ID: 7014 | OA
Chatterjee K, Fu H, Goharshady AK. 2019. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 41(4), 20.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[344]
2018 | Conference Paper | IST-REx-ID: 10883 | OA
Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2018. Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253.
[Published Version] View | Files available | DOI | arXiv
 
[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. POPL: Principles of Programming Languages vol. 2, 34.
[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: Handbook of Model Checking. , 921–962.
View | DOI
 
[341]
2018 | Book Chapter | IST-REx-ID: 86 | OA
Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time. In: Principles of Modeling. LNCS, vol. 10760, 143–161.
[Submitted Version] View | Files available | DOI
 
[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. 9(1), 555.
[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. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033, 185–194.
[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. 559(7713), 246–249.
[Submitted Version] View | Files available | DOI | WoS
 
[337]
2018 | Conference Paper | IST-REx-ID: 310 | OA
Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. SODA: Symposium on Discrete Algorithms, 2341–2356.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[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. 16th Asian Symposium on Programming Languages and Systems, APLAS, LNCS, vol. 11275, 181–201.
[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. 2, 469–477.
[Submitted Version] View | Files available | DOI | WoS
 
[334]
2018 | Conference Paper | IST-REx-ID: 79 | OA
Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11024, 53–70.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[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. TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10805, 385–407.
[Published Version] View | Files available | DOI | WoS
 
[332]
2018 | Conference Paper | IST-REx-ID: 141 | OA
Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.
[Published Version] View | Files available | DOI | WoS
 
[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. 40(2), 7.
[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. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July, 4764–4770.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
[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. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.
[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. ICAPS: International Conference on Automated Planning and Scheduling, ICAPS, vol. 2018, 47–55.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[327]
2018 | Conference Paper | IST-REx-ID: 35 | OA
Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2018. Algorithms and conditional lower bounds for planning problems. 28th International Conference on Automated Planning and Scheduling . ICAPS: International Conference on Automated Planning and Scheduling.
View | Files available | Download None (ext.) | WoS | arXiv
 
[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. 54(1), 166–207.
[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. 15(140), 20180073.
[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 MA. 2018. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 1(1), 71.
[Published Version] View | Files available | DOI | WoS
 
[323]
2018 | Conference Paper | IST-REx-ID: 66 | OA
Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 118, 11.
[Published Version] View | Files available | DOI | arXiv
 
[322]
2018 | Conference Paper | IST-REx-ID: 311 | OA
Chatterjee K, Goharshady AK, Velner Y. 2018. Quantitative analysis of smart contracts. ESOP: European Symposium on Programming, LNCS, vol. 10801, 739–767.
[Published Version] View | Files available | DOI
 
[321]
2018 | Conference Paper | IST-REx-ID: 6340 | OA
Goharshady AK, Behrouz A, Chatterjee K. 2018. Secure Credit Reporting on the Blockchain. Proceedings of the IEEE International Conference on Blockchain. IEEE International Conference on Blockchain, 1343–1348.
[Submitted Version] View | Files available | DOI | WoS | arXiv
 
[320]
2018 | Journal Article | IST-REx-ID: 6009 | OA
Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2018. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 40(3), 9.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[319]
2018 | Conference Paper | IST-REx-ID: 5977 | OA
Chatterjee K, Fu H, Goharshady AK, Okati N. 2018. Computational approaches for stochastic shortest path on succinct MDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4700–4707.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[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. 115(48), 12241–12246.
[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 MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.
[Published Version] View | Files available | DOI | arXiv
 
[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. 13(2), 15.
[Published Version] View | Files available | DOI
 
[315]
2017 | Journal Article | IST-REx-ID: 467 | OA
Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[314]
2017 | Journal Article | IST-REx-ID: 465 | OA
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).
[Published Version] View | Files available | DOI
 
[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. 7(1), 82.
[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. 2(POPL), 30.
[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, 37p.
[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. 2(POPL), 31.
[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, 36p.
[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. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 61.
[Published Version] View | Files available | DOI
 
[307]
2017 | Conference Paper | IST-REx-ID: 552 | OA
Chatterjee K, Henzinger MH, Svozil A. 2017. Faster algorithms for mean-payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 39.
[Published Version] View | Files available | DOI
 
[306]
2017 | Conference Paper | IST-REx-ID: 553 | OA
Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 55.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[305]
2017 | Book Chapter | IST-REx-ID: 625 | OA
Chatterjee K, Doyen L, Henzinger TA. 2017.The cost of exactness in quantitative reachability. In: Models, Algorithms, Logics and Tools. LNCS, vol. 10460, 367–381.
[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. CAV: Computer Aided Verification, LNCS, vol. 10426, 118–139.
[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. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[302]
2017 | Conference Paper | IST-REx-ID: 6519 | OA
Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82, 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, Chatterjee K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 49(3), 358–366.
[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. 114(18), 4715–4720.
[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. 254, 296–315.
[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. 82(2), 420–452.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[297]
2017 | Conference Paper | IST-REx-ID: 711 | OA
Chatterjee K, Henzinger TA, Otop J. 2017. Bidirectional nested weighted automata. 28th International Conference on Concurrency Theory, CONCUR, LIPIcs, vol. 85, 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. 64(5), 34.
[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. 88, 236–259.
[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. 54(6), 543–544.
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. 23(2), 230–253.
[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. 84, 144–170.
[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, Vogelstein B, Nowak M. 2017. Reconstructing metastatic seeding patterns of human cancers. Nature Communications. 8, 14114.
[Published Version] View | Files available | DOI | WoS
 
[290]
2017 | Journal Article | IST-REx-ID: 1065 | OA
Chatterjee K, Osang GF. 2017. Pushdown reachability with constant treewidth. Information Processing Letters. 122, 25–29.
[Submitted Version] View | Files available | DOI | WoS
 
[289]
2017 | Journal Article | IST-REx-ID: 1066
Chatterjee K, Henzinger TA, Otop J, Velner Y. 2017. Quantitative fair simulation games. Information and Computation. 254(2), 143–166.
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. ESOP: European Symposium on Programming, LNCS, vol. 10201, 287–313.
[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. Proceedings of the 31st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 5, 3725–3732.
[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. 433, 64–72.
[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. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 52, 145–160.
[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, 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 AK. 2017. Non-polynomial worst case analysis of recursive programs. CAV: Computer Aided Verification, LNCS, vol. 10427, 41–63.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[282]
2017 | Conference Paper | IST-REx-ID: 949 | OA
Chatterjee K, Goharshady AK, Pavlogiannis A. 2017. JTDec: A tool for tree decompositions in soot. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 10482, 59–66.
[Submitted Version] View | Files available | DOI | WoS
 
[281]
2016 | Conference Paper | IST-REx-ID: 1068 | OA
Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2016. Conditionally optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 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. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98.
[Published Version] View | Files available | DOI
 
[279]
2016 | Conference Paper | IST-REx-ID: 1090 | OA
Chatterjee K, Henzinger TA, Otop J. 2016. Nested weighted limit-average automata of bounded width. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 24.
[Published Version] View | Files available | DOI
 
[278]
2016 | Conference Paper | IST-REx-ID: 1138 | OA
Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative automata under probabilistic semantics. Proceedings of the 31st Annual ACM/IEEE Symposium. LICS: Logic in Computer Science, 76–85.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[277]
2016 | Conference Paper | IST-REx-ID: 1140 | OA
Chatterjee K, Dvoák W, Henzinger MH, Loitzenbauer V. 2016. Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, , 197–206.
[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. IJCAI: International Joint Conference on Artificial Intelligence vol. 2016–January, 172–179.
[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. Proceedings of the ACM Conference on Computer Supported Cooperative Work. CSCW: Computer Supported Cooperative Work and Social Computing vol. 26, 365–368.
View | DOI
 
[274]
2016 | Conference Paper | IST-REx-ID: 1324
Chatterjee K, Chmelik M. 2016. Indefinite-horizon reachability in Goal-DEC-POMDPs. Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2016–January, 88–96.
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. Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. AAMAS: Autonomous Agents & Multiagent Systems, 1465–1466.
[Preprint] View | Download Preprint (ext.)
 
[272]
2016 | Conference Paper | IST-REx-ID: 1335 | OA
Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative monitor automata. SAS: Static Analysis Symposium, LNCS, vol. 9837, 23–38.
[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. ECAI: European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 285, 1432–1439.
[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. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, vol. 05-08-July-2016, 247–256.
[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. 82(5), 878–911.
[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. 234, 26–48.
[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, 33p.
[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. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2016, 3225–3232.
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, 22p.
[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, 34p.
[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, 34p.
[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. ESA: European Symposium on Algorithms, LIPIcs, vol. 57, 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. POPL: Principles of Programming Languages, POPL, vol. 20–22, 327–342.
[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, 32p.
[Published Version] View | Files available | DOI
 
[259]
2016 | Conference Paper | IST-REx-ID: 1437 | OA
Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL: Principles of Programming Languages, POPL, vol. 20–22, 733–747.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[258]
2016 | Conference Paper | IST-REx-ID: 1386 | OA
Chatterjee K, Fu H, Goharshady AK. 2016. Termination analysis of probabilistic programs through Positivstellensatz’s. CAV: Computer Aided Verification, LNCS, vol. 9779, 3–22.
[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. Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2015, 1018–1029.
[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. 112(51), 15636–15641.
[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. 42nd International Colloquium. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 108–120.
[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. 5, 17147.
[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. 471(2181), 20150114.
[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. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 233–238.
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. 60(9), 2291–2306.
View | DOI
 
[250]
2015 | Journal Article | IST-REx-ID: 1698 | OA
Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. 2015. The complexity of multi-mean-payoff and multi-energy games. Information and Computation. 241(4), 177–196.
[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. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence . IAAI: Innovative Applications of Artificial Intelligence, Artifical Intelligence, vol. 5, 3496–3502.
[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. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 9035, 517–532.
[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. 9035, 181–187.
[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. 221, 46–72.
[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. 115(1), 52–59.
[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. 573(3), 71–89.
[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 TA. 2015. Randomness for free. Information and Computation. 245(12), 3–16.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[242]
2015 | Journal Article | IST-REx-ID: 1856 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2015. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 62(1), 9.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[241]
2015 | Conference Paper | IST-REx-ID: 1661 | OA
Chatterjee K, Henzinger MH, Loitzenbauer V. 2015. Improved algorithms for one-pair and k-pair Streett objectives. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174888.
[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. 242(6), 25–52.
[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. 242(6), 2–24.
[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. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2, 745–752.
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. ICRA: International Conference on Robotics and Automation, 325–330.
[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, 25p.
[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. , 244–256.
View | Files available | DOI
 
[234]
2015 | Conference Paper | IST-REx-ID: 1656
Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174926.
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, 41p.
[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, 51p.
[Published Version] View | Files available | DOI
 
[231]
2015 | Technical Report | IST-REx-ID: 5436 | OA
Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria, 29p.
[Published Version] View | Files available | DOI
 
[230]
2015 | Conference Paper | IST-REx-ID: 1610 | OA
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata. 42nd International Colloquium. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 121–133.
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, 27p.
[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, 31p.
[Published Version] View | Files available | DOI
 
[227]
2015 | Technical Report | IST-REx-ID: 5438 | OA
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata, IST Austria, 15p.
[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, 18p.
[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, 29p.
[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, Vogelstein B, Nowak M. 2015. Reconstructing robust phylogenies of metastatic cancers, IST Austria, 25p.
[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, 23p.
[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. 282(1812).
[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. 47(2), 230–264.
[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. 50(1), 97–109.
[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 . 50(1), 539–551.
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. CAV: Computer Aided Verification, LNCS, vol. 9206, 140–157.
[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. Real-Time Systems Symposium. RTSS: Real-Time Systems Symposium vol. 2015, 118–127.
View | Files available | DOI
 
[216]
2015 | Technical Report | IST-REx-ID: 5441 | OA
Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 24p.
[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. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 259–268.
[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. 6(4), 413–437.
[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. CAV: Computer Aided Verification, LNCS, vol. 9206, 158–177.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[212]
2014 | Journal Article | IST-REx-ID: 1375 | OA
Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. 2014. Approximating the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.
[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. IOT: Internet of Things, 85–90.
View | DOI
 
[210]
2014 | Conference Paper | IST-REx-ID: 2027 | OA
Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of markov decision processes using learning algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ALENEX: Algorithm Engineering and Experiments, LNCS, vol. 8837, 98–114.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[209]
2014 | Journal Article | IST-REx-ID: 2187 | OA
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220.
[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. 10(1).
[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. 51(3–4), 129–163.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[206]
2014 | Journal Article | IST-REx-ID: 2141 | OA
Chatterjee K, Henzinger MH. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), a15.
[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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 544–559.
View | Files available | DOI
 
[204]
2014 | Conference Paper | IST-REx-ID: 1903
Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4.
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). 15(2), 16.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[202]
2014 | Journal Article | IST-REx-ID: 2038 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.
[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. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573, 122–133.
[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. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 242–257.
[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. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 210–225.
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. HSCC: Hybrid Systems - Computation and Control, 303–312.
[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, 33p.
[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, 33p.
[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, 31p.
[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. Lecture Notes in Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573, 110–121.
[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, 34p.
[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, 18p.
[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, 49p.
[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, 12p.
[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, 10p.
[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, 14p.
[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, 24p.
[Published Version] View | Files available | DOI
 
[186]
2014 | Technical Report | IST-REx-ID: 5415 | OA
Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.
[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, 27p.
[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. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 78–97.
[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. 10(9), 7p.
[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, 10.1371/journal.pcbi.1003818.s001.
[Published Version] View | Files available | DOI
 
[181]
2014 | Journal Article | IST-REx-ID: 535 | OA
Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2014. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492.
[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. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490.
View | Files available | DOI
 
[179]
2014 | Technical Report | IST-REx-ID: 5428 | OA
Chatterjee K, Henzinger TA, Otop J, Velner Y. 2014. Quantitative fair simulation games, IST Austria, 26p.
[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. 22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23, 181–196.
[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. 8312, 228–242.
View | DOI
 
[176]
2013 | Conference (Editor) | IST-REx-ID: 2292
Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.
View | DOI
 
[175]
2013 | Journal Article | IST-REx-ID: 2299 | OA
Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.
[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. 8044, 559–575.
[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. 8044, 543–558.
[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. 24(2), 165–185.
[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. 334, 26–34.
[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. Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control vol. 1, 273–282.
[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. 228–229, 83–119.
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. 26(4), 825–859.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[167]
2013 | Journal Article | IST-REx-ID: 2854 | OA
Chatterjee K, De Alfaro L, Henzinger TA. 2013. Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. 79(5), 640–657.
[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. 42(2), 142–174.
View | DOI
 
[165]
2013 | Journal Article | IST-REx-ID: 2831 | OA
Chatterjee K, Henzinger MH, Joglekar M, Shah N. 2013. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods in System Design. 42(3), 301–327.
[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. 8172, 118–132.
[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, 17p.
[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. 23, 165–180.
[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, 33p.
[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, 41p.
[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, 29p.
[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, 22p.
[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, 12p.
[Published Version] View | Files available | DOI
 
[156]
2013 | Conference Paper | IST-REx-ID: 1376
Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 18–25.
View | Files available | DOI
 
[155]
2013 | Technical Report | IST-REx-ID: 5406 | OA
Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL Fragments, IST Austria, 11p.
[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, 17p.
[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, 13p.
[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. 8052, 500–515.
[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, 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. 7th International Conference on Language and Automata Theory and Applications. LATA: Conference on Language and Automata Theory and ApplicationsLNCS, LNCS, vol. 7810, 214–225.
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. 8(12), e80814.
[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. 6(1), 34–45.
[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, Moon Y, Yaqubie A, Kelly N, Le D, Lipson E, Chapman P, Diaz L, Vogelstein B, Nowak M. 2013. Evolutionary dynamics of cancer in response to targeted combination therapy. eLife. 2, e00747.
[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. Proceedings of 25th Int. Conf. on Computer Aided Verification. CAV: Computer Aided VerificationLecture Notes in Computer Science, LNCS, vol. 8044, 101–106.
[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. 28th Annual ACM/IEEE Symposium. LICS: Logic in Computer Science, 331–340.
[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. Proceedings of the 16th International conference on Hybrid systems: Computation and control. HSCC: Hybrid Systems - Computation and Control, 163–172.
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. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 461–473.
[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. CONCUR 2012 - Concurrency Theory. CONCUR: Conference on Concurrency Theory, LNCS, vol. 7454, 115–131.
[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. 301, 161–173.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[140]
2012 | Conference Paper | IST-REx-ID: 2936 | OA
Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. roceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.
[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. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561, 385–399.
[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. CAV: Computer Aided Verification, LNCS, vol. 7358, 23–38.
[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. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 152–168.
[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. MEMICS: Mathematical and Engineering Methods in Computer Science, LNCS, vol. 7119, 37–46.
[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. 211, 29–48.
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. 23(3), 609–625.
View | DOI
 
[133]
2012 | Journal Article | IST-REx-ID: 3846 | OA
Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 78(2), 394–413.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[132]
2012 | Journal Article | IST-REx-ID: 3128 | OA
Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 43(2), 268–284.
[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. 458, 49–60.
[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. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16, 167–182.
[Published Version] View | Files available | DOI
 
[129]
2012 | Conference Paper | IST-REx-ID: 3165 | OA
Chatterjee K, Henzinger MH. 2012. An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1386–1399.
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. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280438.
View | Files available | DOI
 
[127]
2012 | Technical Report | IST-REx-ID: 5377 | OA
Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.
[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, 21p.
[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. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.
[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. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285.
[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. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280437.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[122]
2012 | Conference Paper | IST-REx-ID: 10905 | OA
Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2012. Polynomial-time algorithms for energy games with special weight structures. Algorithms – ESA 2012. ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.
[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. 81(1), 69–80.
[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 TA, Jobstmann B. 2011. Specification-centered robustness. 6th IEEE International Symposium on Industrial and Embedded Systems. SIES: International Symposium on Industrial Embedded Systems, 176–185.
[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. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6919, 145–159.
View | DOI
 
[118]
2011 | Conference Paper | IST-REx-ID: 3351 | OA
Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[117]
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4), 28.
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. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54, 74–86.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[115]
2011 | Conference Paper | IST-REx-ID: 3365 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605, 267–271.
[Submitted Version] View | Files available | DOI
 
[114]
2011 | Preprint | IST-REx-ID: 3363 | OA
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[113]
2011 | Journal Article | IST-REx-ID: 3315 | OA
Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).
[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, .
[Preprint] View | Download Preprint (ext.) | arXiv
 
[111]
2011 | Conference Paper | IST-REx-ID: 3342 | OA
Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. 2011. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. CAV: Computer Aided Verification, LNCS, vol. 6806, 260–276.
[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. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 216–226.
[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. LICS: Logic in Computer Science, 5970225.
[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. HSCC: Hybrid Systems - Computation and Control, 221–230.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[107]
2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee K. 2011. Graph games with reachability objectives. RP: Reachability Problems, LNCS, vol. 6945, 1–1.
View | DOI
 
[106]
2011 | Conference Paper | IST-REx-ID: 3343 | OA
Chatterjee K, Henzinger MH. 2011. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. SODA: Symposium on Discrete Algorithms, 1318–1336.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[105]
2011 | Conference Paper | IST-REx-ID: 3361 | OA
Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.
[Submitted Version] View | Files available | DOI
 
[104]
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.
View | DOI
 
[103]
2011 | Technical Report | IST-REx-ID: 5379 | OA
Chatterjee K, Henzinger MH. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p.
[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, 43p.
[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, 53p.
[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, 18p.
[Published Version] View | Files available | DOI
 
[99]
2011 | Preprint | IST-REx-ID: 3338 | OA
Chatterjee K. 2011. Bounded rationality in concurrent parity games. arXiv, 1–51, .
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[98]
2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.
[Submitted Version] View | Files available | DOI
 
[97]
2011 | Technical Report | IST-REx-ID: 5385 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.
[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, 30p.
[Published Version] View | Files available | DOI
 
[95]
2011 | Conference Paper | IST-REx-ID: 3366 | OA
Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.
[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. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907, 206–218.
[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, 20p.
[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. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 1–14.
[Submitted Version] View | Files available | DOI
 
[91]
2010 | Conference Paper | IST-REx-ID: 3856 | OA
Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[90]
2010 | Conference (Editor) | IST-REx-ID: 3859
Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p.
View | Files available | DOI
 
[89]
2010 | Conference Paper | IST-REx-ID: 3866 | OA
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174, 410–424.
[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. 6(3), 1–27.
[Published Version] View | Files available | DOI
 
[87]
2010 | Conference Paper | IST-REx-ID: 3853 | OA
Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.
[Submitted Version] View | Files available | DOI
 
[86]
2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee K, Horn F, Löding C. 2010. Obliging games. CONCUR: Concurrency Theory, LNCS, vol. 6269, 284–296.
View | DOI
 
[85]
2010 | Conference Paper | IST-REx-ID: 3851 | OA
Chatterjee K, Doyen L. 2010. Energy parity games. ICALP: Automata, Languages and Programming, 37th International Colloquium, LNCS, vol. 6199, 599–610.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[84]
2010 | Conference Paper | IST-REx-ID: 3860 | OA
Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 505–516.
[Submitted Version] View | Files available | DOI
 
[83]
2010 | Journal Article | IST-REx-ID: 3862 | OA
Chatterjee K, Doyen L, Henzinger TA. 2010. Quantitative languages. ACM Transactions on Computational Logic (TOCL). 11(4), 23.
[Submitted Version] View | Files available | DOI
 
[82]
2010 | Conference Paper | IST-REx-ID: 3864 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174, 380–395.
[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. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 293–307.
View | DOI
 
[80]
2010 | Journal Article | IST-REx-ID: 3863 | OA
Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy construction for parity games with imperfect information. Information and Computation. 208(10), 1206–1220.
[Submitted Version] View | Files available | DOI
 
[79]
2010 | Journal Article | IST-REx-ID: 3861 | OA
Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.
[Submitted Version] View | Files available | DOI
 
[78]
2010 | Journal Article | IST-REx-ID: 3867 | OA
Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.
[Published Version] View | Files available | DOI
 
[77]
2010 | Technical Report | IST-REx-ID: 5388 | OA
Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.
[Published Version] View | Files available | DOI
 
[76]
2010 | Conference Paper | IST-REx-ID: 4388 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.
[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, 21p.
[Published Version] View | Files available | DOI
 
[74]
2010 | Conference Paper | IST-REx-ID: 3857
Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words: decidability and undecidability results. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6252, 1–16.
View | Files available | DOI
 
[73]
2010 | Conference Paper | IST-REx-ID: 3855 | OA
Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 258–269.
[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. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 22–29.
[Published Version] View | Files available | DOI | arXiv
 
[71]
2009 | Conference Paper | IST-REx-ID: 3503 | OA
Chatterjee K, Henzinger TA. 2009. Probabilistic systems with limsup and liminf objectives. ILC: Infinity in Logic and Computation, LNCS, vol. 5489, 32–45.
View | DOI | Download (ext.)
 
[70]
2009 | Conference Paper | IST-REx-ID: 3871 | OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Probabilistic weighted automata. CONCUR: Concurrency Theory, LNCS, vol. 5710, 244–258.
[Submitted Version] View | Files available | DOI
 
[69]
2009 | Journal Article | IST-REx-ID: 3870 | OA
Chatterjee K, Henzinger TA, Horn F. 2009. Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). 11(1), 1.
[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. 5(2).
View | DOI
 
[67]
2009 | Conference Paper | IST-REx-ID: 4542 | OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata. FCT: Fundamentals of Computation Theory, LNCS, vol. 5699, 3–13.
[Submitted Version] View | Files available | DOI
 
[66]
2009 | Conference Paper | IST-REx-ID: 4545 | OA
Chatterjee K, Doyen L, Henzinger TA. 2009. A survey of stochastic games with limsup and liminf objectives. ICALP: Automata, Languages and Programming, LNCS, vol. 5556, 1–15.
[Submitted Version] View | Files available | DOI
 
[65]
2009 | Conference Paper | IST-REx-ID: 4543
Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734, 34–54.
View | DOI
 
[64]
2009 | Conference Paper | IST-REx-ID: 4544 | OA
Chatterjee K, De Alfaro L, Henzinger TA. 2009. Termination criteria for solving concurrent safety and reachability games. SODA: Symposium on Discrete Algorithms, 197–206.
View | Files available | DOI | Download (ext.)
 
[63]
2009 | Conference Paper | IST-REx-ID: 4540
Chatterjee K, Doyen L, Henzinger TA. 2009. Expressiveness and closure properties for quantitative languages. LICS: Logic in Computer Science, 199–208.
View | Files available | DOI
 
[62]
2009 | Conference Paper | IST-REx-ID: 4569 | OA
Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. 2009. Better quality in synthesis through quantitative objectives. CAV: Computer Aided Verification, LNCS, vol. 5643, 140–156.
[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 TA. 2009. Alpaga: A tool for solving parity games with imperfect information. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 5505, 58–61.
View | Files available | DOI | Download (ext.)
 
[60]
2009 | Technical Report | IST-REx-ID: 5393 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver for probabilistic games, IST Austria, 12p.
[Published Version] View | Files available | DOI
 
[59]
2009 | Technical Report | IST-REx-ID: 5394 | OA
Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.
[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, 17p.
[Published Version] View | Files available | DOI
 
[57]
2009 | Technical Report | IST-REx-ID: 5395 | OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Qualitative analysis of partially-observable Markov decision processes, IST Austria, 20p.
[Published Version] View | Files available | DOI
 
[56]
2008 | Conference Paper | IST-REx-ID: 3501
Adler BT, Chatterjee K, De Alfaro L, Faella M, Pye I, Raman V. 2008. Assigning trust to Wikipedia content. WikiSym: International Symposium on Wikis.
View | DOI
 
[55]
2008 | Conference Paper | IST-REx-ID: 3502
Chatterjee K, De Alfaro L, Pye I. 2008. Robust content-driven reputation. AISec: Artificial Intelligence and Security, 33–42.
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. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 2, 107–118.
[Published Version] View | Files available | DOI
 
[53]
2008 | Conference Paper | IST-REx-ID: 3875
Chatterjee K, Henzinger TA, Sen K. 2008. Model-checking omega-regular properties of interval Markov chains. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 4962, 302–317.
View | DOI
 
[52]
2008 | Conference Paper | IST-REx-ID: 3873
Chatterjee K, Majumdar R, Henzinger TA. 2008. Controller synthesis with budget constraints. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 4981, 72–86.
View | DOI
 
[51]
2008 | Conference Paper | IST-REx-ID: 3876
Chatterjee K, Henzinger TA, Prabhu V. 2008. Timed parity games: complexity and robustness. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 5215, 124–140.
View | Files available | DOI
 
[50]
2008 | Conference Paper | IST-REx-ID: 3877
Chatterjee K, Henzinger TA, Jobstmann B. 2008. Environment assumptions for synthesis. CONCUR: Concurrency Theory, LNCS, vol. 5201, 147–161.
View | DOI
 
[49]
2008 | Conference Paper | IST-REx-ID: 3878 | OA
Chatterjee K, De Alfaro L, Majumdar R. 2008. The complexity of coverage. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 5356, 91–106.
View | DOI | Download (ext.)
 
[48]
2008 | Conference Paper | IST-REx-ID: 3874
Chatterjee K, Henzinger TA, Prabhu V. 2008. Trading infinite memory for uniform randomness in timed games. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 4981, 87–100.
View | DOI
 
[47]
2008 | Conference Paper | IST-REx-ID: 3879
Chatterjee K, Doyen L, Henzinger TA. 2008. Quantitative languages. CSL: Computer Science Logic, LNCS, vol. 5213, 385–400.
View | DOI
 
[46]
2008 | Book Chapter | IST-REx-ID: 3872
Chatterjee K, Henzinger TA. 2008.Value iteration. In: 25 Years in Model Checking. LNCS, vol. 5000, 107–138.
View | DOI
 
[45]
2008 | Conference Paper | IST-REx-ID: 3880
Berwanger D, Chatterjee K, Doyen L, Henzinger TA, Raje S. 2008. Strategy construction for parity games with imperfect information. CONCUR: Concurrency Theory, LNCS, vol. 5201, 325–339.
View | Files available | DOI
 
[44]
2008 | Journal Article | IST-REx-ID: 4534
Chatterjee K, Henzinger TA. 2008. Reduction of stochastic parity to stochastic mean-payoff games. Information Processing Letters. 106(1), 1–7.
View | DOI | Download (ext.)
 
[43]
2008 | Conference Paper | IST-REx-ID: 4546
Chatterjee K, Ghosal A, Henzinger TA, Iercan D, Kirsch C, Pinello C, Sangiovanni Vincentelli A. 2008. Logical reliability of interacting real-time tasks. DATE: Design, Automation and Test in Europe, 909–914.
View | DOI | Download (ext.)
 
[42]
2008 | Journal Article | IST-REx-ID: 4548
Chatterjee K, Majumdar R, Henzinger TA. 2008. Stochastic limit-average games are in EXPTIME. International Journal of Game Theory. 37(2), 219–234.
View | DOI | Download (ext.)
 
[41]
2007 | Conference Paper | IST-REx-ID: 3883
Chatterjee K, Henzinger TA, Piterman N. 2007. Generalized parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 4423, 153–167.
View | DOI
 
[40]
2007 | Journal Article | IST-REx-ID: 3882
Chatterjee K. 2007. Concurrent games with tail objectives. Theoretical Computer Science. 388(1–3), 181–198.
View | DOI
 
[39]
2007 | Conference Paper | IST-REx-ID: 3884
Chatterjee K, Henzinger TA, Piterman N. 2007. Strategy logic. CONCUR: Concurrency Theory, LNCS, vol. 4703, 59–73.
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. QEST: Quantitative Evaluation of Systems, 237–248.
View | DOI
 
[37]
2007 | Conference Paper | IST-REx-ID: 3887
Chatterjee K. 2007. Markov decision processes with multiple long-run average objectives. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS , vol. 4855, 473–484.
View | DOI
 
[36]
2007 | Conference Paper | IST-REx-ID: 3886
Chatterjee K. 2007. Stochastic Müller games are PSPACE-complete. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS, vol. 4855, 436–448.
View | DOI
 
[35]
2007 | Conference Paper | IST-REx-ID: 3885
Chatterjee K. 2007. Optimal strategy synthesis in stochastic Müller games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS , vol. 4423, 138–152.
View | DOI
 
[34]
2007 | Conference Paper | IST-REx-ID: 4537
Chatterjee K, Henzinger TA. 2007. Assume-guarantee synthesis. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 4424, 261–275.
View | DOI
 
[33]
2007 | Journal Article | IST-REx-ID: 4547
Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2007. Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science. 3(184), 1–23.
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. CSF: Computer Security Foundations, 70–82.
View | DOI
 
[30]
2006 | Conference Paper | IST-REx-ID: 3499
Chatterjee K. 2006. Nash equilibrium for upward-closed objectives. CSL: Computer Science Logic, LNCS , vol. 4207, 271–286.
View | DOI
 
[29]
2006 | Conference Paper | IST-REx-ID: 3500
Chatterjee K, Henzinger TA, Piterman N. 2006. Algorithms for Büchi Games. GDV: Games in Design and Verification.
View | Download (ext.)
 
[28]
2006 | Conference Paper | IST-REx-ID: 3890
Chatterjee K, De Alfaro L, Henzinger TA. 2006. The complexity of quantitative concurrent parity games. SODA: Symposium on Discrete Algorithms, 678–687.
View | DOI
 
[27]
2006 | Conference Paper | IST-REx-ID: 3889
Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2006. Algorithms for omega-regular games with imperfect information. CSL: Computer Science Logic, LNCS, vol. 4207, 287–302.
View | DOI
 
[26]
2006 | Conference Paper | IST-REx-ID: 3891
Chatterjee K. 2006. Concurrent games with tail objectives. CSL: Computer Science Logic, LNCS , vol. 4207, 256–270.
View | DOI
 
[25]
2006 | Conference Paper | IST-REx-ID: 3888
Chatterjee K, Henzinger TA. 2006. Strategy improvement for stochastic Rabin and Streett games. CONCUR: Concurrency Theory, LNCS, vol. 4137, 375–389.
View | DOI
 
[24]
2006 | Conference Paper | IST-REx-ID: 4539
Chatterjee K, Henzinger TA. 2006. Finitary winning in omega-regular games. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 3920, 257–271.
View | DOI
 
[23]
2006 | Conference Paper | IST-REx-ID: 4538
Chatterjee K, Henzinger TA. 2006. Strategy improvement and randomized subexponential algorithms for stochastic parity games. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 3884, 512–523.
View | DOI
 
[22]
2006 | Conference Paper | IST-REx-ID: 4551
Chatterjee K, Majumdar R, Henzinger TA. 2006. Markov decision processes with multiple objectives. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 3884, 325–336.
View | DOI
 
[21]
2006 | Journal Article | IST-REx-ID: 4550
Chatterjee K, Henzinger TA, Jurdziński M. 2006. Games with secure equilibria. Theoretical Computer Science. 365(1–2), 67–82.
View | DOI
 
[20]
2006 | Conference Paper | IST-REx-ID: 4549
Chatterjee K, De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. 2006. Compositional quantitative reasoning. QEST: Quantitative Evaluation of Systems, 179–188.
View | DOI
 
[19]
2006 | Conference Paper | IST-REx-ID: 4552
Chatterjee K, De Alfaro L, Henzinger TA. 2006. Strategy improvement for concurrent reachability games. QEST: Quantitative Evaluation of Systems, 291–300.
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. IWDC: International Workshop on Distributed Computing , LNCS, vol. 3326, 89–102.
View | DOI
 
[17]
2005 | Conference Paper | IST-REx-ID: 3893
Chatterjee K. 2005. Two-player nonzero-sum ω-regular games. CONCUR: Concurrency Theory, LNCS , vol. 3653, 413–427.
View | DOI
 
[16]
2005 | Conference Paper | IST-REx-ID: 3892
Chatterjee K, Henzinger TA, Jurdziński M. 2005. Games with secure equilibria. FMCO: Formal Methods for Components and Objects, LNCS, vol. 3657, 141–161.
View | DOI
 
[15]
2005 | Conference Paper | IST-REx-ID: 4541
Chatterjee K, Henzinger TA. 2005. Semiperfect-information games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS, vol. 3821, 1–18.
View | DOI
 
[14]
2005 | Conference Paper | IST-REx-ID: 4553
Chatterjee K, De Alfaro L, Henzinger TA. 2005. The complexity of stochastic Rabin and Streett games. ICALP: Automata, Languages and Programming, LNCS, vol. 3580, 878–890.
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 4554
Chatterjee K, Henzinger TA, Jurdziński M. 2005. Mean-payoff parity games. LICS: Logic in Computer Science, 178–187.
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 4560
Chakrabarti A, Chatterjee K, Henzinger TA, Kupferman O, Majumdar R. 2005. Verifying quantitative properties using bound functions. CHARME: Correct Hardware Design and Verification Methods, LNCS, vol. 3725, 50–64.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 4557
Chatterjee K, Henzinger TA, Jhala R, Majumdar R. 2005. Counterexample-guided planning. UAI: Uncertainty in Artificial Intelligence, 104–111.
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. CSL: Computer Science Logic, LNCS , vol. 3210, 26–40.
View | DOI
 
[9]
2004 | Conference Paper | IST-REx-ID: 3895
Chatterjee K, Henzinger TA, Jurdziński M. 2004. Games with secure equilibria. LICS: Logic in Computer Science, 160–169.
View | DOI
 
[8]
2004 | Conference Paper | IST-REx-ID: 4555
Chatterjee K, De Alfaro L, Henzinger TA. 2004. Trading memory for randomness. QEST: Quantitative Evaluation of Systems, 206–217.
View | DOI
 
[7]
2004 | Conference Paper | IST-REx-ID: 4558
Chatterjee K, Jurdziński M, Henzinger TA. 2004. Quantitative stochastic parity games. SODA: Symposium on Discrete Algorithms, 121–130.
View
 
[6]
2004 | Journal Article | IST-REx-ID: 4556
Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2004. Stack size analysis for interrupt-driven programs. Information and Computation. 194(2), 144–174.
View | DOI
 
[5]
2003 | Conference Paper | IST-REx-ID: 3897
Chatterjee K, Jurdziński M, Henzinger TA. 2003. Simple stochastic parity games. CSL: Computer Science Logic, LNCS, vol. 2803, 100–113.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3898
Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2003. Stack size analysis for interrupt-driven programs. SAS: Static Analysis Symposium, LNCS, vol. 2694, 109–126.
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. 30(2), 205–232.
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. IT-Built: Information Technology For Built Environment.
View
 
[1]
2001 | Conference Paper | IST-REx-ID: 3447
Chatterjee K, Dasgupta P, Chakrabarti P. 2001. Weighted quantified computation tree logic. CIT: Conference on Information Technology.
View
 
Marked Publication(s)

Search

Filter Publications