342 Publications

Mark all

[342]
2019 | Conference Paper | IST-REx-ID: 6490
Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322
View | DOI
 
[341]
2019 | Conference Paper | IST-REx-ID: 5948
Fu, H., & Chatterjee, K. (2019). Termination of nondeterministic probabilistic programs. (C. Enea & R. Piskac, Eds.). Presented at the Verification, Model Checking, and Abstract Interpretation, VMCAI, Cascais, Portugal: Springer. https://doi.org/10.1007/978-3-030-11245-5_22
View | DOI
 
[340]
2019 | Conference Paper | IST-REx-ID: 6175   OA
Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (n.d.). Cost analysis of nondeterministic probabilistic programs. In 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019). Phoenix, AZ, United States.
View | Files available | arXiv
 
[339]
2019 | Conference Paper | IST-REx-ID: 6056   OA
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (n.d.). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE.
View | Files available | Download (ext.) | arXiv
 
[338]
2019 | Journal Article | IST-REx-ID: 6380   OA
Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages, 3(POPL), 53. https://doi.org/10.1145/3290366
View | Files available | DOI
 
[337]
2019 | Conference Paper | IST-REx-ID: 6378   OA
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (n.d.). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319
View | Files available | DOI
 
[336]
2019 | Conference Paper | IST-REx-ID: 6462   OA
Avni, G., Bloem, R., Chatterjee, K., Henzinger, T. A., Konighofer, B., & Pranger, S. (2019). Run-time optimization for learned controllers through quantitative games. In 31st International Conference on Computer-Aided Verification (Vol. 11561, pp. 630–649). New York, NY, United States: Springer. https://doi.org/10.1007/978-3-030-25540-4_36
View | Files available | DOI
 
[335]
2019 | Conference Paper | IST-REx-ID: 6780   OA
Huang, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (n.d.). Modular verification for almost-sure termination of probabilistic programs. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . Athens, Greece: ACM.
View | Files available | Download (ext.) | arXiv
 
[334]
2018 | Conference Paper | IST-REx-ID: 143   OA
Brázdil, T., Chatterjee, K., Kučera, A., Novotny, P., Velan, D., & Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE. https://doi.org/10.1145/3209108.3209191
View | DOI | Download (ext.)
 
[333]
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). https://doi.org/10.1098/rsif.2018.0073
View | Files available | DOI
 
[332]
2018 | Conference Paper | IST-REx-ID: 35   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.
View | Download (ext.) | arXiv
 
[331]
2018 | Book Chapter | IST-REx-ID: 59
Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.), Handbook of Modeling Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27
View | DOI
 
[330]
2018 | Conference Paper | IST-REx-ID: 66   OA
Chatterjee, K., Goharshady, A., Ibsen-Jensen, R., & Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. (Vol. 118, p. 11). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11
View | Files available | DOI | Download (ext.) | arXiv
 
[329]
2018 | Conference Paper | IST-REx-ID: 24   OA
Chatterjee, K., Elgyütt, A., Novotny, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652
View | DOI | Download (ext.) | arXiv
 
[328]
2018 | Conference Paper | IST-REx-ID: 310   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Loitzenbauer, V. (2018). Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter (pp. 2341–2356). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, USA: ACM. https://doi.org/10.1137/1.9781611975031.151
View | DOI | Download (ext.) | arXiv
 
[327]
2018 | Journal Article | IST-REx-ID: 6009   OA
Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems, 40(3), 9. https://doi.org/10.1145/3210257
View | Files available | DOI | Download (ext.) | arXiv
 
[326]
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. https://doi.org/10.1145/3174800
View | Files available | DOI | Download (ext.) | arXiv
 
[325]
2018 | Conference Paper | IST-REx-ID: 6340   OA
Goharshady, A. K., Behrouz, A., & Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In Proceedings of the IEEE International Conference on Blockchain (pp. 1343–1348). Halifax, Canada: IEEE.
View | Files available | arXiv
 
[324]
2018 | Conference Paper | IST-REx-ID: 79   OA
Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., & Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. https://doi.org/10.1007/978-3-319-99154-2_4
View | DOI | Download (ext.) | arXiv
 
[323]
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. https://doi.org/10.1007/s11241-017-9293-4
View | Files available | DOI
 
[322]
2018 | Book Chapter | IST-REx-ID: 86
Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9
View | DOI
 
[321]
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. https://doi.org/10.1038/s41467-017-02721-8
View | Files available | DOI
 
[320]
2018 | Journal Article | IST-REx-ID: 157
Hilbe, C., Šimsa, Š., Chatterjee, K., & Nowak, M. (2018). Evolution of cooperation in stochastic games. Nature, 559(7713), 246–249. https://doi.org/10.1038/s41586-018-0277-x
View | Files available | DOI
 
[319]
2018 | Conference Paper | IST-REx-ID: 25
Horák, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/662
View | DOI
 
[318]
2018 | Conference Paper | IST-REx-ID: 311   OA
Chatterjee, K., Goharshady, A., & Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89884-1_26
View | Files available | DOI
 
[317]
2018 | Conference Paper | IST-REx-ID: 141   OA
Chatterjee, K., Henzinger, M., Loitzenbauer, V., Oraee, S., & Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13
View | Files available | DOI
 
[316]
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. https://doi.org/10.1073/pnas.1810565115
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[315]
2018 | Conference Paper | IST-REx-ID: 297   OA
Brázdil, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89960-2_21
View | Files available | DOI
 
[314]
2018 | Conference Paper | IST-REx-ID: 325   OA
Agrawal, S., Chatterjee, K., & Novotny, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122
View | DOI | Download (ext.) | arXiv
 
[313]
2018 | Conference Paper | IST-REx-ID: 34   OA
Chatterjee, K., Chemlík, M., & Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press.
View | Download (ext.) | arXiv
 
[312]
2018 | Journal Article | IST-REx-ID: 419
Hilbe, C., Chatterjee, K., & Nowak, M. (2018). Partners and rivals in direct reciprocity. Nature Human Behaviour, 2, 469–477. https://doi.org/10.1038/s41562-018-0320-9
View | Files available | DOI
 
[311]
2018 | Conference Paper | IST-REx-ID: 5679   OA
Huang, M., Fu, H., & Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. https://doi.org/10.1007/978-3-030-02768-1_11
View | DOI | Download (ext.) | arXiv
 
[310]
2018 | Preprint | IST-REx-ID: 5977   OA
Chatterjee, K., Fu, H., Goharshady, A., & Okati, N. (n.d.). Computational Approaches for Stochastic Shortest Path on Succinct MDPs. ArXiv. ArXiv.
View | Download (ext.) | arXiv
 
[309]
2018 | Journal Article | IST-REx-ID: 5751   OA
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology, 1(1), 71. https://doi.org/10.1038/s42003-018-0078-7
View | Files available | DOI
 
[308]
2017 | Journal Article | IST-REx-ID: 1065
Chatterjee, K., & Osang, G. F. (2017). Pushdown reachability with constant treewidth. Information Processing Letters, 122, 25–29. https://doi.org/10.1016/j.ipl.2017.02.003
View | Files available | DOI
 
[307]
2017 | Journal Article | IST-REx-ID: 1407
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. https://doi.org/10.1016/j.nahs.2016.04.006
View | Files available | DOI | Download (ext.)
 
[306]
2017 | Journal Article | IST-REx-ID: 465
Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science, 13(3). https://doi.org/10.23638/LMCS-13(3:23)2017
View | Files available | DOI
 
[305]
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. https://doi.org/10.1016/j.ic.2016.10.012
View | DOI | Download (ext.)
 
[304]
2017 | Journal Article | IST-REx-ID: 744
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. https://doi.org/10.1016/j.jtbi.2017.08.025
View | DOI
 
[303]
2017 | Conference Paper | IST-REx-ID: 1009   OA
Chatterjee, K., Novotny, P., Pérez, G., Raskin, J., & Zikelic, D. (2017). Optimizing expectation with guarantees in POMDPs. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3725–3732). San Francisco, CA, United States: AAAI Press.
View | Download (ext.)
 
[302]
2017 | Conference Paper | IST-REx-ID: 1011   OA
Chatterjee, K., Kragl, B., Mishra, S., & Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54434-1_11
View | DOI | Download (ext.)
 
[301]
2017 | Journal Article | IST-REx-ID: 1080   OA
Reiter, J., Makohon Moore, A., Gerold, J., Božić, I., Chatterjee, K., Iacobuzio Donahue, C., … Nowak, M. (2017). Reconstructing metastatic seeding patterns of human cancers. Nature Communications, 8. https://doi.org/10.1038/ncomms14114
View | Files available | DOI
 
[300]
2017 | Journal Article | IST-REx-ID: 1294
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. https://doi.org/10.1016/j.jcss.2016.09.009
View | Files available | DOI
 
[299]
2017 | Journal Article | IST-REx-ID: 466
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. https://doi.org/10.23638/LMCS-13(2:15)2017
View | Files available | DOI
 
[298]
2017 | Journal Article | IST-REx-ID: 1066
Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2017). Quantitative fair simulation games. Information and Computation, 254(2), 143–166. https://doi.org/10.1016/j.ic.2016.10.006
View | Files available | DOI
 
[297]
2017 | Journal Article | IST-REx-ID: 512
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports, 7(1). https://doi.org/10.1038/s41598-017-00107-w
View | Files available | DOI
 
[296]
2017 | Technical Report | IST-REx-ID: 5455   OA
Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria. https://doi.org/10.15479/AT:IST-2017-870-v1-1
View | Files available | DOI
 
[295]
2017 | Book Chapter | IST-REx-ID: 625
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, & R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460, pp. 367–381). Springer. https://doi.org/10.1007/978-3-319-63121-9_18
View | DOI
 
[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. https://doi.org/10.1007/s00236-017-0299-0
View | DOI
 
[293]
2017 | Conference Paper | IST-REx-ID: 1194   OA
Chatterjee, K., Novotny, P., & Zikelic, D. (2017). Stochastic invariants for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles of Programming Languages, Paris, France: ACM. https://doi.org/10.1145/3009837.3009873
View | DOI | Download (ext.)
 
[292]
2017 | Journal Article | IST-REx-ID: 467
Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL), 18(4), 31. https://doi.org/10.1145/3152769
View | Files available | DOI | Download (ext.) | arXiv
 
[291]
2017 | Technical Report | IST-REx-ID: 5456   OA
Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. IST Austria. https://doi.org/10.15479/AT:IST-2017-872-v1-1
View | Files available | DOI
 
[290]
2017 | Conference Paper | IST-REx-ID: 551   OA
Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.61
View | Files available | DOI
 
[289]
2017 | Conference Paper | IST-REx-ID: 645   OA
Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., & Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_10
View | DOI | Download (ext.)
 
[288]
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. https://doi.org/10.1073/pnas.1621239114
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[287]
2017 | Conference Paper | IST-REx-ID: 552   OA
Chatterjee, K., Henzinger, M., & Svozil, A. (2017). Faster algorithms for mean payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.39
View | Files available | DOI
 
[286]
2017 | Conference Paper | IST-REx-ID: 639   OA
Chatterjee, K., Fu, H., & Goharshady, A. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63390-9_3
View | DOI | Download (ext.)
 
[285]
2017 | Journal Article | IST-REx-ID: 653
Makohon Moore, A., Zhang, M., Reiter, J., Božić, I., Allen, B., Kundu, D., … Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics, 49(3), 358–366. https://doi.org/10.1038/ng.3764
View | DOI
 
[284]
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. https://doi.org/10.1017/jsl.2016.71
View | DOI | Download (ext.)
 
[283]
2017 | Conference Paper | IST-REx-ID: 711   OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Bidirectional nested weighted automata (Vol. 85). Presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.5
View | Files available | DOI
 
[282]
2017 | Journal Article | IST-REx-ID: 716
Chatterjee, K., & Velner, Y. (2017). The complexity of mean-payoff pushdown games. Journal of the ACM, 64(5), 34. https://doi.org/10.1145/3121408
View | DOI
 
[281]
2017 | Conference Paper | IST-REx-ID: 949   OA
Chatterjee, K., Goharshady, A., & Pavlogiannis, A. (2017). JTDec: A tool for tree decompositions in soot. In D. D’Souza (Ed.) (Vol. 10482, pp. 59–66). Presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India: Springer. https://doi.org/10.1007/978-3-319-68167-2_4
View | Files available | DOI
 
[280]
2017 | Journal Article | IST-REx-ID: 464   OA
Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science, 13(3). https://doi.org/10.23638/LMCS-13(3:26)2017
View | Files available | DOI
 
[279]
2017 | Conference Paper | IST-REx-ID: 553   OA
Chatterjee, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.55
View | Files available | DOI | Download (ext.)
 
[278]
2017 | Conference Paper | IST-REx-ID: 628   OA
Chatterjee, K., Fu, H., & Murhekar, A. (2017). Automated recurrence analysis for almost linear expected runtime bounds. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 118–139). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_6
View | DOI | Download (ext.)
 
[277]
2017 | Conference Paper | IST-REx-ID: 6519   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82, p. 18). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.CSL.2017.18
View | Files available | DOI
 
[276]
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. https://doi.org/10.1016/j.jcss.2017.04.005
View | Files available | DOI | Download (ext.)
 
[275]
2017 | Research Data | IST-REx-ID: 5559
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak , M. (2017). Strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:ISTA:51
View | Files available | DOI
 
[274]
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee, K., Chmelik, M., & Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.
View | Files available
 
[273]
2016 | Conference Paper | IST-REx-ID: 1438
Chatterjee, K., Fu, H., Novotny, P., & Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837639
View | Files available | DOI | Download (ext.) | arXiv
 
[272]
2016 | Conference Paper | IST-REx-ID: 478   OA
Chatterjee, K., & Ibsen-Jensen, R. (2016). The complexity of deciding legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands: IOS Press. https://doi.org/10.3233/978-1-61499-672-9-1432
View | Files available | DOI
 
[271]
2016 | Conference Paper | IST-REx-ID: 480   OA
Chatterjee, K., & Doyen, L. (2016). Perfect-information stochastic games with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934513
View | DOI | Download (ext.)
 
[270]
2016 | Journal Article | IST-REx-ID: 1477
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. https://doi.org/10.1016/j.jcss.2016.02.009
View | Files available | DOI | Download (ext.) | arXiv
 
[269]
2016 | Conference Paper | IST-REx-ID: 1182   OA
Chatterjee, K., Ibsen-Jensen, R., & Tkadlec, J. (2016). Robust draws in balanced knockout tournaments (Vol. 2016–January, pp. 172–179). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA: AAAI Press.
View | Files available | Download (ext.)
 
[268]
2016 | Conference Paper | IST-REx-ID: 1245
Pandey, V., & Chatterjee, K. (2016). Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In Proceedings of the ACM Conference on Computer Supported Cooperative Work (Vol. 26, pp. 365–368). San Francisco, CA, USA: ACM. https://doi.org/10.1145/2818052.2869122
View | DOI
 
[267]
2016 | Conference Paper | IST-REx-ID: 1327   OA
Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., & Novotny, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 1465–1466). Singapore: ACM.
View | Download (ext.)
 
[266]
2016 | Journal Article | IST-REx-ID: 1529
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence, 234, 26–48. https://doi.org/10.1016/j.artint.2016.01.007
View | Files available | DOI | Download (ext.) | arXiv
 
[265]
2016 | Technical Report | IST-REx-ID: 5449   OA
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Amplification on undirected population structures: Comets beat stars. IST Austria. https://doi.org/10.15479/AT:IST-2016-648-v1-1
View | Files available | DOI
 
[264]
2016 | Technical Report | IST-REx-ID: 5451   OA
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2016-728-v1-1
View | Files available | DOI
 
[263]
2016 | Conference Paper | IST-REx-ID: 1068   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Loitzenbauer, V. (2016). Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.25
View | Files available | DOI
 
[262]
2016 | Conference Paper | IST-REx-ID: 1070   OA
Chatterjee, K., & Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.98
View | Files available | DOI
 
[261]
2016 | Conference Paper | IST-REx-ID: 1138   OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Quantitative automata under probabilistic semantics. In Proceedings of the 31st Annual ACM/IEEE Symposium (pp. 76–85). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2933588
View | DOI | Download (ext.)
 
[260]
2016 | Conference Paper | IST-REx-ID: 1140   OA
Chatterjee, K., Dvoák, W., Henzinger, M., & Loitzenbauer, V. (2016). Model and objective separation with conditional lower bounds disjunction is harder than conjunction. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 197–206). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2935304
View | DOI | Download (ext.)
 
[259]
2016 | Conference Paper | IST-REx-ID: 1335   OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Quantitative monitor automata (Vol. 9837, pp. 23–38). Presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-53413-7_2
View | DOI | Download (ext.)
 
[258]
2016 | Technical Report | IST-REx-ID: 5445   OA
Chatterjee, K., Pavlogiannis, A., & Velner, Y. (2016). Quantitative interprocedural analysis. IST Austria. https://doi.org/10.15479/AT:IST-2016-523-v1-1
View | Files available | DOI
 
[257]
2016 | Technical Report | IST-REx-ID: 5452
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-728-v2-1
View | Files available | DOI
 
[256]
2016 | Conference Paper | IST-REx-ID: 1090   OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.24
View | Files available | DOI
 
[255]
2016 | Conference Paper | IST-REx-ID: 1324
Chatterjee, K., & Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling (Vol. 2016–January, pp. 88–96). London, United Kingdom: AAAI Press.
View | Download (ext.)
 
[254]
2016 | Conference Paper | IST-REx-ID: 1386   OA
Chatterjee, K., Fu, H., & Goharshady, A. (2016). Termination analysis of probabilistic programs through Positivstellensatz’s (Vol. 9779, pp. 3–22). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. https://doi.org/10.1007/978-3-319-41528-4_1
View | DOI | Download (ext.)
 
[253]
2016 | Technical Report | IST-REx-ID: 5453   OA
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-749-v3-1
View | Files available | DOI
 
[252]
2016 | Conference Paper | IST-REx-ID: 1071
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs (Vol. 57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ESA.2016.28
View | Files available | DOI
 
[251]
2016 | Conference Paper | IST-REx-ID: 1437
Chatterjee, K., Goharshady, A., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837624
View | Files available | DOI | Download (ext.) | arXiv
 
[250]
2015 | Conference Paper | IST-REx-ID: 1609   OA
Chatterjee, K., Doyen, L., & Vardi, M. (2015). The complexity of synthesis from probabilistic components. Presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan: Springer. https://doi.org/10.1007/978-3-662-47666-6_9
View | DOI | Download (ext.)
 
[249]
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. https://doi.org/10.1098/rspa.2015.0114
View | Files available | DOI
 
[248]
2015 | Conference Paper | IST-REx-ID: 1820   OA
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Optimal cost almost-sure reachability in POMDPs. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3496–3502). Austin, TX, USA: AAAI Press.
View | Files available | Download (ext.) | arXiv
 
[247]
2015 | Journal Article | IST-REx-ID: 1856
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. Journal of the ACM, 62(1). https://doi.org/10.1145/2699430
View | Files available | DOI | Download (ext.)
 
[246]
2015 | Journal Article | IST-REx-ID: 1731
Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2015). Randomness for free. Information and Computation, 245(12), 3–16. https://doi.org/10.1016/j.ic.2015.06.003
View | Files available | DOI | Download (ext.)
 
[245]
2015 | Conference Paper | IST-REx-ID: 1661
Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July, p. 7174888). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.34
View | Files available | DOI | Download (ext.)
 
[244]
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. https://doi.org/10.1016/j.ic.2015.03.010
View | Files available | DOI | Download (ext.)
 
[243]
2015 | Technical Report | IST-REx-ID: 5430
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-319-v1-1
View | Files available | DOI
 
[242]
2015 | Technical Report | IST-REx-ID: 5435   OA
Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2015-318-v2-1
View | Files available | DOI
 
[241]
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. https://doi.org/10.1145/2676726.2676968
View | Files available | DOI
 
[240]
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. https://doi.org/10.1073/pnas.1511366112
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[239]
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. https://doi.org/10.1038/srep17147
View | Files available | DOI
 
[238]
2015 | Journal Article | IST-REx-ID: 1698   OA
Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., & Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. Information and Computation, 241(4), 177–196. https://doi.org/10.1016/j.ic.2015.03.001
View | DOI | Download (ext.)
 
[237]
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. https://doi.org/10.3390/g6040413
View | Files available | DOI
 
[236]
2015 | Conference Paper | IST-REx-ID: 1838   OA
Bloem, R., Chatterjee, K., Jacobs, S., & Könighofer, R. (2015). Assume-guarantee synthesis for concurrent reactive programs with partial information (Vol. 9035, pp. 517–532). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_50
View | DOI | Download (ext.)
 
[235]
2015 | Journal Article | IST-REx-ID: 524
Chatterjee, K., & Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. Information and Computation, 242(6), 2–24. https://doi.org/10.1016/j.ic.2015.03.009
View | Files available | DOI | Download (ext.) | arXiv
 
[234]
2015 | Conference Paper | IST-REx-ID: 1732
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE. https://doi.org/10.1109/ICRA.2015.7139019
View | Files available | DOI | Download (ext.) | arXiv
 
[233]
2015 | Technical Report | IST-REx-ID: 5429
Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2015-318-v1-1
View | Files available | DOI
 
[232]
2015 | Technical Report | IST-REx-ID: 5443   OA
Chatterjee, K., Chmelik, M., & Davies, J. (2015). A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria. https://doi.org/10.15479/AT:IST-2015-325-v2-1
View | Files available | DOI
 
[231]
2015 | Technical Report | IST-REx-ID: 5431   OA
Chatterjee, K., Ibsen-Jensen, R., & Hansen, K. (2015). The patience of concurrent stochastic games with safety and reachability objectives. IST Austria. https://doi.org/10.15479/AT:IST-2015-322-v1-1
View | Files available | DOI
 
[230]
2015 | Technical Report | IST-REx-ID: 5436   OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-170-v2-2
View | Files available | DOI
 
[229]
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. https://doi.org/10.1109/TAC.2015.2404612
View | DOI
 
[228]
2015 | Conference Paper | IST-REx-ID: 1839   OA
Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2015). Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_12
View | DOI | Download (ext.)
 
[227]
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. https://doi.org/10.1016/j.ipl.2014.09.001
View | DOI | Download (ext.)
 
[226]
2015 | Journal Article | IST-REx-ID: 1598
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. https://doi.org/10.1016/j.tcs.2015.01.050
View | Files available | DOI | Download (ext.)
 
[225]
2015 | Conference Paper | IST-REx-ID: 1656
Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July, p. 7174926). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.72
View | Files available | DOI | arXiv
 
[224]
2015 | Technical Report | IST-REx-ID: 5437   OA
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-330-v2-1
View | Files available | DOI
 
[223]
2015 | Technical Report | IST-REx-ID: 5444   OA
Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue, C., … Nowak, M. (2015). Reconstructing robust phylogenies of metastatic cancers. IST Austria. https://doi.org/10.15479/AT:IST-2015-399-v1-1
View | Files available | DOI
 
[222]
2015 | Technical Report | IST-REx-ID: 5432
Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v1-1
View | Files available | DOI
 
[221]
2015 | Conference Paper | IST-REx-ID: 1714
Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2015). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In Real-Time Systems Symposium (Vol. 2015, pp. 118–127). Rome, Italy: IEEE. https://doi.org/10.1109/RTSS.2014.9
View | Files available | DOI
 
[220]
2015 | Journal Article | IST-REx-ID: 1873   OA
Chatterjee, K., & Chmelik, M. (2015). POMDPs under probabilistic semantics. Artificial Intelligence, 221, 46–72. https://doi.org/10.1016/j.artint.2014.12.009
View | DOI | Download (ext.) | arXiv
 
[219]
2015 | Conference Paper | IST-REx-ID: 1481
Ahmed, U., Chatterjee, K., & Gulwani, S. (2015). Automatic generation of alternative starting positions for simple traditional board games (Vol. 2, pp. 745–752). Presented at the AAAI: Conference on Artificial Intelligence, Austin, TX, USA: AAAI Press.
View | Files available | Download (ext.)
 
[218]
2015 | Conference Paper | IST-REx-ID: 1657
Chatterjee, K., Komárková, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.32
View | Files available | DOI
 
[217]
2015 | Technical Report | IST-REx-ID: 5438   OA
Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-334-v1-1
View | Files available | DOI
 
[216]
2015 | Journal Article | IST-REx-ID: 1501
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. https://doi.org/10.1007/s10703-015-0235-2
View | Files available | DOI | Download (ext.)
 
[215]
2015 | Technical Report | IST-REx-ID: 5440
Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v2-2
View | Files available | DOI
 
[214]
2015 | Journal Article | IST-REx-ID: 1602
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. https://doi.org/10.1145/2676726.2676979
View | Files available | DOI | Download (ext.) | arXiv
 
[213]
2015 | Conference Paper | IST-REx-ID: 1607
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs (Vol. 9206, pp. 140–157). Presented at the CAV: Computer Aided Verification, San Francisco, CA, USA: Springer. https://doi.org/10.1007/978-3-319-21690-4_9
View | Files available | DOI | Download (ext.)
 
[212]
2015 | Conference Paper | IST-REx-ID: 1689   OA
Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2015). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 259–268). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728608
View | Files available | DOI | Download (ext.)
 
[211]
2015 | Conference Paper | IST-REx-ID: 1691
Svoreňová, M., Chmelik, M., Leahy, K., Eniser, H., Chatterjee, K., Cěrná, I., & Belta, C. (2015). Temporal logic motion planning using POMDPs with parity objectives: Case study paper. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 233–238). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728617
View | DOI
 
[210]
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). https://doi.org/10.1098/rspb.2015.1041
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[209]
2015 | Conference Paper | IST-REx-ID: 1610
Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. Presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan: Springer. https://doi.org/10.1007/978-3-662-47666-6_10
View | Files available | DOI
 
[208]
2015 | Conference Paper | IST-REx-ID: 1603
Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., & Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21690-4_10
View | Files available | DOI | Download (ext.)
 
[207]
2015 | Technical Report | IST-REx-ID: 5441
Chatterjee, K., Ibsen-Jensen, R., Goharshady, A., & Pavlogiannis, A. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria. https://doi.org/10.15479/AT:IST-2015-340-v1-1
View | Files available | DOI
 
[206]
2014 | Journal Article | IST-REx-ID: 1375   OA
Chatterjee, K., Henzinger, M., Krinninger, S., Loitzenbauer, V., & Raskin, M. (2014). Approximating the minimum cycle mean. Theoretical Computer Science, 547(C), 104–116. https://doi.org/10.1016/j.tcs.2014.06.031
View | DOI | Download (ext.)
 
[205]
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). https://doi.org/10.2168/LMCS-10(1:13)2014
View | Files available | DOI | Download (ext.)
 
[204]
2014 | Journal Article | IST-REx-ID: 535   OA
Chatterjee, K., Henzinger, M., Krinninger, S., & Nanongkai, D. (2014). Polynomial time algorithms for energy games with special weight structures. Algorithmica, 70(3), 457–492. https://doi.org/10.1007/s00453-013-9843-7
View | DOI | Download (ext.)
 
[203]
2014 | Technical Report | IST-REx-ID: 5423   OA
Chatterjee, K., Kössler, A., Pavlogiannis, A., & Schmid, U. (2014). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria. https://doi.org/10.15479/AT:IST-2014-300-v1-1
View | Files available | DOI
 
[202]
2014 | Technical Report | IST-REx-ID: 5428   OA
Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2014). Quantitative fair simulation games. IST Austria. https://doi.org/10.15479/AT:IST-2014-315-v1-1
View | Files available | DOI
 
[201]
2014 | Conference Paper | IST-REx-ID: 2063
Chatterjee, K., Chmelik, M., & Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-08867-9_31
View | Files available | DOI
 
[200]
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. https://doi.org/10.1007/s00236-013-0182-6
View | DOI | Download (ext.)
 
[199]
2014 | Journal Article | IST-REx-ID: 2141
Chatterjee, K., & Henzinger, M. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM, 61(3). https://doi.org/10.1145/2597631
View | Files available | DOI | Download (ext.)
 
[198]
2014 | Journal Article | IST-REx-ID: 2038
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL), 15(4), 27. https://doi.org/10.1145/2629686
View | Files available | DOI
 
[197]
2014 | Journal Article | IST-REx-ID: 2211
Chatterjee, K., & Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL), 15(2), 16. https://doi.org/10.1145/2579821
View | Files available | DOI | Download (ext.) | arXiv
 
[196]
2014 | Conference Paper | IST-REx-ID: 1903
Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer. https://doi.org/10.1007/978-3-662-44522-8_1
View | Files available | DOI
 
[195]
2014 | Conference Paper | IST-REx-ID: 2216
Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2014). Edit distance for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany: Springer. https://doi.org/10.1145/2562059.2562141
View | Files available | DOI | Download (ext.)
 
[194]
2014 | Technical Report | IST-REx-ID: 5412
Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v1-1
View | Files available | DOI
 
[193]
2014 | Technical Report | IST-REx-ID: 5424
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. https://doi.org/10.15479/AT:IST-2014-305-v1-1
View | Files available | DOI
 
[192]
2014 | Conference Paper | IST-REx-ID: 1853
Jha, S., Tripakis, S., Seshia, S., & Chatterjee, K. (2014). Game theoretic secure localization in wireless sensor networks (pp. 85–90). Presented at the IOT: Internet of Things, Cambridge, USA: IEEE. https://doi.org/10.1109/IOT.2014.7030120
View | DOI
 
[191]
2014 | Conference Paper | IST-REx-ID: 2027   OA
Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez & J.-F. Raskin (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 98–114). Sydney, Australia: Society of Industrial and Applied Mathematics. https://doi.org/10.1007/978-3-319-11936-6_8
View | DOI | Download (ext.)
 
[190]
2014 | Conference Paper | IST-REx-ID: 2212
Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2014). Perfect-information stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-54830-7_14
View | Files available | DOI
 
[189]
2014 | Technical Report | IST-REx-ID: 5413
Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v2-2
View | Files available | DOI
 
[188]
2014 | Technical Report | IST-REx-ID: 5418   OA
Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. IST Austria. https://doi.org/10.15479/AT:IST-2014-176-v1-1
View | Files available | DOI
 
[187]
2014 | Technical Report | IST-REx-ID: 5420   OA
Chatterjee, K., & Ibsen-Jensen, R. (2014). The value 1 problem for concurrent mean-payoff games. IST Austria. https://doi.org/10.15479/AT:IST-2014-191-v1-1
View | Files available | DOI
 
[186]
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). https://doi.org/10.1371/journal.pcbi.1003818
View | Files available | DOI
 
[185]
2014 | Conference Paper | IST-REx-ID: 2054
Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_37
View | Files available | DOI
 
[184]
2014 | Conference Paper | IST-REx-ID: 2213
Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2014). The complexity of partial-observation stochastic parity games with finite-memory strategies (Vol. 8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-54830-7_16
View | Files available | DOI | Download (ext.) | arXiv
 
[183]
2014 | Conference Paper | IST-REx-ID: 2162
Chatterjee, K., & Ibsen-Jensen, R. (2014). The complexity of ergodic mean payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer. https://doi.org/10.1007/978-3-662-43951-7_11
View | Files available | DOI | Download (ext.) | arXiv
 
[182]
2014 | Technical Report | IST-REx-ID: 5426   OA
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. https://doi.org/10.15479/AT:IST-2014-305-v2-1
View | Files available | DOI
 
[181]
2014 | Technical Report | IST-REx-ID: 5419   OA
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-187-v1-1
View | Files available | DOI
 
[180]
2014 | Technical Report | IST-REx-ID: 5414   OA
Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v3-1
View | Files available | DOI
 
[179]
2014 | Technical Report | IST-REx-ID: 5421   OA
Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2014). The complexity of evolution on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-190-v2-2
View | Files available | DOI
 
[178]
2014 | Journal Article | IST-REx-ID: 2187   OA
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B., … Könighofer, R. (2014). Synthesizing robust systems. Acta Informatica, 51(3–4), 193–220. https://doi.org/10.1007/s00236-013-0191-5
View | Files available | DOI
 
[177]
2014 | Conference Paper | IST-REx-ID: 2163
Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. In Lecture Notes in Computer Science (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer. https://doi.org/10.1007/978-3-662-43951-7_10
View | Files available | DOI | Download (ext.) | arXiv
 
[176]
2014 | Technical Report | IST-REx-ID: 5427   OA
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-314-v1-1
View | Files available | DOI
 
[175]
2014 | Technical Report | IST-REx-ID: 5415
Chatterjee, K., Henzinger, T. A., & Otop, J. (2014). Nested weighted automata. IST Austria. https://doi.org/10.15479/AT:IST-2014-170-v1-1
View | Files available | DOI
 
[174]
2013 | Journal Article | IST-REx-ID: 2816   OA
Božić, I., Reiter, J., Allen, B., Antal, T., Chatterjee, K., Shah, P., … Nowak, M. (2013). Evolutionary dynamics of cancer in response to targeted combination therapy. ELife, 2. https://doi.org/10.7554/eLife.00747
View | Files available | DOI
 
[173]
2013 | Journal Article | IST-REx-ID: 2854   OA
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2013). Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences, 79(5), 640–657. https://doi.org/10.1016/j.jcss.2012.12.001
View | Files available | DOI
 
[172]
2013 | Technical Report | IST-REx-ID: 5404   OA
Chatterjee, K., & Ibsen-Jensen, R. (2013). The complexity of ergodic games. IST Austria. https://doi.org/10.15479/AT:IST-2013-127-v1-1
View | Files available | DOI
 
[171]
2013 | Technical Report | IST-REx-ID: 5409   OA
Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2013). Edit distance for timed automata. IST Austria. https://doi.org/10.15479/AT:IST-2013-144-v1-1
View | Files available | DOI
 
[170]
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). https://doi.org/10.1371/journal.pone.0080814
View | Files available | DOI
 
[169]
2013 | Conference (Editor) | IST-REx-ID: 2292
Chatterjee, K., & Sgall, J. (Eds.). (2013). Mathematical Foundations of Computer Science 2013 (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical Foundations of Computer Science, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40313-2
View | DOI
 
[168]
2013 | Conference Paper | IST-REx-ID: 2444   OA
Chatterjee, K., & Ła̧Cki, J. (2013). Faster algorithms for Markov decision processes with low treewidth. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_36
View | DOI | Download (ext.) | arXiv
 
[167]
2013 | Conference Paper | IST-REx-ID: 2305   OA
Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2013). Trading performance for stability in Markov decision processes. In 28th Annual ACM/IEEE Symposium (pp. 331–340). New Orleans, LA, United States: IEEE. https://doi.org/10.1109/LICS.2013.39
View | Files available | DOI | Download (ext.) | arXiv
 
[166]
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, 228229, 83–119. https://doi.org/10.1016/j.ic.2013.04.003
View | DOI
 
[165]
2013 | Journal Article | IST-REx-ID: 2831   OA
Chatterjee, K., Henzinger, M., 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. https://doi.org/10.1007/s10703-012-0180-2
View | DOI | Download (ext.) | arXiv
 
[164]
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. https://doi.org/10.1007/s00165-013-0283-6
View | DOI | Download (ext.) | arXiv
 
[163]
2013 | Journal Article | IST-REx-ID: 2817   OA
Novak, S., Chatterjee, K., & Nowak, M. (2013). Density games. Journal of Theoretical Biology, 334, 26–34. https://doi.org/10.1016/j.jtbi.2013.05.029
View | Files available | DOI
 
[162]
2013 | Technical Report | IST-REx-ID: 5400   OA
Chatterjee, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with ω-regular objectives. IST Austria. https://doi.org/10.15479/AT:IST-2013-109-v1-1
View | Files available | DOI
 
[161]
2013 | Conference Paper | IST-REx-ID: 1376
Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In 13th International Conference on Formal Methods in Computer-Aided Design (pp. 18–25). Portland, OR, United States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679386
View | Files available | DOI
 
[160]
2013 | Technical Report | IST-REx-ID: 5405   OA
Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2013). Perfect-information stochastic mean-payoff parity games. IST Austria. https://doi.org/10.15479/AT:IST-2013-128-v1-1
View | Files available | DOI
 
[159]
2013 | Conference Paper | IST-REx-ID: 2329
Chatterjee, K., & Velner, Y. (2013). Hyperplane separation technique for multidimensional mean-payoff games. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentinia: Springer. https://doi.org/10.1007/978-3-642-40184-8_35
View | Files available | DOI | Download (ext.) | arXiv
 
[158]
2013 | Conference Paper | IST-REx-ID: 2279
Chatterjee, K., Doyen, L., Randour, M., & Raskin, J. (2013). Looking at mean-payoff and total-payoff through windows. Presented at the ATVA: Automated Technology for Verification and Analysis, Hanoi, Vietnam: Springer. https://doi.org/10.1007/978-3-319-02444-8_10
View | Files available | DOI | Download (ext.)
 
[157]
2013 | Technical Report | IST-REx-ID: 5406   OA
Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013). Distributed synthesis for LTL Fragments. IST Austria. https://doi.org/10.15479/AT:IST-2013-130-v1-1
View | Files available | DOI
 
[156]
2013 | Conference Paper | IST-REx-ID: 2820
Chatterjee, K., Kößler, A., & Schmid, U. (2013). Automated analysis of real-time scheduling using graph games. In Proceedings of the 16th International conference on Hybrid systems: Computation and control (pp. 163–172). Philadelphia, PA, United States: ACM. https://doi.org/10.1145/2461328.2461356
View | Files available | DOI
 
[155]
2013 | Conference Paper | IST-REx-ID: 2446   OA
Chatterjee, K., Gaiser, A., & Kretinsky, J. (2013). Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_37
View | DOI | Download (ext.) | arXiv
 
[154]
2013 | Journal Article | IST-REx-ID: 2299   OA
Godhal, Y., Chatterjee, K., & Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer, 15(5–6), 585–601. https://doi.org/10.1007/s10009-011-0207-9
View | Files available | DOI
 
[153]
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. https://doi.org/10.1142/S0129054113400066
View | DOI | Download (ext.) | arXiv
 
[152]
2013 | Conference Paper | IST-REx-ID: 2819   OA
Chatterjee, K., & Prabhu, V. (2013). Quantitative timed simulation functions and refinement metrics for real-time systems. In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control (Vol. 1, pp. 273–282). Philadelphia, PA USA: Springer. https://doi.org/10.1145/2461328.2461370
View | DOI | Download (ext.)
 
[151]
2013 | Technical Report | IST-REx-ID: 5399   OA
Reiter, J., Bozic, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for Tumor Progression. IST Austria. https://doi.org/10.15479/AT:IST-2013-104-v1-1
View | Files available | DOI
 
[150]
2013 | Conference Paper | IST-REx-ID: 1374   OA
Chatterjee, K., & Fijalkow, N. (2013). Infinite-state games with finitary conditions. In 22nd EACSL Annual Conference on Computer Science Logic (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.181
View | Files available | DOI
 
[149]
2013 | Conference Paper | IST-REx-ID: 2238
Chatterjee, K., Forejt, V., & Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_17
View | DOI
 
[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. https://doi.org/10.1111/eva.12020
View | Files available | DOI
 
[147]
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. https://doi.org/10.1007/s10703-012-0170-4
View | DOI
 
[146]
2013 | Conference Paper | IST-REx-ID: 2295
Chatterjee, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.165
View | Files available | DOI
 
[145]
2013 | Technical Report | IST-REx-ID: 5403   OA
Chatterjee, K., & Ibsen-Jensen, R. (2013). Qualitative analysis of concurrent mean-payoff games. IST Austria. https://doi.org/10.15479/AT:IST-2013-126-v1-1
View | Files available | DOI
 
[144]
2013 | Conference Paper | IST-REx-ID: 2000
Reiter, J., Božić, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for tumor progression. In Proceedings of 25th Int. Conf. on Computer Aided Verification (Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_6
View | Files available | DOI | Download (ext.) | arXiv
 
[143]
2013 | Technical Report | IST-REx-ID: 5410   OA
Ahmed, U., Chatterjee, K., & Gulwani, S. (2013). Automatic generation of alternative starting positions for traditional board games. IST Austria. https://doi.org/10.15479/AT:IST-2013-146-v1-1
View | Files available | DOI
 
[142]
2013 | Technical Report | IST-REx-ID: 5408   OA
Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2013). The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria. https://doi.org/10.15479/AT:IST-2013-141-v1-1
View | Files available | DOI
 
[141]
2012 | Conference Paper | IST-REx-ID: 2715   OA
Chatterjee, K., Joglekar, M., & Shah, N. (2012). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Vol. 18, pp. 461–473). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461
View | Files available | DOI
 
[140]
2012 | Conference Paper | IST-REx-ID: 2936   OA
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2012). Finite automata with time delay blocks. In roceedings of the tenth ACM international conference on Embedded software (pp. 43–52). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380370
View | DOI | Download (ext.)
 
[139]
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. https://doi.org/10.1142/S0129054112400308
View | DOI
 
[138]
2012 | Conference Paper | IST-REx-ID: 2955
Chatterjee, K., & Doyen, L. (2012). Partial-observation stochastic games: How to win when belief fails. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science (p. 6280436). Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.28
View | Files available | DOI | Download (ext.) | arXiv
 
[137]
2012 | Technical Report | IST-REx-ID: 5377   OA
Chatterjee, K., & Velner, Y. (2012). Mean-payoff pushdown games. IST Austria. https://doi.org/10.15479/AT:IST-2012-0002
View | Files available | DOI
 
[136]
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. https://doi.org/10.1016/j.jtbi.2012.02.021
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[135]
2012 | Conference Paper | IST-REx-ID: 3252   OA
Chatterjee, K., & Raman, V. (2012). Synthesizing protocols for digital contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_11
View | DOI | Download (ext.)
 
[134]
2012 | Journal Article | IST-REx-ID: 3846   OA
Chatterjee, K., & Henzinger, T. A. (2012). A survey of stochastic ω regular games. Journal of Computer and System Sciences, 78(2), 394–413. https://doi.org/10.1016/j.jcss.2011.05.002
View | Files available | DOI
 
[133]
2012 | Conference Paper | IST-REx-ID: 497
Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2012.167
View | Files available | DOI
 
[132]
2012 | Conference Paper | IST-REx-ID: 2956
Chatterjee, K., & Velner, Y. (2012). Mean payoff pushdown games. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.30
View | Files available | DOI
 
[131]
2012 | Technical Report | IST-REx-ID: 5378   OA
Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations. IST Austria. https://doi.org/10.15479/AT:IST-2012-0001
View | Files available | DOI
 
[130]
2012 | Conference Paper | IST-REx-ID: 3341
Chatterjee, K. (2012). Robustness of structurally equivalent concurrent parity games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia: Springer. https://doi.org/10.1007/978-3-642-28729-9_18
View | Files available | DOI | Download (ext.) | arXiv
 
[129]
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. https://doi.org/10.1016/j.tpb.2011.11.003
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[128]
2012 | Conference Paper | IST-REx-ID: 2957
Chatterjee, K., & Tracol, M. (2012). Decidable problems for probabilistic automata on infinite words. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science (p. 6280437). Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.29
View | Files available | DOI | Download (ext.) | arXiv
 
[127]
2012 | Journal Article | IST-REx-ID: 2972   OA
Chatterjee, K., & Doyen, L. (2012). Energy parity games. Theoretical Computer Science, 458, 49–60. https://doi.org/10.1016/j.tcs.2012.07.038
View | Files available | DOI
 
[126]
2012 | Journal Article | IST-REx-ID: 3254
Chatterjee, K. (2012). The complexity of stochastic Müller games. Information and Computation, 211, 29–48. https://doi.org/10.1016/j.ic.2011.11.004
View | DOI | Download (ext.)
 
[125]
2012 | Conference Paper | IST-REx-ID: 3165
Chatterjee, K., & Henzinger, M. (2012). An O(n2) time algorithm for alternating Büchi games. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1386–1399). Kyoto, Japan: SIAM. https://doi.org/10.1137/1.9781611973099.109
View | Files available | DOI
 
[124]
2012 | Conference Paper | IST-REx-ID: 2947   OA
Chatterjee, K., Chmelik, M., & Majumdar, R. (2012). Equivalence of games with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399). Presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India: Springer. https://doi.org/10.1007/978-3-642-33386-6_30
View | DOI | Download (ext.)
 
[123]
2012 | Conference Paper | IST-REx-ID: 3135   OA
Brázdil, B., Chatterjee, K., Kučera, A., & Novotny, P. (2012). Efficient controller synthesis for consumption games with multiple resource types (Vol. 7358, pp. 23–38). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer. https://doi.org/10.1007/978-3-642-31424-7_8
View | DOI | Download (ext.)
 
[122]
2012 | Journal Article | IST-REx-ID: 3128   OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2012). A survey of partial-observation stochastic parity games. Formal Methods in System Design, 43(2), 268–284. https://doi.org/10.1007/s10703-012-0164-2
View | Files available | DOI
 
[121]
2012 | Conference Paper | IST-REx-ID: 3255
Chatterjee, K., & Doyen, L. (2012). Games and Markov decision processes with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-25929-6_3
View | DOI
 
[120]
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee, K., Henzinger, T. A., & Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, & C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_17
View | DOI
 
[119]
2011 | Conference Paper | IST-REx-ID: 3345
Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland: Springer. https://doi.org/10.1007/978-3-642-22993-0_21
View | Files available | DOI | Download (ext.) | arXiv
 
[118]
2011 | Technical Report | IST-REx-ID: 5384   OA
Chatterjee, K., & Tracol, M. (2011). Decidable problems for probabilistic automata on infinite words. IST Austria. https://doi.org/10.15479/AT:IST-2011-0004
View | Files available | DOI
 
[117]
2011 | Journal Article | IST-REx-ID: 3338
Chatterjee, K. (2011). Bounded rationality in concurrent parity games. CoRR: Computing Research Repository, 1–51.
View | Files available | Download (ext.) | arXiv
 
[116]
2011 | Conference Paper | IST-REx-ID: 3346   OA
Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, A. (2011). Two views on multiple mean payoff objectives in Markov Decision Processes. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.10
View | DOI | Download (ext.)
 
[115]
2011 | Journal Article | 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. CoRR: Computing Research Repository.
View | Download (ext.) | arXiv
 
[114]
2011 | Conference Paper | IST-REx-ID: 3365   OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. https://doi.org/10.1007/978-3-642-19835-9_24
View | Files available | DOI
 
[113]
2011 | Journal Article | IST-REx-ID: 3315
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games: Complexity and robustness. Logical Methods in Computer Science, 7(4). https://doi.org/10.2168/LMCS-7(4:8)2011
View | Files available | DOI
 
[112]
2011 | Technical Report | IST-REx-ID: 5380   OA
Chatterjee, K. (2011). Bounded rationality in concurrent parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0008
View | Files available | DOI
 
[111]
2011 | Technical Report | IST-REx-ID: 5385   OA
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003
View | Files available | DOI
 
[110]
2011 | Conference Paper | IST-REx-ID: 3347   OA
Chatterjee, K., & Fijalkow, N. (2011). Finitary languages. In A.-H. Dediu, S. Inenaga, & C. Martín-Vide (Eds.) (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_16
View | DOI | Download (ext.)
 
[109]
2011 | Conference Paper | IST-REx-ID: 3342   OA
Chatterjee, K., Henzinger, M., Joglekar, M., & Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_21
View | DOI | Download (ext.) | arXiv
 
[108]
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL), 12(4). https://doi.org/10.1145/1970398.1970404
View | Files available | DOI
 
[107]
2011 | Conference Paper | IST-REx-ID: 3316
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2011). Specification-centered robustness (pp. 176–185). Presented at the SIES: International Symposium on Industrial Embedded Systems, Vasteras, Sweden: IEEE. https://doi.org/10.1109/SIES.2011.5953660
View | DOI
 
[106]
2011 | Conference Paper | IST-REx-ID: 3361   OA
Cerny, P., Chatterjee, K., & Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. https://doi.org/10.1109/CSF.2011.21
View | Files available | DOI
 
[105]
2011 | Technical Report | IST-REx-ID: 5381   OA
Chatterjee, K., & Doyen, L. (2011). Partial-observation stochastic games: How to win when belief fails. IST Austria. https://doi.org/10.15479/AT:IST-2011-0007
View | Files available | DOI
 
[104]
2011 | Technical Report | IST-REx-ID: 5379   OA
Chatterjee, K., & Henzinger, M. (2011). An O(n2) time algorithm for alternating Büchi games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0009
View | Files available | DOI
 
[103]
2011 | Conference Paper | IST-REx-ID: 3366
Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_20
View | Files available | DOI
 
[102]
2011 | Conference Paper | IST-REx-ID: 3348   OA
Chatterjee, K., & Prabhu, V. (2011). Synthesis of memory efficient real time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA: Springer. https://doi.org/10.1145/1967701.1967734
View | DOI | Download (ext.)
 
[101]
2011 | Conference Paper | IST-REx-ID: 3350
Chatterjee, K., & Majumdar, R. (2011). Minimum attention controller synthesis for omega regular objectives. In U. Fahrenberg & S. Tripakis (Eds.) (Vol. 6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark: Springer. https://doi.org/10.1007/978-3-642-24310-3_11
View | DOI
 
[100]
2011 | Conference Paper | IST-REx-ID: 3343   OA
Chatterjee, K., & Henzinger, M. (2011). Faster and dynamic algorithms for maximal end component decomposition and related graph problems in probabilistic verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms, San Francisco, USA: SIAM. https://doi.org/10.1137/1.9781611973082.101
View | DOI | Download (ext.)
 
[99]
2011 | Technical Report | IST-REx-ID: 5382   OA
Chatterjee, K. (2011). Robustness of structurally equivalent concurrent parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0006
View | Files available | DOI
 
[98]
2011 | Technical Report | IST-REx-ID: 5387   OA
Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2011-0001
View | Files available | DOI
 
[97]
2011 | Preprint | IST-REx-ID: 3363   OA
Chatterjee, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.
View | Download (ext.) | arXiv
 
[96]
2011 | Conference Paper | IST-REx-ID: 3349   OA
Chatterjee, K., & Fijalkow, N. (2011). A reduction from parity games to simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. https://doi.org/10.4204/EPTCS.54.6
View | DOI | Download (ext.)
 
[95]
2011 | Conference Paper | IST-REx-ID: 3351   OA
Chatterjee, K., Doyen, L., & Singh, R. (2011). On memoryless quantitative objectives. In O. Owe, M. Steffen, & J. A. Telle (Eds.) (Vol. 6914, pp. 148–159). Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer. https://doi.org/10.1007/978-3-642-22953-4_13
View | DOI | Download (ext.)
 
[94]
2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee, K. (2011). Graph games with reachability objectives. In G. Delzanno & I. Potapov (Eds.) (Vol. 6945, pp. 1–1). Presented at the RP: Reachability Problems, Genoa, Italy: Springer. https://doi.org/10.1007/978-3-642-24288-5_1
View | DOI
 
[93]
2011 | Conference Paper | IST-REx-ID: 3356
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33
View | Files available | DOI
 
[92]
2010 | Conference Paper | IST-REx-ID: 3852   OA
Chatterjee, K., & Majumdar, R. (2010). Discounting in games across time scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. https://doi.org/10.4204/EPTCS.25.6
View | Files available | DOI | Download (ext.) | arXiv
 
[91]
2010 | Conference Paper | IST-REx-ID: 3864   OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer. https://doi.org/10.1007/978-3-642-14295-6_34
View | Files available | DOI | Download (ext.)
 
[90]
2010 | Conference Paper | IST-REx-ID: 3857
Chatterjee, K., & Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer. https://doi.org/10.1007/978-3-642-15643-4_1
View | Files available | DOI
 
[89]
2010 | Conference Paper | IST-REx-ID: 3853   OA
Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., & Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_19
View | Files available | DOI
 
[88]
2010 | Conference Paper | IST-REx-ID: 3858
Chatterjee, K., & Doyen, L. (2010). The complexity of partial-observation parity games. In C. Fermüller & A. Voronkov (Eds.) (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. https://doi.org/10.1007/978-3-642-16242-8_1
View | DOI
 
[87]
2010 | Conference Paper | IST-REx-ID: 3865
Chatterjee, K., De Alfaro, L., Raman, V., & Sánchez, C. (2010). Analyzing the impact of change in multi-threaded programs. In D. Rosenblum & G. Taenzer (Eds.) (Vol. 6013, pp. 293–307). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. https://doi.org/10.1007/978-3-642-12029-9_21
View | DOI
 
[86]
2010 | Conference Paper | IST-REx-ID: 3860   OA
Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505
View | Files available | DOI
 
[85]
2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee, K., Horn, F., & Löding, C. (2010). Obliging games (Vol. 6269, pp. 284–296). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_20
View | DOI
 
[84]
2010 | Conference Paper | IST-REx-ID: 3866   OA
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, & P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_36
View | Files available | DOI
 
[83]
2010 | Journal Article | IST-REx-ID: 3861
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2010). Strategy logic. Information and Computation, 208(6), 677–693. https://doi.org/10.1016/j.ic.2009.07.004
View | Files available | DOI
 
[82]
2010 | Conference (Editor) | IST-REx-ID: 3859
Chatterjee, K., & Henzinger, T. A. (Eds.). (2010). FORMATS: Formal modeling and analysis of timed systems (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-15297-9
View | DOI
 
[81]
2010 | Conference Paper | IST-REx-ID: 4388
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_57
View | Files available | DOI | Download (ext.) | arXiv
 
[80]
2010 | Journal Article | IST-REx-ID: 3862   OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Quantitative languages. ACM Transactions on Computational Logic (TOCL), 11(4), 23. https://doi.org/10.1145/1805950.1805953
View | Files available | DOI
 
[79]
2010 | Conference Paper | IST-REx-ID: 3855
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_24
View | Files available | DOI
 
[78]
2010 | Journal Article | IST-REx-ID: 3867
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science, 6(3), 1–23. https://doi.org/10.2168/LMCS-6(3:10)2010
View | Files available | DOI
 
[77]
2010 | Conference Paper | IST-REx-ID: 3851   OA
Chatterjee, K., & Doyen, L. (2010). Energy parity games (Vol. 6199, pp. 599–610). Presented at the ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France: Springer. https://doi.org/10.1007/978-3-642-14162-1_50
View | DOI | Download (ext.) | arXiv
 
[76]
2010 | Conference Paper | IST-REx-ID: 3856   OA
Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_23
View | Files available | DOI | Download (ext.)
 
[75]
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. https://doi.org/10.2168/LMCS-6(3:13)2010
View | Files available | DOI
 
[74]
2010 | Journal Article | IST-REx-ID: 3863
Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. Information and Computation, 208(10), 1206–1220. https://doi.org/10.1016/j.ic.2009.09.006
View | Files available | DOI
 
[73]
2010 | Technical Report | IST-REx-ID: 5388   OA
Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria. https://doi.org/10.15479/AT:IST-2010-0004
View | Files available | DOI
 
[72]
2010 | Technical Report | IST-REx-ID: 5390   OA
Chatterjee, K., & Fijalkow, N. (2010). Topological, automata-theoretic and logical characterization of finitary languages. IST Austria. https://doi.org/10.15479/AT:IST-2010-0002
View | Files available | DOI
 
[71]
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). https://doi.org/10.2168/LMCS-5(2:7)2009
View | DOI
 
[70]
2009 | Conference Paper | IST-REx-ID: 3871   OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Probabilistic weighted automata (Vol. 5710, pp. 244–258). Presented at the CONCUR: Concurrency Theory, Bologna, Italy: Springer. https://doi.org/10.1007/978-3-642-04081-8_17
View | Files available | DOI
 
[69]
2009 | Conference Paper | IST-REx-ID: 4545   OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). A survey of stochastic games with limsup and liminf objectives (Vol. 5556, pp. 1–15). Presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece: Springer. https://doi.org/10.1007/978-3-642-02930-1_1
View | Files available | DOI
 
[68]
2009 | Conference Paper | IST-REx-ID: 4569   OA
Bloem, R., Chatterjee, K., Henzinger, T. A., & Jobstmann, B. (2009). Better quality in synthesis through quantitative objectives (Vol. 5643, pp. 140–156). Presented at the CAV: Computer Aided Verification, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-02658-4_14
View | DOI | Download (ext.) | arXiv
 
[67]
2009 | Conference Paper | IST-REx-ID: 4540
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Expressiveness and closure properties for quantitative languages (pp. 199–208). Presented at the LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.2009.16
View | Files available | DOI
 
[66]
2009 | Technical Report | IST-REx-ID: 5392   OA
Chatterjee, K. (2009). Probabilistic automata on infinite words: Decidability and undecidability results. IST Austria. https://doi.org/10.15479/AT:IST-2009-0004
View | Files available | DOI
 
[65]
2009 | Conference Paper | IST-REx-ID: 4580   OA
Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T. A. (2009). Alpaga: A tool for solving parity games with imperfect information (Vol. 5505, pp. 58–61). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. https://doi.org/10.1007/978-3-642-00768-2_7
View | Files available | DOI | Download (ext.)
 
[64]
2009 | Conference Paper | IST-REx-ID: 4542   OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Alternating weighted automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland: Springer. https://doi.org/10.1007/978-3-642-03409-1_2
View | Files available | DOI
 
[63]
2009 | Technical Report | IST-REx-ID: 5393   OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2009). Gist: A solver for probabilistic games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0003
View | Files available | DOI
 
[62]
2009 | Conference Paper | IST-REx-ID: 4543
Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Stochastic games with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia: Springer. https://doi.org/10.1007/978-3-642-03816-7_4
View | DOI
 
[61]
2009 | Technical Report | IST-REx-ID: 5394   OA
Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Improved lower bounds for request-response and finitary Streett games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0002
View | Files available | DOI
 
[60]
2009 | Conference Paper | IST-REx-ID: 3503   OA
Chatterjee, K., & Henzinger, T. A. (2009). Probabilistic systems with limsup and liminf objectives (Vol. 5489, pp. 32–45). Presented at the ILC: Infinity in Logic and Computation, Springer. https://doi.org/10.1007/978-3-642-03092-5_4
View | DOI | Download (ext.)
 
[59]
2009 | Journal Article | IST-REx-ID: 3870   OA
Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL), 11(1). https://doi.org/10.1145/1614431.1614432
View | Files available | DOI
 
[58]
2009 | Conference Paper | IST-REx-ID: 4544   OA
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2009). Termination criteria for solving concurrent safety and reachability games (pp. 197–206). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/10.1137/1.9781611973068.23
View | Files available | DOI | Download (ext.)
 
[57]
2009 | Technical Report | IST-REx-ID: 5395   OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Qualitative analysis of partially-observable Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2009-0001
View | Files available | DOI
 
[56]
2008 | Conference Paper | IST-REx-ID: 3876
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2008). Timed parity games: complexity and robustness (Vol. 5215, pp. 124–140). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Springer. https://doi.org/10.1007/978-3-540-85778-5_10
View | Files available | DOI
 
[55]
2008 | Conference Paper | IST-REx-ID: 3504
Chatterjee, K., De Alfaro, L., Majumdar, R., & Raman, V. (2008). Algorithms for game metrics (Vol. 2, pp. 107–118). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745
View | Files available | DOI
 
[54]
2008 | Conference Paper | IST-REx-ID: 3877
Chatterjee, K., Henzinger, T. A., & Jobstmann, B. (2008). Environment assumptions for synthesis (Vol. 5201, pp. 147–161). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-85361-9_14
View | DOI
 
[53]
2008 | Book Chapter | IST-REx-ID: 3872
Chatterjee, K., & Henzinger, T. A. (2008). Value iteration. In 25 Years in Model Checking (Vol. 5000, pp. 107–138). Springer. https://doi.org/10.1007/978-3-540-69850-0_7
View | DOI
 
[52]
2008 | Journal Article | IST-REx-ID: 4534
Chatterjee, K., & Henzinger, T. A. (2008). Reduction of stochastic parity to stochastic mean-payoff games. Information Processing Letters, 106(1), 1–7. https://doi.org/10.1016/j.ipl.2007.08.035
View | DOI | Download (ext.)
 
[51]
2008 | Conference Paper | IST-REx-ID: 4546
Chatterjee, K., Ghosal, A., Henzinger, T. A., Iercan, D., Kirsch, C., Pinello, C., & Sangiovanni Vincentelli, A. (2008). Logical reliability of interacting real-time tasks (pp. 909–914). Presented at the DATE: Design, Automation and Test in Europe, IEEE. https://doi.org/10.1145/1403375.1403595
View | DOI | Download (ext.)
 
[50]
2008 | Conference Paper | IST-REx-ID: 3501
Adler, B. T., Chatterjee, K., De Alfaro, L., Faella, M., Pye, I., & Raman, V. (2008). Assigning trust to Wikipedia content. Presented at the WikiSym: International Symposium on Wikis, ACM. https://doi.org/10.1145/1822258.1822293
View | DOI
 
[49]
2008 | Conference Paper | IST-REx-ID: 3873
Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2008). Controller synthesis with budget constraints (Vol. 4981, pp. 72–86). Presented at the HSCC: Hybrid Systems - Computation and Control, Springer. https://doi.org/DOI: 10.1007/978-3-540-78929-1_6
View | DOI
 
[48]
2008 | Conference Paper | IST-REx-ID: 3878   OA
Chatterjee, K., De Alfaro, L., & Majumdar, R. (2008). The complexity of coverage (Vol. 5356, pp. 91–106). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Springer. https://doi.org/10.1007/978-3-540-89330-1_7
View | DOI | Download (ext.)
 
[47]
2008 | Conference Paper | IST-REx-ID: 3880
Berwanger, D., Chatterjee, K., Doyen, L., Henzinger, T. A., & Raje, S. (2008). Strategy construction for parity games with imperfect information (Vol. 5201, pp. 325–339). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-85361-9
View | Files available | DOI
 
[46]
2008 | Conference Paper | IST-REx-ID: 3502
Chatterjee, K., De Alfaro, L., & Pye, I. (2008). Robust content-driven reputation (pp. 33–42). Presented at the AISec: Artificial Intelligence and Security, ACM. https://doi.org/10.1145/1456377.1456387
View | DOI
 
[45]
2008 | Conference Paper | IST-REx-ID: 3874
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2008). Trading infinite memory for uniform randomness in timed games (Vol. 4981, pp. 87–100). Presented at the HSCC: Hybrid Systems - Computation and Control, Springer. https://doi.org/10.1007/978-3-540-78929-1_7
View | DOI
 
[44]
2008 | Conference Paper | IST-REx-ID: 3879
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2008). Quantitative languages (Vol. 5213, pp. 385–400). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/978-3-540-87531-4_28
View | DOI
 
[43]
2008 | Journal Article | IST-REx-ID: 4548
Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2008). Stochastic limit-average games are in EXPTIME. International Journal of Game Theory, 37(2), 219–234. https://doi.org/10.1007/s00182-007-0110-5
View | DOI | Download (ext.)
 
[42]
2008 | Conference Paper | IST-REx-ID: 3875
Chatterjee, K., Henzinger, T. A., & Sen, K. (2008). Model-checking omega-regular properties of interval Markov chains (Vol. 4962, pp. 302–317). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-78499-9_22
View | DOI
 
[41]
2007 | Conference Paper | IST-REx-ID: 3883
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2007). Generalized parity games (Vol. 4423, pp. 153–167). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-71389-0_12
View | DOI
 
[40]
2007 | Conference Paper | IST-REx-ID: 3884
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2007). Strategy logic (Vol. 4703, pp. 59–73). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-74407-8_5
View | Files available | DOI
 
[39]
2007 | Conference Paper | IST-REx-ID: 3885
Chatterjee, K. (2007). Optimal strategy synthesis in stochastic Müller games (Vol. 4423, pp. 138–152). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-71389-0_11
View | DOI
 
[38]
2007 | Journal Article | IST-REx-ID: 4547
Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2007). Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science, 3(184), 1–23. https://doi.org/10.2168/LMCS-3(3:4)2007
View | DOI
 
[37]
2007 | Thesis | IST-REx-ID: 4559
Chatterjee, K. (2007). Stochastic ω-Regular Games (pp. 1–247). University of California, Berkeley.
View | Download (ext.)
 
[36]
2007 | Conference Paper | IST-REx-ID: 3886
Chatterjee, K. (2007). Stochastic Müller games are PSPACE-complete (Vol. 4855, pp. 436–448). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-77050-3_36
View | DOI
 
[35]
2007 | Conference Paper | IST-REx-ID: 3881
De Alfaro, L., Chatterjee, K., Faella, M., & Legay, A. (2007). Qualitative logics and equivalences for probabilistic systems (pp. 237–248). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2007.15
View | DOI
 
[34]
2007 | Conference Paper | IST-REx-ID: 3887
Chatterjee, K. (2007). Markov decision processes with multiple long-run average objectives (Vol. 4855, pp. 473–484). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-77050-3_39
View | DOI
 
[33]
2007 | Journal Article | IST-REx-ID: 3882
Chatterjee, K. (2007). Concurrent games with tail objectives. Theoretical Computer Science, 388(1–3), 181–198. https://doi.org/10.1016/j.tcs.2007.07.047
View | DOI
 
[32]
2007 | Conference Paper | IST-REx-ID: 4537
Chatterjee, K., & Henzinger, T. A. (2007). Assume-guarantee synthesis (Vol. 4424, pp. 261–275). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. https://doi.org/10.1007/978-3-540-71209-1_21
View | DOI
 
[31]
2006 | Conference Paper | IST-REx-ID: 3888
Chatterjee, K., & Henzinger, T. A. (2006). Strategy improvement for stochastic Rabin and Streett games (Vol. 4137, pp. 375–389). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/11817949_25
View | DOI
 
[30]
2006 | Conference Paper | IST-REx-ID: 3890
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2006). The complexity of quantitative concurrent parity games (pp. 678–687). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/10.1145/1109557.1109631
View | DOI
 
[29]
2006 | Conference Paper | IST-REx-ID: 4552
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2006). Strategy improvement for concurrent reachability games (pp. 291–300). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2006.48
View | DOI
 
[28]
2006 | Conference Paper | IST-REx-ID: 4538
Chatterjee, K., & Henzinger, T. A. (2006). Strategy improvement and randomized subexponential algorithms for stochastic parity games (Vol. 3884, pp. 512–523). Presented at the STACS: Theoretical Aspects of Computer Science, Springer. https://doi.org/10.1007/11672142_42
View | DOI
 
[27]
2006 | Conference Paper | IST-REx-ID: 3500
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2006). Algorithms for Büchi Games. Presented at the GDV: Games in Design and Verification, ACM.
View | Download (ext.)
 
[26]
2006 | Conference Paper | IST-REx-ID: 3889
Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2006). Algorithms for omega-regular games with imperfect information (Vol. 4207, pp. 287–302). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_19
View | DOI
 
[25]
2006 | Conference Paper | IST-REx-ID: 3891
Chatterjee, K. (2006). Concurrent games with tail objectives (Vol. 4207, pp. 256–270). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_17
View | DOI
 
[24]
2006 | Conference Paper | IST-REx-ID: 4539
Chatterjee, K., & Henzinger, T. A. (2006). Finitary winning in omega-regular games (Vol. 3920, pp. 257–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. https://doi.org/10.1007/11691372_17
View | DOI
 
[23]
2006 | Conference Paper | IST-REx-ID: 3449
Chatterjee, K., Jagadeesan, R., & Pitcher, C. (2006). Games for controls (pp. 70–82). Presented at the CSF: Computer Security Foundations, IEEE. https://doi.org/10.1109/CSFW.2006.14
View | DOI
 
[22]
2006 | Conference Paper | IST-REx-ID: 3499
Chatterjee, K. (2006). Nash equilibrium for upward-closed objectives (Vol. 4207, pp. 271–286). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_18
View | DOI
 
[21]
2006 | Journal Article | IST-REx-ID: 4550
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2006). Games with secure equilibria. Theoretical Computer Science, 365(1–2), 67–82. https://doi.org/10.1016/j.tcs.2006.07.032
View | DOI
 
[20]
2006 | Conference Paper | IST-REx-ID: 4549
Chatterjee, K., De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., & Stoelinga, M. (2006). Compositional quantitative reasoning (pp. 179–188). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2006.11
View | DOI
 
[19]
2006 | Conference Paper | IST-REx-ID: 4551
Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2006). Markov decision processes with multiple objectives (Vol. 3884, pp. 325–336). Presented at the STACS: Theoretical Aspects of Computer Science, Springer. https://doi.org/10.1007/11672142_26
View | DOI
 
[18]
2005 | Conference Paper | IST-REx-ID: 4557
Chatterjee, K., Henzinger, T. A., Jhala, R., & Majumdar, R. (2005). Counterexample-guided planning (pp. 104–111). Presented at the UAI: Uncertainty in Artificial Intelligence, AUAI Press.
View | Download (ext.)
 
[17]
2005 | Conference Paper | IST-REx-ID: 3896
Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2005). Complexity of compositional model checking of computation tree logic on simple structures (Vol. 3326, pp. 89–102). Presented at the IWDC: International Workshop on Distributed Computing , Springer. https://doi.org/10.1007/978-3-540-30536-1_13
View | DOI
 
[16]
2005 | Conference Paper | IST-REx-ID: 4541
Chatterjee, K., & Henzinger, T. A. (2005). Semiperfect-information games (Vol. 3821, pp. 1–18). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/11590156_1
View | DOI
 
[15]
2005 | Conference Paper | IST-REx-ID: 4553
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2005). The complexity of stochastic Rabin and Streett games (Vol. 3580, pp. 878–890). Presented at the ICALP: Automata, Languages and Programming, Springer. https://doi.org/10.1007/11523468_71
View | DOI
 
[14]
2005 | Conference Paper | IST-REx-ID: 4560
Chakrabarti, A., Chatterjee, K., Henzinger, T. A., Kupferman, O., & Majumdar, R. (2005). Verifying quantitative properties using bound functions (Vol. 3725, pp. 50–64). Presented at the CHARME: Correct Hardware Design and Verification Methods, Springer. https://doi.org/10.1007/11560548_7
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 3892
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2005). Games with secure equilibria (Vol. 3657, pp. 141–161). Presented at the FMCO: Formal Methods for Components and Objects, Springer. https://doi.org/10.1007/11561163_7
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 4554
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2005). Mean-payoff parity games (pp. 178–187). Presented at the LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.2005.26
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 3893
Chatterjee, K. (2005). Two-player nonzero-sum ω-regular games (Vol. 3653, pp. 413–427). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/11539452_32
View | DOI
 
[10]
2004 | Conference Paper | IST-REx-ID: 3895
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2004). Games with secure equilibria (pp. 160–169). Presented at the LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.2004.1319610
View | DOI
 
[9]
2004 | Conference Paper | IST-REx-ID: 4558
Chatterjee, K., Jurdziński, M., & Henzinger, T. A. (2004). Quantitative stochastic parity games (pp. 121–130). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
View
 
[8]
2004 | Conference Paper | IST-REx-ID: 4555
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2004). Trading memory for randomness (pp. 206–217). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2004.10051
View | DOI
 
[7]
2004 | Conference Paper | IST-REx-ID: 3894
Chatterjee, K., Majumdar, R., & Jurdziński, M. (2004). On Nash equilibria in stochastic games (Vol. 3210, pp. 26–40). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/978-3-540-30124-0_6
View | DOI
 
[6]
2004 | Journal Article | IST-REx-ID: 4556
Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., & Palsberg, J. (2004). Stack size analysis for interrupt-driven programs. Information and Computation, 194(2), 144–174. https://doi.org/10.1016/j.ic.2004.06.001
View | DOI
 
[5]
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. https://doi.org/10.1023/A:1023217515688
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3897
Chatterjee, K., Jurdziński, M., & Henzinger, T. A. (2003). Simple stochastic parity games (Vol. 2803, pp. 100–113). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/978-3-540-45220-1_11
View | DOI
 
[3]
2003 | Conference Paper | IST-REx-ID: 3898
Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., & Palsberg, J. (2003). Stack size analysis for interrupt-driven programs (Vol. 2694, pp. 109–126). Presented at the SAS: Static Analysis Symposium, Springer. https://doi.org/10.1007/3-540-44898-5_7
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 3448
Mallick, S., Chatterjee, K., Merchant, A., & Dasgupta, P. (2002). Implementation of shape grammar for plan analysis. Presented at the IT-Built: Information Technology For Built Environment, Elsevier.
View
 
[1]
2001 | Conference Paper | IST-REx-ID: 3447
Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2001). Weighted quantified computation tree logic. Presented at the CIT: Conference on Information Technology, Elsevier.
View
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

342 Publications

Mark all

[342]
2019 | Conference Paper | IST-REx-ID: 6490
Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322
View | DOI
 
[341]
2019 | Conference Paper | IST-REx-ID: 5948
Fu, H., & Chatterjee, K. (2019). Termination of nondeterministic probabilistic programs. (C. Enea & R. Piskac, Eds.). Presented at the Verification, Model Checking, and Abstract Interpretation, VMCAI, Cascais, Portugal: Springer. https://doi.org/10.1007/978-3-030-11245-5_22
View | DOI
 
[340]
2019 | Conference Paper | IST-REx-ID: 6175   OA
Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (n.d.). Cost analysis of nondeterministic probabilistic programs. In 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019). Phoenix, AZ, United States.
View | Files available | arXiv
 
[339]
2019 | Conference Paper | IST-REx-ID: 6056   OA
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (n.d.). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE.
View | Files available | Download (ext.) | arXiv
 
[338]
2019 | Journal Article | IST-REx-ID: 6380   OA
Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages, 3(POPL), 53. https://doi.org/10.1145/3290366
View | Files available | DOI
 
[337]
2019 | Conference Paper | IST-REx-ID: 6378   OA
Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (n.d.). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319
View | Files available | DOI
 
[336]
2019 | Conference Paper | IST-REx-ID: 6462   OA
Avni, G., Bloem, R., Chatterjee, K., Henzinger, T. A., Konighofer, B., & Pranger, S. (2019). Run-time optimization for learned controllers through quantitative games. In 31st International Conference on Computer-Aided Verification (Vol. 11561, pp. 630–649). New York, NY, United States: Springer. https://doi.org/10.1007/978-3-030-25540-4_36
View | Files available | DOI
 
[335]
2019 | Conference Paper | IST-REx-ID: 6780   OA
Huang, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (n.d.). Modular verification for almost-sure termination of probabilistic programs. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . Athens, Greece: ACM.
View | Files available | Download (ext.) | arXiv
 
[334]
2018 | Conference Paper | IST-REx-ID: 143   OA
Brázdil, T., Chatterjee, K., Kučera, A., Novotny, P., Velan, D., & Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE. https://doi.org/10.1145/3209108.3209191
View | DOI | Download (ext.)
 
[333]
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). https://doi.org/10.1098/rsif.2018.0073
View | Files available | DOI
 
[332]
2018 | Conference Paper | IST-REx-ID: 35   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.
View | Download (ext.) | arXiv
 
[331]
2018 | Book Chapter | IST-REx-ID: 59
Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.), Handbook of Modeling Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27
View | DOI
 
[330]
2018 | Conference Paper | IST-REx-ID: 66   OA
Chatterjee, K., Goharshady, A., Ibsen-Jensen, R., & Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. (Vol. 118, p. 11). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11
View | Files available | DOI | Download (ext.) | arXiv
 
[329]
2018 | Conference Paper | IST-REx-ID: 24   OA
Chatterjee, K., Elgyütt, A., Novotny, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652
View | DOI | Download (ext.) | arXiv
 
[328]
2018 | Conference Paper | IST-REx-ID: 310   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Loitzenbauer, V. (2018). Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter (pp. 2341–2356). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, USA: ACM. https://doi.org/10.1137/1.9781611975031.151
View | DOI | Download (ext.) | arXiv
 
[327]
2018 | Journal Article | IST-REx-ID: 6009   OA
Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems, 40(3), 9. https://doi.org/10.1145/3210257
View | Files available | DOI | Download (ext.) | arXiv
 
[326]
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. https://doi.org/10.1145/3174800
View | Files available | DOI | Download (ext.) | arXiv
 
[325]
2018 | Conference Paper | IST-REx-ID: 6340   OA
Goharshady, A. K., Behrouz, A., & Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In Proceedings of the IEEE International Conference on Blockchain (pp. 1343–1348). Halifax, Canada: IEEE.
View | Files available | arXiv
 
[324]
2018 | Conference Paper | IST-REx-ID: 79   OA
Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., & Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. https://doi.org/10.1007/978-3-319-99154-2_4
View | DOI | Download (ext.) | arXiv
 
[323]
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. https://doi.org/10.1007/s11241-017-9293-4
View | Files available | DOI
 
[322]
2018 | Book Chapter | IST-REx-ID: 86
Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9
View | DOI
 
[321]
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. https://doi.org/10.1038/s41467-017-02721-8
View | Files available | DOI
 
[320]
2018 | Journal Article | IST-REx-ID: 157
Hilbe, C., Šimsa, Š., Chatterjee, K., & Nowak, M. (2018). Evolution of cooperation in stochastic games. Nature, 559(7713), 246–249. https://doi.org/10.1038/s41586-018-0277-x
View | Files available | DOI
 
[319]
2018 | Conference Paper | IST-REx-ID: 25
Horák, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/662
View | DOI
 
[318]
2018 | Conference Paper | IST-REx-ID: 311   OA
Chatterjee, K., Goharshady, A., & Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89884-1_26
View | Files available | DOI
 
[317]
2018 | Conference Paper | IST-REx-ID: 141   OA
Chatterjee, K., Henzinger, M., Loitzenbauer, V., Oraee, S., & Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13
View | Files available | DOI
 
[316]
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. https://doi.org/10.1073/pnas.1810565115
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[315]
2018 | Conference Paper | IST-REx-ID: 297   OA
Brázdil, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89960-2_21
View | Files available | DOI
 
[314]
2018 | Conference Paper | IST-REx-ID: 325   OA
Agrawal, S., Chatterjee, K., & Novotny, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122
View | DOI | Download (ext.) | arXiv
 
[313]
2018 | Conference Paper | IST-REx-ID: 34   OA
Chatterjee, K., Chemlík, M., & Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press.
View | Download (ext.) | arXiv
 
[312]
2018 | Journal Article | IST-REx-ID: 419
Hilbe, C., Chatterjee, K., & Nowak, M. (2018). Partners and rivals in direct reciprocity. Nature Human Behaviour, 2, 469–477. https://doi.org/10.1038/s41562-018-0320-9
View | Files available | DOI
 
[311]
2018 | Conference Paper | IST-REx-ID: 5679   OA
Huang, M., Fu, H., & Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. https://doi.org/10.1007/978-3-030-02768-1_11
View | DOI | Download (ext.) | arXiv
 
[310]
2018 | Preprint | IST-REx-ID: 5977   OA
Chatterjee, K., Fu, H., Goharshady, A., & Okati, N. (n.d.). Computational Approaches for Stochastic Shortest Path on Succinct MDPs. ArXiv. ArXiv.
View | Download (ext.) | arXiv
 
[309]
2018 | Journal Article | IST-REx-ID: 5751   OA
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology, 1(1), 71. https://doi.org/10.1038/s42003-018-0078-7
View | Files available | DOI
 
[308]
2017 | Journal Article | IST-REx-ID: 1065
Chatterjee, K., & Osang, G. F. (2017). Pushdown reachability with constant treewidth. Information Processing Letters, 122, 25–29. https://doi.org/10.1016/j.ipl.2017.02.003
View | Files available | DOI
 
[307]
2017 | Journal Article | IST-REx-ID: 1407
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. https://doi.org/10.1016/j.nahs.2016.04.006
View | Files available | DOI | Download (ext.)
 
[306]
2017 | Journal Article | IST-REx-ID: 465
Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science, 13(3). https://doi.org/10.23638/LMCS-13(3:23)2017
View | Files available | DOI
 
[305]
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. https://doi.org/10.1016/j.ic.2016.10.012
View | DOI | Download (ext.)
 
[304]
2017 | Journal Article | IST-REx-ID: 744
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. https://doi.org/10.1016/j.jtbi.2017.08.025
View | DOI
 
[303]
2017 | Conference Paper | IST-REx-ID: 1009   OA
Chatterjee, K., Novotny, P., Pérez, G., Raskin, J., & Zikelic, D. (2017). Optimizing expectation with guarantees in POMDPs. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3725–3732). San Francisco, CA, United States: AAAI Press.
View | Download (ext.)
 
[302]
2017 | Conference Paper | IST-REx-ID: 1011   OA
Chatterjee, K., Kragl, B., Mishra, S., & Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54434-1_11
View | DOI | Download (ext.)
 
[301]
2017 | Journal Article | IST-REx-ID: 1080   OA
Reiter, J., Makohon Moore, A., Gerold, J., Božić, I., Chatterjee, K., Iacobuzio Donahue, C., … Nowak, M. (2017). Reconstructing metastatic seeding patterns of human cancers. Nature Communications, 8. https://doi.org/10.1038/ncomms14114
View | Files available | DOI
 
[300]
2017 | Journal Article | IST-REx-ID: 1294
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. https://doi.org/10.1016/j.jcss.2016.09.009
View | Files available | DOI
 
[299]
2017 | Journal Article | IST-REx-ID: 466
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. https://doi.org/10.23638/LMCS-13(2:15)2017
View | Files available | DOI
 
[298]
2017 | Journal Article | IST-REx-ID: 1066
Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2017). Quantitative fair simulation games. Information and Computation, 254(2), 143–166. https://doi.org/10.1016/j.ic.2016.10.006
View | Files available | DOI
 
[297]
2017 | Journal Article | IST-REx-ID: 512
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports, 7(1). https://doi.org/10.1038/s41598-017-00107-w
View | Files available | DOI
 
[296]
2017 | Technical Report | IST-REx-ID: 5455   OA
Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria. https://doi.org/10.15479/AT:IST-2017-870-v1-1
View | Files available | DOI
 
[295]
2017 | Book Chapter | IST-REx-ID: 625
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, & R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460, pp. 367–381). Springer. https://doi.org/10.1007/978-3-319-63121-9_18
View | DOI
 
[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. https://doi.org/10.1007/s00236-017-0299-0
View | DOI
 
[293]
2017 | Conference Paper | IST-REx-ID: 1194   OA
Chatterjee, K., Novotny, P., & Zikelic, D. (2017). Stochastic invariants for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles of Programming Languages, Paris, France: ACM. https://doi.org/10.1145/3009837.3009873
View | DOI | Download (ext.)
 
[292]
2017 | Journal Article | IST-REx-ID: 467
Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL), 18(4), 31. https://doi.org/10.1145/3152769
View | Files available | DOI | Download (ext.) | arXiv
 
[291]
2017 | Technical Report | IST-REx-ID: 5456   OA
Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. IST Austria. https://doi.org/10.15479/AT:IST-2017-872-v1-1
View | Files available | DOI
 
[290]
2017 | Conference Paper | IST-REx-ID: 551   OA
Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.61
View | Files available | DOI
 
[289]
2017 | Conference Paper | IST-REx-ID: 645   OA
Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., & Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_10
View | DOI | Download (ext.)
 
[288]
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. https://doi.org/10.1073/pnas.1621239114
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[287]
2017 | Conference Paper | IST-REx-ID: 552   OA
Chatterjee, K., Henzinger, M., & Svozil, A. (2017). Faster algorithms for mean payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.39
View | Files available | DOI
 
[286]
2017 | Conference Paper | IST-REx-ID: 639   OA
Chatterjee, K., Fu, H., & Goharshady, A. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63390-9_3
View | DOI | Download (ext.)
 
[285]
2017 | Journal Article | IST-REx-ID: 653
Makohon Moore, A., Zhang, M., Reiter, J., Božić, I., Allen, B., Kundu, D., … Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics, 49(3), 358–366. https://doi.org/10.1038/ng.3764
View | DOI
 
[284]
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. https://doi.org/10.1017/jsl.2016.71
View | DOI | Download (ext.)
 
[283]
2017 | Conference Paper | IST-REx-ID: 711   OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Bidirectional nested weighted automata (Vol. 85). Presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.5
View | Files available | DOI
 
[282]
2017 | Journal Article | IST-REx-ID: 716
Chatterjee, K., & Velner, Y. (2017). The complexity of mean-payoff pushdown games. Journal of the ACM, 64(5), 34. https://doi.org/10.1145/3121408
View | DOI
 
[281]
2017 | Conference Paper | IST-REx-ID: 949   OA
Chatterjee, K., Goharshady, A., & Pavlogiannis, A. (2017). JTDec: A tool for tree decompositions in soot. In D. D’Souza (Ed.) (Vol. 10482, pp. 59–66). Presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India: Springer. https://doi.org/10.1007/978-3-319-68167-2_4
View | Files available | DOI
 
[280]
2017 | Journal Article | IST-REx-ID: 464   OA
Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science, 13(3). https://doi.org/10.23638/LMCS-13(3:26)2017
View | Files available | DOI
 
[279]
2017 | Conference Paper | IST-REx-ID: 553   OA
Chatterjee, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.55
View | Files available | DOI | Download (ext.)
 
[278]
2017 | Conference Paper | IST-REx-ID: 628   OA
Chatterjee, K., Fu, H., & Murhekar, A. (2017). Automated recurrence analysis for almost linear expected runtime bounds. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 118–139). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_6
View | DOI | Download (ext.)
 
[277]
2017 | Conference Paper | IST-REx-ID: 6519   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82, p. 18). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.CSL.2017.18
View | Files available | DOI
 
[276]
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. https://doi.org/10.1016/j.jcss.2017.04.005
View | Files available | DOI | Download (ext.)
 
[275]
2017 | Research Data | IST-REx-ID: 5559
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak , M. (2017). Strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:ISTA:51
View | Files available | DOI
 
[274]
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee, K., Chmelik, M., & Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.
View | Files available
 
[273]
2016 | Conference Paper | IST-REx-ID: 1438
Chatterjee, K., Fu, H., Novotny, P., & Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837639
View | Files available | DOI | Download (ext.) | arXiv
 
[272]
2016 | Conference Paper | IST-REx-ID: 478   OA
Chatterjee, K., & Ibsen-Jensen, R. (2016). The complexity of deciding legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands: IOS Press. https://doi.org/10.3233/978-1-61499-672-9-1432
View | Files available | DOI
 
[271]
2016 | Conference Paper | IST-REx-ID: 480   OA
Chatterjee, K., & Doyen, L. (2016). Perfect-information stochastic games with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934513
View | DOI | Download (ext.)
 
[270]
2016 | Journal Article | IST-REx-ID: 1477
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. https://doi.org/10.1016/j.jcss.2016.02.009
View | Files available | DOI | Download (ext.) | arXiv
 
[269]
2016 | Conference Paper | IST-REx-ID: 1182   OA
Chatterjee, K., Ibsen-Jensen, R., & Tkadlec, J. (2016). Robust draws in balanced knockout tournaments (Vol. 2016–January, pp. 172–179). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA: AAAI Press.
View | Files available | Download (ext.)
 
[268]
2016 | Conference Paper | IST-REx-ID: 1245
Pandey, V., & Chatterjee, K. (2016). Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In Proceedings of the ACM Conference on Computer Supported Cooperative Work (Vol. 26, pp. 365–368). San Francisco, CA, USA: ACM. https://doi.org/10.1145/2818052.2869122
View | DOI
 
[267]
2016 | Conference Paper | IST-REx-ID: 1327   OA
Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., & Novotny, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 1465–1466). Singapore: ACM.
View | Download (ext.)
 
[266]
2016 | Journal Article | IST-REx-ID: 1529
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence, 234, 26–48. https://doi.org/10.1016/j.artint.2016.01.007
View | Files available | DOI | Download (ext.) | arXiv
 
[265]
2016 | Technical Report | IST-REx-ID: 5449   OA
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Amplification on undirected population structures: Comets beat stars. IST Austria. https://doi.org/10.15479/AT:IST-2016-648-v1-1
View | Files available | DOI
 
[264]
2016 | Technical Report | IST-REx-ID: 5451   OA
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2016-728-v1-1
View | Files available | DOI
 
[263]
2016 | Conference Paper | IST-REx-ID: 1068   OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Loitzenbauer, V. (2016). Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.25
View | Files available | DOI
 
[262]
2016 | Conference Paper | IST-REx-ID: 1070   OA
Chatterjee, K., & Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.98
View | Files available | DOI
 
[261]
2016 | Conference Paper | IST-REx-ID: 1138   OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Quantitative automata under probabilistic semantics. In Proceedings of the 31st Annual ACM/IEEE Symposium (pp. 76–85). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2933588
View | DOI | Download (ext.)
 
[260]
2016 | Conference Paper | IST-REx-ID: 1140   OA
Chatterjee, K., Dvoák, W., Henzinger, M., & Loitzenbauer, V. (2016). Model and objective separation with conditional lower bounds disjunction is harder than conjunction. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 197–206). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2935304
View | DOI | Download (ext.)
 
[259]
2016 | Conference Paper | IST-REx-ID: 1335   OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Quantitative monitor automata (Vol. 9837, pp. 23–38). Presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-53413-7_2
View | DOI | Download (ext.)
 
[258]
2016 | Technical Report | IST-REx-ID: 5445   OA
Chatterjee, K., Pavlogiannis, A., & Velner, Y. (2016). Quantitative interprocedural analysis. IST Austria. https://doi.org/10.15479/AT:IST-2016-523-v1-1
View | Files available | DOI
 
[257]
2016 | Technical Report | IST-REx-ID: 5452
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-728-v2-1
View | Files available | DOI
 
[256]
2016 | Conference Paper | IST-REx-ID: 1090   OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.24
View | Files available | DOI
 
[255]
2016 | Conference Paper | IST-REx-ID: 1324
Chatterjee, K., & Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling (Vol. 2016–January, pp. 88–96). London, United Kingdom: AAAI Press.
View | Download (ext.)
 
[254]
2016 | Conference Paper | IST-REx-ID: 1386   OA
Chatterjee, K., Fu, H., & Goharshady, A. (2016). Termination analysis of probabilistic programs through Positivstellensatz’s (Vol. 9779, pp. 3–22). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. https://doi.org/10.1007/978-3-319-41528-4_1
View | DOI | Download (ext.)
 
[253]
2016 | Technical Report | IST-REx-ID: 5453   OA
Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-749-v3-1
View | Files available | DOI
 
[252]
2016 | Conference Paper | IST-REx-ID: 1071
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs (Vol. 57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ESA.2016.28
View | Files available | DOI
 
[251]
2016 | Conference Paper | IST-REx-ID: 1437
Chatterjee, K., Goharshady, A., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837624
View | Files available | DOI | Download (ext.) | arXiv
 
[250]
2015 | Conference Paper | IST-REx-ID: 1609   OA
Chatterjee, K., Doyen, L., & Vardi, M. (2015). The complexity of synthesis from probabilistic components. Presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan: Springer. https://doi.org/10.1007/978-3-662-47666-6_9
View | DOI | Download (ext.)
 
[249]
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. https://doi.org/10.1098/rspa.2015.0114
View | Files available | DOI
 
[248]
2015 | Conference Paper | IST-REx-ID: 1820   OA
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Optimal cost almost-sure reachability in POMDPs. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3496–3502). Austin, TX, USA: AAAI Press.
View | Files available | Download (ext.) | arXiv
 
[247]
2015 | Journal Article | IST-REx-ID: 1856
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. Journal of the ACM, 62(1). https://doi.org/10.1145/2699430
View | Files available | DOI | Download (ext.)
 
[246]
2015 | Journal Article | IST-REx-ID: 1731
Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2015). Randomness for free. Information and Computation, 245(12), 3–16. https://doi.org/10.1016/j.ic.2015.06.003
View | Files available | DOI | Download (ext.)
 
[245]
2015 | Conference Paper | IST-REx-ID: 1661
Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July, p. 7174888). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.34
View | Files available | DOI | Download (ext.)
 
[244]
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. https://doi.org/10.1016/j.ic.2015.03.010
View | Files available | DOI | Download (ext.)
 
[243]
2015 | Technical Report | IST-REx-ID: 5430
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-319-v1-1
View | Files available | DOI
 
[242]
2015 | Technical Report | IST-REx-ID: 5435   OA
Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2015-318-v2-1
View | Files available | DOI
 
[241]
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. https://doi.org/10.1145/2676726.2676968
View | Files available | DOI
 
[240]
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. https://doi.org/10.1073/pnas.1511366112
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[239]
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. https://doi.org/10.1038/srep17147
View | Files available | DOI
 
[238]
2015 | Journal Article | IST-REx-ID: 1698   OA
Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., & Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. Information and Computation, 241(4), 177–196. https://doi.org/10.1016/j.ic.2015.03.001
View | DOI | Download (ext.)
 
[237]
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. https://doi.org/10.3390/g6040413
View | Files available | DOI
 
[236]
2015 | Conference Paper | IST-REx-ID: 1838   OA
Bloem, R., Chatterjee, K., Jacobs, S., & Könighofer, R. (2015). Assume-guarantee synthesis for concurrent reactive programs with partial information (Vol. 9035, pp. 517–532). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_50
View | DOI | Download (ext.)
 
[235]
2015 | Journal Article | IST-REx-ID: 524
Chatterjee, K., & Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. Information and Computation, 242(6), 2–24. https://doi.org/10.1016/j.ic.2015.03.009
View | Files available | DOI | Download (ext.) | arXiv
 
[234]
2015 | Conference Paper | IST-REx-ID: 1732
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE. https://doi.org/10.1109/ICRA.2015.7139019
View | Files available | DOI | Download (ext.) | arXiv
 
[233]
2015 | Technical Report | IST-REx-ID: 5429
Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2015-318-v1-1
View | Files available | DOI
 
[232]
2015 | Technical Report | IST-REx-ID: 5443   OA
Chatterjee, K., Chmelik, M., & Davies, J. (2015). A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria. https://doi.org/10.15479/AT:IST-2015-325-v2-1
View | Files available | DOI
 
[231]
2015 | Technical Report | IST-REx-ID: 5431   OA
Chatterjee, K., Ibsen-Jensen, R., & Hansen, K. (2015). The patience of concurrent stochastic games with safety and reachability objectives. IST Austria. https://doi.org/10.15479/AT:IST-2015-322-v1-1
View | Files available | DOI
 
[230]
2015 | Technical Report | IST-REx-ID: 5436   OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-170-v2-2
View | Files available | DOI
 
[229]
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. https://doi.org/10.1109/TAC.2015.2404612
View | DOI
 
[228]
2015 | Conference Paper | IST-REx-ID: 1839   OA
Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2015). Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_12
View | DOI | Download (ext.)
 
[227]
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. https://doi.org/10.1016/j.ipl.2014.09.001
View | DOI | Download (ext.)
 
[226]
2015 | Journal Article | IST-REx-ID: 1598
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. https://doi.org/10.1016/j.tcs.2015.01.050
View | Files available | DOI | Download (ext.)
 
[225]
2015 | Conference Paper | IST-REx-ID: 1656
Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July, p. 7174926). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.72
View | Files available | DOI | arXiv
 
[224]
2015 | Technical Report | IST-REx-ID: 5437   OA
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-330-v2-1
View | Files available | DOI
 
[223]
2015 | Technical Report | IST-REx-ID: 5444   OA
Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue, C., … Nowak, M. (2015). Reconstructing robust phylogenies of metastatic cancers. IST Austria. https://doi.org/10.15479/AT:IST-2015-399-v1-1
View | Files available | DOI
 
[222]
2015 | Technical Report | IST-REx-ID: 5432
Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v1-1
View | Files available | DOI
 
[221]
2015 | Conference Paper | IST-REx-ID: 1714
Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2015). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In Real-Time Systems Symposium (Vol. 2015, pp. 118–127). Rome, Italy: IEEE. https://doi.org/10.1109/RTSS.2014.9
View | Files available | DOI
 
[220]
2015 | Journal Article | IST-REx-ID: 1873   OA
Chatterjee, K., & Chmelik, M. (2015). POMDPs under probabilistic semantics. Artificial Intelligence, 221, 46–72. https://doi.org/10.1016/j.artint.2014.12.009
View | DOI | Download (ext.) | arXiv
 
[219]
2015 | Conference Paper | IST-REx-ID: 1481
Ahmed, U., Chatterjee, K., & Gulwani, S. (2015). Automatic generation of alternative starting positions for simple traditional board games (Vol. 2, pp. 745–752). Presented at the AAAI: Conference on Artificial Intelligence, Austin, TX, USA: AAAI Press.
View | Files available | Download (ext.)
 
[218]
2015 | Conference Paper | IST-REx-ID: 1657
Chatterjee, K., Komárková, Z., & Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.32
View | Files available | DOI
 
[217]
2015 | Technical Report | IST-REx-ID: 5438   OA
Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-334-v1-1
View | Files available | DOI
 
[216]
2015 | Journal Article | IST-REx-ID: 1501
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. https://doi.org/10.1007/s10703-015-0235-2
View | Files available | DOI | Download (ext.)
 
[215]
2015 | Technical Report | IST-REx-ID: 5440
Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v2-2
View | Files available | DOI
 
[214]
2015 | Journal Article | IST-REx-ID: 1602
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. https://doi.org/10.1145/2676726.2676979
View | Files available | DOI | Download (ext.) | arXiv
 
[213]
2015 | Conference Paper | IST-REx-ID: 1607
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs (Vol. 9206, pp. 140–157). Presented at the CAV: Computer Aided Verification, San Francisco, CA, USA: Springer. https://doi.org/10.1007/978-3-319-21690-4_9
View | Files available | DOI | Download (ext.)
 
[212]
2015 | Conference Paper | IST-REx-ID: 1689   OA
Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2015). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 259–268). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728608
View | Files available | DOI | Download (ext.)
 
[211]
2015 | Conference Paper | IST-REx-ID: 1691
Svoreňová, M., Chmelik, M., Leahy, K., Eniser, H., Chatterjee, K., Cěrná, I., & Belta, C. (2015). Temporal logic motion planning using POMDPs with parity objectives: Case study paper. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 233–238). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728617
View | DOI
 
[210]
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). https://doi.org/10.1098/rspb.2015.1041
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[209]
2015 | Conference Paper | IST-REx-ID: 1610
Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015). Edit distance for pushdown automata. Presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan: Springer. https://doi.org/10.1007/978-3-662-47666-6_10
View | Files available | DOI
 
[208]
2015 | Conference Paper | IST-REx-ID: 1603
Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., & Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21690-4_10
View | Files available | DOI | Download (ext.)
 
[207]
2015 | Technical Report | IST-REx-ID: 5441
Chatterjee, K., Ibsen-Jensen, R., Goharshady, A., & Pavlogiannis, A. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria. https://doi.org/10.15479/AT:IST-2015-340-v1-1
View | Files available | DOI
 
[206]
2014 | Journal Article | IST-REx-ID: 1375   OA
Chatterjee, K., Henzinger, M., Krinninger, S., Loitzenbauer, V., & Raskin, M. (2014). Approximating the minimum cycle mean. Theoretical Computer Science, 547(C), 104–116. https://doi.org/10.1016/j.tcs.2014.06.031
View | DOI | Download (ext.)
 
[205]
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). https://doi.org/10.2168/LMCS-10(1:13)2014
View | Files available | DOI | Download (ext.)
 
[204]
2014 | Journal Article | IST-REx-ID: 535   OA
Chatterjee, K., Henzinger, M., Krinninger, S., & Nanongkai, D. (2014). Polynomial time algorithms for energy games with special weight structures. Algorithmica, 70(3), 457–492. https://doi.org/10.1007/s00453-013-9843-7
View | DOI | Download (ext.)
 
[203]
2014 | Technical Report | IST-REx-ID: 5423   OA
Chatterjee, K., Kössler, A., Pavlogiannis, A., & Schmid, U. (2014). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria. https://doi.org/10.15479/AT:IST-2014-300-v1-1
View | Files available | DOI
 
[202]
2014 | Technical Report | IST-REx-ID: 5428   OA
Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2014). Quantitative fair simulation games. IST Austria. https://doi.org/10.15479/AT:IST-2014-315-v1-1
View | Files available | DOI
 
[201]
2014 | Conference Paper | IST-REx-ID: 2063
Chatterjee, K., Chmelik, M., & Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-08867-9_31
View | Files available | DOI
 
[200]
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. https://doi.org/10.1007/s00236-013-0182-6
View | DOI | Download (ext.)
 
[199]
2014 | Journal Article | IST-REx-ID: 2141
Chatterjee, K., & Henzinger, M. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM, 61(3). https://doi.org/10.1145/2597631
View | Files available | DOI | Download (ext.)
 
[198]
2014 | Journal Article | IST-REx-ID: 2038
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL), 15(4), 27. https://doi.org/10.1145/2629686
View | Files available | DOI
 
[197]
2014 | Journal Article | IST-REx-ID: 2211
Chatterjee, K., & Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL), 15(2), 16. https://doi.org/10.1145/2579821
View | Files available | DOI | Download (ext.) | arXiv
 
[196]
2014 | Conference Paper | IST-REx-ID: 1903
Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer. https://doi.org/10.1007/978-3-662-44522-8_1
View | Files available | DOI
 
[195]
2014 | Conference Paper | IST-REx-ID: 2216
Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2014). Edit distance for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany: Springer. https://doi.org/10.1145/2562059.2562141
View | Files available | DOI | Download (ext.)
 
[194]
2014 | Technical Report | IST-REx-ID: 5412
Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v1-1
View | Files available | DOI
 
[193]
2014 | Technical Report | IST-REx-ID: 5424
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. https://doi.org/10.15479/AT:IST-2014-305-v1-1
View | Files available | DOI
 
[192]
2014 | Conference Paper | IST-REx-ID: 1853
Jha, S., Tripakis, S., Seshia, S., & Chatterjee, K. (2014). Game theoretic secure localization in wireless sensor networks (pp. 85–90). Presented at the IOT: Internet of Things, Cambridge, USA: IEEE. https://doi.org/10.1109/IOT.2014.7030120
View | DOI
 
[191]
2014 | Conference Paper | IST-REx-ID: 2027   OA
Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez & J.-F. Raskin (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 98–114). Sydney, Australia: Society of Industrial and Applied Mathematics. https://doi.org/10.1007/978-3-319-11936-6_8
View | DOI | Download (ext.)
 
[190]
2014 | Conference Paper | IST-REx-ID: 2212
Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2014). Perfect-information stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-54830-7_14
View | Files available | DOI
 
[189]
2014 | Technical Report | IST-REx-ID: 5413
Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v2-2
View | Files available | DOI
 
[188]
2014 | Technical Report | IST-REx-ID: 5418   OA
Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. IST Austria. https://doi.org/10.15479/AT:IST-2014-176-v1-1
View | Files available | DOI
 
[187]
2014 | Technical Report | IST-REx-ID: 5420   OA
Chatterjee, K., & Ibsen-Jensen, R. (2014). The value 1 problem for concurrent mean-payoff games. IST Austria. https://doi.org/10.15479/AT:IST-2014-191-v1-1
View | Files available | DOI
 
[186]
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). https://doi.org/10.1371/journal.pcbi.1003818
View | Files available | DOI
 
[185]
2014 | Conference Paper | IST-REx-ID: 2054
Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_37
View | Files available | DOI
 
[184]
2014 | Conference Paper | IST-REx-ID: 2213
Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2014). The complexity of partial-observation stochastic parity games with finite-memory strategies (Vol. 8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-54830-7_16
View | Files available | DOI | Download (ext.) | arXiv
 
[183]
2014 | Conference Paper | IST-REx-ID: 2162
Chatterjee, K., & Ibsen-Jensen, R. (2014). The complexity of ergodic mean payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer. https://doi.org/10.1007/978-3-662-43951-7_11
View | Files available | DOI | Download (ext.) | arXiv
 
[182]
2014 | Technical Report | IST-REx-ID: 5426   OA
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. https://doi.org/10.15479/AT:IST-2014-305-v2-1
View | Files available | DOI
 
[181]
2014 | Technical Report | IST-REx-ID: 5419   OA
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-187-v1-1
View | Files available | DOI
 
[180]
2014 | Technical Report | IST-REx-ID: 5414   OA
Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v3-1
View | Files available | DOI
 
[179]
2014 | Technical Report | IST-REx-ID: 5421   OA
Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2014). The complexity of evolution on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-190-v2-2
View | Files available | DOI
 
[178]
2014 | Journal Article | IST-REx-ID: 2187   OA
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B., … Könighofer, R. (2014). Synthesizing robust systems. Acta Informatica, 51(3–4), 193–220. https://doi.org/10.1007/s00236-013-0191-5
View | Files available | DOI
 
[177]
2014 | Conference Paper | IST-REx-ID: 2163
Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. In Lecture Notes in Computer Science (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer. https://doi.org/10.1007/978-3-662-43951-7_10
View | Files available | DOI | Download (ext.) | arXiv
 
[176]
2014 | Technical Report | IST-REx-ID: 5427   OA
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-314-v1-1
View | Files available | DOI
 
[175]
2014 | Technical Report | IST-REx-ID: 5415
Chatterjee, K., Henzinger, T. A., & Otop, J. (2014). Nested weighted automata. IST Austria. https://doi.org/10.15479/AT:IST-2014-170-v1-1
View | Files available | DOI
 
[174]
2013 | Journal Article | IST-REx-ID: 2816   OA
Božić, I., Reiter, J., Allen, B., Antal, T., Chatterjee, K., Shah, P., … Nowak, M. (2013). Evolutionary dynamics of cancer in response to targeted combination therapy. ELife, 2. https://doi.org/10.7554/eLife.00747
View | Files available | DOI
 
[173]
2013 | Journal Article | IST-REx-ID: 2854   OA
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2013). Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences, 79(5), 640–657. https://doi.org/10.1016/j.jcss.2012.12.001
View | Files available | DOI
 
[172]
2013 | Technical Report | IST-REx-ID: 5404   OA
Chatterjee, K., & Ibsen-Jensen, R. (2013). The complexity of ergodic games. IST Austria. https://doi.org/10.15479/AT:IST-2013-127-v1-1
View | Files available | DOI
 
[171]
2013 | Technical Report | IST-REx-ID: 5409   OA
Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2013). Edit distance for timed automata. IST Austria. https://doi.org/10.15479/AT:IST-2013-144-v1-1
View | Files available | DOI
 
[170]
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). https://doi.org/10.1371/journal.pone.0080814
View | Files available | DOI
 
[169]
2013 | Conference (Editor) | IST-REx-ID: 2292
Chatterjee, K., & Sgall, J. (Eds.). (2013). Mathematical Foundations of Computer Science 2013 (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical Foundations of Computer Science, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40313-2
View | DOI
 
[168]
2013 | Conference Paper | IST-REx-ID: 2444   OA
Chatterjee, K., & Ła̧Cki, J. (2013). Faster algorithms for Markov decision processes with low treewidth. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_36
View | DOI | Download (ext.) | arXiv
 
[167]
2013 | Conference Paper | IST-REx-ID: 2305   OA
Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2013). Trading performance for stability in Markov decision processes. In 28th Annual ACM/IEEE Symposium (pp. 331–340). New Orleans, LA, United States: IEEE. https://doi.org/10.1109/LICS.2013.39
View | Files available | DOI | Download (ext.) | arXiv
 
[166]
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, 228229, 83–119. https://doi.org/10.1016/j.ic.2013.04.003
View | DOI
 
[165]
2013 | Journal Article | IST-REx-ID: 2831   OA
Chatterjee, K., Henzinger, M., 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. https://doi.org/10.1007/s10703-012-0180-2
View | DOI | Download (ext.) | arXiv
 
[164]
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. https://doi.org/10.1007/s00165-013-0283-6
View | DOI | Download (ext.) | arXiv
 
[163]
2013 | Journal Article | IST-REx-ID: 2817   OA
Novak, S., Chatterjee, K., & Nowak, M. (2013). Density games. Journal of Theoretical Biology, 334, 26–34. https://doi.org/10.1016/j.jtbi.2013.05.029
View | Files available | DOI
 
[162]
2013 | Technical Report | IST-REx-ID: 5400   OA
Chatterjee, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with ω-regular objectives. IST Austria. https://doi.org/10.15479/AT:IST-2013-109-v1-1
View | Files available | DOI
 
[161]
2013 | Conference Paper | IST-REx-ID: 1376
Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In 13th International Conference on Formal Methods in Computer-Aided Design (pp. 18–25). Portland, OR, United States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679386
View | Files available | DOI
 
[160]
2013 | Technical Report | IST-REx-ID: 5405   OA
Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2013). Perfect-information stochastic mean-payoff parity games. IST Austria. https://doi.org/10.15479/AT:IST-2013-128-v1-1
View | Files available | DOI
 
[159]
2013 | Conference Paper | IST-REx-ID: 2329
Chatterjee, K., & Velner, Y. (2013). Hyperplane separation technique for multidimensional mean-payoff games. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentinia: Springer. https://doi.org/10.1007/978-3-642-40184-8_35
View | Files available | DOI | Download (ext.) | arXiv
 
[158]
2013 | Conference Paper | IST-REx-ID: 2279
Chatterjee, K., Doyen, L., Randour, M., & Raskin, J. (2013). Looking at mean-payoff and total-payoff through windows. Presented at the ATVA: Automated Technology for Verification and Analysis, Hanoi, Vietnam: Springer. https://doi.org/10.1007/978-3-319-02444-8_10
View | Files available | DOI | Download (ext.)
 
[157]
2013 | Technical Report | IST-REx-ID: 5406   OA
Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013). Distributed synthesis for LTL Fragments. IST Austria. https://doi.org/10.15479/AT:IST-2013-130-v1-1
View | Files available | DOI
 
[156]
2013 | Conference Paper | IST-REx-ID: 2820
Chatterjee, K., Kößler, A., & Schmid, U. (2013). Automated analysis of real-time scheduling using graph games. In Proceedings of the 16th International conference on Hybrid systems: Computation and control (pp. 163–172). Philadelphia, PA, United States: ACM. https://doi.org/10.1145/2461328.2461356
View | Files available | DOI
 
[155]
2013 | Conference Paper | IST-REx-ID: 2446   OA
Chatterjee, K., Gaiser, A., & Kretinsky, J. (2013). Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_37
View | DOI | Download (ext.) | arXiv
 
[154]
2013 | Journal Article | IST-REx-ID: 2299   OA
Godhal, Y., Chatterjee, K., & Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer, 15(5–6), 585–601. https://doi.org/10.1007/s10009-011-0207-9
View | Files available | DOI
 
[153]
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. https://doi.org/10.1142/S0129054113400066
View | DOI | Download (ext.) | arXiv
 
[152]
2013 | Conference Paper | IST-REx-ID: 2819   OA
Chatterjee, K., & Prabhu, V. (2013). Quantitative timed simulation functions and refinement metrics for real-time systems. In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control (Vol. 1, pp. 273–282). Philadelphia, PA USA: Springer. https://doi.org/10.1145/2461328.2461370
View | DOI | Download (ext.)
 
[151]
2013 | Technical Report | IST-REx-ID: 5399   OA
Reiter, J., Bozic, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for Tumor Progression. IST Austria. https://doi.org/10.15479/AT:IST-2013-104-v1-1
View | Files available | DOI
 
[150]
2013 | Conference Paper | IST-REx-ID: 1374   OA
Chatterjee, K., & Fijalkow, N. (2013). Infinite-state games with finitary conditions. In 22nd EACSL Annual Conference on Computer Science Logic (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.181
View | Files available | DOI
 
[149]
2013 | Conference Paper | IST-REx-ID: 2238
Chatterjee, K., Forejt, V., & Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_17
View | DOI
 
[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. https://doi.org/10.1111/eva.12020
View | Files available | DOI
 
[147]
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. https://doi.org/10.1007/s10703-012-0170-4
View | DOI
 
[146]
2013 | Conference Paper | IST-REx-ID: 2295
Chatterjee, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.165
View | Files available | DOI
 
[145]
2013 | Technical Report | IST-REx-ID: 5403   OA
Chatterjee, K., & Ibsen-Jensen, R. (2013). Qualitative analysis of concurrent mean-payoff games. IST Austria. https://doi.org/10.15479/AT:IST-2013-126-v1-1
View | Files available | DOI
 
[144]
2013 | Conference Paper | IST-REx-ID: 2000
Reiter, J., Božić, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for tumor progression. In Proceedings of 25th Int. Conf. on Computer Aided Verification (Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_6
View | Files available | DOI | Download (ext.) | arXiv
 
[143]
2013 | Technical Report | IST-REx-ID: 5410   OA
Ahmed, U., Chatterjee, K., & Gulwani, S. (2013). Automatic generation of alternative starting positions for traditional board games. IST Austria. https://doi.org/10.15479/AT:IST-2013-146-v1-1
View | Files available | DOI
 
[142]
2013 | Technical Report | IST-REx-ID: 5408   OA
Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2013). The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria. https://doi.org/10.15479/AT:IST-2013-141-v1-1
View | Files available | DOI
 
[141]
2012 | Conference Paper | IST-REx-ID: 2715   OA
Chatterjee, K., Joglekar, M., & Shah, N. (2012). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Vol. 18, pp. 461–473). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461
View | Files available | DOI
 
[140]
2012 | Conference Paper | IST-REx-ID: 2936   OA
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2012). Finite automata with time delay blocks. In roceedings of the tenth ACM international conference on Embedded software (pp. 43–52). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380370
View | DOI | Download (ext.)
 
[139]
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. https://doi.org/10.1142/S0129054112400308
View | DOI
 
[138]
2012 | Conference Paper | IST-REx-ID: 2955
Chatterjee, K., & Doyen, L. (2012). Partial-observation stochastic games: How to win when belief fails. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science (p. 6280436). Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.28
View | Files available | DOI | Download (ext.) | arXiv
 
[137]
2012 | Technical Report | IST-REx-ID: 5377   OA
Chatterjee, K., & Velner, Y. (2012). Mean-payoff pushdown games. IST Austria. https://doi.org/10.15479/AT:IST-2012-0002
View | Files available | DOI
 
[136]
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. https://doi.org/10.1016/j.jtbi.2012.02.021
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[135]
2012 | Conference Paper | IST-REx-ID: 3252   OA
Chatterjee, K., & Raman, V. (2012). Synthesizing protocols for digital contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_11
View | DOI | Download (ext.)
 
[134]
2012 | Journal Article | IST-REx-ID: 3846   OA
Chatterjee, K., & Henzinger, T. A. (2012). A survey of stochastic ω regular games. Journal of Computer and System Sciences, 78(2), 394–413. https://doi.org/10.1016/j.jcss.2011.05.002
View | Files available | DOI
 
[133]
2012 | Conference Paper | IST-REx-ID: 497
Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2012.167
View | Files available | DOI
 
[132]
2012 | Conference Paper | IST-REx-ID: 2956
Chatterjee, K., & Velner, Y. (2012). Mean payoff pushdown games. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.30
View | Files available | DOI
 
[131]
2012 | Technical Report | IST-REx-ID: 5378   OA
Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations. IST Austria. https://doi.org/10.15479/AT:IST-2012-0001
View | Files available | DOI
 
[130]
2012 | Conference Paper | IST-REx-ID: 3341
Chatterjee, K. (2012). Robustness of structurally equivalent concurrent parity games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia: Springer. https://doi.org/10.1007/978-3-642-28729-9_18
View | Files available | DOI | Download (ext.) | arXiv
 
[129]
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. https://doi.org/10.1016/j.tpb.2011.11.003
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
[128]
2012 | Conference Paper | IST-REx-ID: 2957
Chatterjee, K., & Tracol, M. (2012). Decidable problems for probabilistic automata on infinite words. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science (p. 6280437). Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.29
View | Files available | DOI | Download (ext.) | arXiv
 
[127]
2012 | Journal Article | IST-REx-ID: 2972   OA
Chatterjee, K., & Doyen, L. (2012). Energy parity games. Theoretical Computer Science, 458, 49–60. https://doi.org/10.1016/j.tcs.2012.07.038
View | Files available | DOI
 
[126]
2012 | Journal Article | IST-REx-ID: 3254
Chatterjee, K. (2012). The complexity of stochastic Müller games. Information and Computation, 211, 29–48. https://doi.org/10.1016/j.ic.2011.11.004
View | DOI | Download (ext.)
 
[125]
2012 | Conference Paper | IST-REx-ID: 3165
Chatterjee, K., & Henzinger, M. (2012). An O(n2) time algorithm for alternating Büchi games. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1386–1399). Kyoto, Japan: SIAM. https://doi.org/10.1137/1.9781611973099.109
View | Files available | DOI
 
[124]
2012 | Conference Paper | IST-REx-ID: 2947   OA
Chatterjee, K., Chmelik, M., & Majumdar, R. (2012). Equivalence of games with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399). Presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India: Springer. https://doi.org/10.1007/978-3-642-33386-6_30
View | DOI | Download (ext.)
 
[123]
2012 | Conference Paper | IST-REx-ID: 3135   OA
Brázdil, B., Chatterjee, K., Kučera, A., & Novotny, P. (2012). Efficient controller synthesis for consumption games with multiple resource types (Vol. 7358, pp. 23–38). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer. https://doi.org/10.1007/978-3-642-31424-7_8
View | DOI | Download (ext.)
 
[122]
2012 | Journal Article | IST-REx-ID: 3128   OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2012). A survey of partial-observation stochastic parity games. Formal Methods in System Design, 43(2), 268–284. https://doi.org/10.1007/s10703-012-0164-2
View | Files available | DOI
 
[121]
2012 | Conference Paper | IST-REx-ID: 3255
Chatterjee, K., & Doyen, L. (2012). Games and Markov decision processes with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-25929-6_3
View | DOI
 
[120]
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee, K., Henzinger, T. A., & Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, & C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_17
View | DOI
 
[119]
2011 | Conference Paper | IST-REx-ID: 3345
Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland: Springer. https://doi.org/10.1007/978-3-642-22993-0_21
View | Files available | DOI | Download (ext.) | arXiv
 
[118]
2011 | Technical Report | IST-REx-ID: 5384   OA
Chatterjee, K., & Tracol, M. (2011). Decidable problems for probabilistic automata on infinite words. IST Austria. https://doi.org/10.15479/AT:IST-2011-0004
View | Files available | DOI
 
[117]
2011 | Journal Article | IST-REx-ID: 3338
Chatterjee, K. (2011). Bounded rationality in concurrent parity games. CoRR: Computing Research Repository, 1–51.
View | Files available | Download (ext.) | arXiv
 
[116]
2011 | Conference Paper | IST-REx-ID: 3346   OA
Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, A. (2011). Two views on multiple mean payoff objectives in Markov Decision Processes. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.10
View | DOI | Download (ext.)
 
[115]
2011 | Journal Article | 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. CoRR: Computing Research Repository.
View | Download (ext.) | arXiv
 
[114]
2011 | Conference Paper | IST-REx-ID: 3365   OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. https://doi.org/10.1007/978-3-642-19835-9_24
View | Files available | DOI
 
[113]
2011 | Journal Article | IST-REx-ID: 3315
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games: Complexity and robustness. Logical Methods in Computer Science, 7(4). https://doi.org/10.2168/LMCS-7(4:8)2011
View | Files available | DOI
 
[112]
2011 | Technical Report | IST-REx-ID: 5380   OA
Chatterjee, K. (2011). Bounded rationality in concurrent parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0008
View | Files available | DOI
 
[111]
2011 | Technical Report | IST-REx-ID: 5385   OA
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003
View | Files available | DOI
 
[110]
2011 | Conference Paper | IST-REx-ID: 3347   OA
Chatterjee, K., & Fijalkow, N. (2011). Finitary languages. In A.-H. Dediu, S. Inenaga, & C. Martín-Vide (Eds.) (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_16
View | DOI | Download (ext.)
 
[109]
2011 | Conference Paper | IST-REx-ID: 3342   OA
Chatterjee, K., Henzinger, M., Joglekar, M., & Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_21
View | DOI | Download (ext.) | arXiv
 
[108]
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL), 12(4). https://doi.org/10.1145/1970398.1970404
View | Files available | DOI
 
[107]
2011 | Conference Paper | IST-REx-ID: 3316
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2011). Specification-centered robustness (pp. 176–185). Presented at the SIES: International Symposium on Industrial Embedded Systems, Vasteras, Sweden: IEEE. https://doi.org/10.1109/SIES.2011.5953660
View | DOI
 
[106]
2011 | Conference Paper | IST-REx-ID: 3361   OA
Cerny, P., Chatterjee, K., & Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. https://doi.org/10.1109/CSF.2011.21
View | Files available | DOI
 
[105]
2011 | Technical Report | IST-REx-ID: 5381   OA
Chatterjee, K., & Doyen, L. (2011). Partial-observation stochastic games: How to win when belief fails. IST Austria. https://doi.org/10.15479/AT:IST-2011-0007
View | Files available | DOI
 
[104]
2011 | Technical Report | IST-REx-ID: 5379   OA
Chatterjee, K., & Henzinger, M. (2011). An O(n2) time algorithm for alternating Büchi games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0009
View | Files available | DOI
 
[103]
2011 | Conference Paper | IST-REx-ID: 3366
Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_20
View | Files available | DOI
 
[102]
2011 | Conference Paper | IST-REx-ID: 3348   OA
Chatterjee, K., & Prabhu, V. (2011). Synthesis of memory efficient real time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA: Springer. https://doi.org/10.1145/1967701.1967734
View | DOI | Download (ext.)
 
[101]
2011 | Conference Paper | IST-REx-ID: 3350
Chatterjee, K., & Majumdar, R. (2011). Minimum attention controller synthesis for omega regular objectives. In U. Fahrenberg & S. Tripakis (Eds.) (Vol. 6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark: Springer. https://doi.org/10.1007/978-3-642-24310-3_11
View | DOI
 
[100]
2011 | Conference Paper | IST-REx-ID: 3343   OA
Chatterjee, K., & Henzinger, M. (2011). Faster and dynamic algorithms for maximal end component decomposition and related graph problems in probabilistic verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms, San Francisco, USA: SIAM. https://doi.org/10.1137/1.9781611973082.101
View | DOI | Download (ext.)
 
[99]
2011 | Technical Report | IST-REx-ID: 5382   OA
Chatterjee, K. (2011). Robustness of structurally equivalent concurrent parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0006
View | Files available | DOI
 
[98]
2011 | Technical Report | IST-REx-ID: 5387   OA
Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2011-0001
View | Files available | DOI
 
[97]
2011 | Preprint | IST-REx-ID: 3363   OA
Chatterjee, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.
View | Download (ext.) | arXiv
 
[96]
2011 | Conference Paper | IST-REx-ID: 3349   OA
Chatterjee, K., & Fijalkow, N. (2011). A reduction from parity games to simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. https://doi.org/10.4204/EPTCS.54.6
View | DOI | Download (ext.)
 
[95]
2011 | Conference Paper | IST-REx-ID: 3351   OA
Chatterjee, K., Doyen, L., & Singh, R. (2011). On memoryless quantitative objectives. In O. Owe, M. Steffen, & J. A. Telle (Eds.) (Vol. 6914, pp. 148–159). Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer. https://doi.org/10.1007/978-3-642-22953-4_13
View | DOI | Download (ext.)
 
[94]
2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee, K. (2011). Graph games with reachability objectives. In G. Delzanno & I. Potapov (Eds.) (Vol. 6945, pp. 1–1). Presented at the RP: Reachability Problems, Genoa, Italy: Springer. https://doi.org/10.1007/978-3-642-24288-5_1
View | DOI
 
[93]
2011 | Conference Paper | IST-REx-ID: 3356
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33
View | Files available | DOI
 
[92]
2010 | Conference Paper | IST-REx-ID: 3852   OA
Chatterjee, K., & Majumdar, R. (2010). Discounting in games across time scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. https://doi.org/10.4204/EPTCS.25.6
View | Files available | DOI | Download (ext.) | arXiv
 
[91]
2010 | Conference Paper | IST-REx-ID: 3864   OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer. https://doi.org/10.1007/978-3-642-14295-6_34
View | Files available | DOI | Download (ext.)
 
[90]
2010 | Conference Paper | IST-REx-ID: 3857
Chatterjee, K., & Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer. https://doi.org/10.1007/978-3-642-15643-4_1
View | Files available | DOI
 
[89]
2010 | Conference Paper | IST-REx-ID: 3853   OA
Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., & Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_19
View | Files available | DOI
 
[88]
2010 | Conference Paper | IST-REx-ID: 3858
Chatterjee, K., & Doyen, L. (2010). The complexity of partial-observation parity games. In C. Fermüller & A. Voronkov (Eds.) (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. https://doi.org/10.1007/978-3-642-16242-8_1
View | DOI
 
[87]
2010 | Conference Paper | IST-REx-ID: 3865
Chatterjee, K., De Alfaro, L., Raman, V., & Sánchez, C. (2010). Analyzing the impact of change in multi-threaded programs. In D. Rosenblum & G. Taenzer (Eds.) (Vol. 6013, pp. 293–307). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. https://doi.org/10.1007/978-3-642-12029-9_21
View | DOI
 
[86]
2010 | Conference Paper | IST-REx-ID: 3860   OA
Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505
View | Files available | DOI
 
[85]
2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee, K., Horn, F., & Löding, C. (2010). Obliging games (Vol. 6269, pp. 284–296). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_20
View | DOI
 
[84]
2010 | Conference Paper | IST-REx-ID: 3866   OA
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, & P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_36
View | Files available | DOI
 
[83]
2010 | Journal Article | IST-REx-ID: 3861
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2010). Strategy logic. Information and Computation, 208(6), 677–693. https://doi.org/10.1016/j.ic.2009.07.004
View | Files available | DOI
 
[82]
2010 | Conference (Editor) | IST-REx-ID: 3859
Chatterjee, K., & Henzinger, T. A. (Eds.). (2010). FORMATS: Formal modeling and analysis of timed systems (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-15297-9
View | DOI
 
[81]
2010 | Conference Paper | IST-REx-ID: 4388
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_57
View | Files available | DOI | Download (ext.) | arXiv
 
[80]
2010 | Journal Article | IST-REx-ID: 3862   OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Quantitative languages. ACM Transactions on Computational Logic (TOCL), 11(4), 23. https://doi.org/10.1145/1805950.1805953
View | Files available | DOI
 
[79]
2010 | Conference Paper | IST-REx-ID: 3855
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_24
View | Files available | DOI
 
[78]
2010 | Journal Article | IST-REx-ID: 3867
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science, 6(3), 1–23. https://doi.org/10.2168/LMCS-6(3:10)2010
View | Files available | DOI
 
[77]
2010 | Conference Paper | IST-REx-ID: 3851   OA
Chatterjee, K., & Doyen, L. (2010). Energy parity games (Vol. 6199, pp. 599–610). Presented at the ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France: Springer. https://doi.org/10.1007/978-3-642-14162-1_50
View | DOI | Download (ext.) | arXiv
 
[76]
2010 | Conference Paper | IST-REx-ID: 3856   OA
Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_23
View | Files available | DOI | Download (ext.)
 
[75]
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. https://doi.org/10.2168/LMCS-6(3:13)2010
View | Files available | DOI
 
[74]
2010 | Journal Article | IST-REx-ID: 3863
Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. Information and Computation, 208(10), 1206–1220. https://doi.org/10.1016/j.ic.2009.09.006
View | Files available | DOI
 
[73]
2010 | Technical Report | IST-REx-ID: 5388   OA
Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria. https://doi.org/10.15479/AT:IST-2010-0004
View | Files available | DOI
 
[72]
2010 | Technical Report | IST-REx-ID: 5390   OA
Chatterjee, K., & Fijalkow, N. (2010). Topological, automata-theoretic and logical characterization of finitary languages. IST Austria. https://doi.org/10.15479/AT:IST-2010-0002
View | Files available | DOI
 
[71]
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). https://doi.org/10.2168/LMCS-5(2:7)2009
View | DOI
 
[70]
2009 | Conference Paper | IST-REx-ID: 3871   OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Probabilistic weighted automata (Vol. 5710, pp. 244–258). Presented at the CONCUR: Concurrency Theory, Bologna, Italy: Springer. https://doi.org/10.1007/978-3-642-04081-8_17
View | Files available | DOI
 
[69]
2009 | Conference Paper | IST-REx-ID: 4545   OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). A survey of stochastic games with limsup and liminf objectives (Vol. 5556, pp. 1–15). Presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece: Springer. https://doi.org/10.1007/978-3-642-02930-1_1
View | Files available | DOI
 
[68]
2009 | Conference Paper | IST-REx-ID: 4569   OA
Bloem, R., Chatterjee, K., Henzinger, T. A., & Jobstmann, B. (2009). Better quality in synthesis through quantitative objectives (Vol. 5643, pp. 140–156). Presented at the CAV: Computer Aided Verification, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-02658-4_14
View | DOI | Download (ext.) | arXiv
 
[67]
2009 | Conference Paper | IST-REx-ID: 4540
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Expressiveness and closure properties for quantitative languages (pp. 199–208). Presented at the LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.2009.16
View | Files available | DOI
 
[66]
2009 | Technical Report | IST-REx-ID: 5392   OA
Chatterjee, K. (2009). Probabilistic automata on infinite words: Decidability and undecidability results. IST Austria. https://doi.org/10.15479/AT:IST-2009-0004
View | Files available | DOI
 
[65]
2009 | Conference Paper | IST-REx-ID: 4580   OA
Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T. A. (2009). Alpaga: A tool for solving parity games with imperfect information (Vol. 5505, pp. 58–61). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. https://doi.org/10.1007/978-3-642-00768-2_7
View | Files available | DOI | Download (ext.)
 
[64]
2009 | Conference Paper | IST-REx-ID: 4542   OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Alternating weighted automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland: Springer. https://doi.org/10.1007/978-3-642-03409-1_2
View | Files available | DOI
 
[63]
2009 | Technical Report | IST-REx-ID: 5393   OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2009). Gist: A solver for probabilistic games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0003
View | Files available | DOI
 
[62]
2009 | Conference Paper | IST-REx-ID: 4543
Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Stochastic games with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia: Springer. https://doi.org/10.1007/978-3-642-03816-7_4
View | DOI
 
[61]
2009 | Technical Report | IST-REx-ID: 5394   OA
Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Improved lower bounds for request-response and finitary Streett games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0002
View | Files available | DOI
 
[60]
2009 | Conference Paper | IST-REx-ID: 3503   OA
Chatterjee, K., & Henzinger, T. A. (2009). Probabilistic systems with limsup and liminf objectives (Vol. 5489, pp. 32–45). Presented at the ILC: Infinity in Logic and Computation, Springer. https://doi.org/10.1007/978-3-642-03092-5_4
View | DOI | Download (ext.)
 
[59]
2009 | Journal Article | IST-REx-ID: 3870   OA
Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL), 11(1). https://doi.org/10.1145/1614431.1614432
View | Files available | DOI
 
[58]
2009 | Conference Paper | IST-REx-ID: 4544   OA
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2009). Termination criteria for solving concurrent safety and reachability games (pp. 197–206). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/10.1137/1.9781611973068.23
View | Files available | DOI | Download (ext.)
 
[57]
2009 | Technical Report | IST-REx-ID: 5395   OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Qualitative analysis of partially-observable Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2009-0001
View | Files available | DOI
 
[56]
2008 | Conference Paper | IST-REx-ID: 3876
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2008). Timed parity games: complexity and robustness (Vol. 5215, pp. 124–140). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Springer. https://doi.org/10.1007/978-3-540-85778-5_10
View | Files available | DOI
 
[55]
2008 | Conference Paper | IST-REx-ID: 3504
Chatterjee, K., De Alfaro, L., Majumdar, R., & Raman, V. (2008). Algorithms for game metrics (Vol. 2, pp. 107–118). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745
View | Files available | DOI
 
[54]
2008 | Conference Paper | IST-REx-ID: 3877
Chatterjee, K., Henzinger, T. A., & Jobstmann, B. (2008). Environment assumptions for synthesis (Vol. 5201, pp. 147–161). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-85361-9_14
View | DOI
 
[53]
2008 | Book Chapter | IST-REx-ID: 3872
Chatterjee, K., & Henzinger, T. A. (2008). Value iteration. In 25 Years in Model Checking (Vol. 5000, pp. 107–138). Springer. https://doi.org/10.1007/978-3-540-69850-0_7
View | DOI
 
[52]
2008 | Journal Article | IST-REx-ID: 4534
Chatterjee, K., & Henzinger, T. A. (2008). Reduction of stochastic parity to stochastic mean-payoff games. Information Processing Letters, 106(1), 1–7. https://doi.org/10.1016/j.ipl.2007.08.035
View | DOI | Download (ext.)
 
[51]
2008 | Conference Paper | IST-REx-ID: 4546
Chatterjee, K., Ghosal, A., Henzinger, T. A., Iercan, D., Kirsch, C., Pinello, C., & Sangiovanni Vincentelli, A. (2008). Logical reliability of interacting real-time tasks (pp. 909–914). Presented at the DATE: Design, Automation and Test in Europe, IEEE. https://doi.org/10.1145/1403375.1403595
View | DOI | Download (ext.)
 
[50]
2008 | Conference Paper | IST-REx-ID: 3501
Adler, B. T., Chatterjee, K., De Alfaro, L., Faella, M., Pye, I., & Raman, V. (2008). Assigning trust to Wikipedia content. Presented at the WikiSym: International Symposium on Wikis, ACM. https://doi.org/10.1145/1822258.1822293
View | DOI
 
[49]
2008 | Conference Paper | IST-REx-ID: 3873
Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2008). Controller synthesis with budget constraints (Vol. 4981, pp. 72–86). Presented at the HSCC: Hybrid Systems - Computation and Control, Springer. https://doi.org/DOI: 10.1007/978-3-540-78929-1_6
View | DOI
 
[48]
2008 | Conference Paper | IST-REx-ID: 3878   OA
Chatterjee, K., De Alfaro, L., & Majumdar, R. (2008). The complexity of coverage (Vol. 5356, pp. 91–106). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Springer. https://doi.org/10.1007/978-3-540-89330-1_7
View | DOI | Download (ext.)
 
[47]
2008 | Conference Paper | IST-REx-ID: 3880
Berwanger, D., Chatterjee, K., Doyen, L., Henzinger, T. A., & Raje, S. (2008). Strategy construction for parity games with imperfect information (Vol. 5201, pp. 325–339). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-85361-9
View | Files available | DOI
 
[46]
2008 | Conference Paper | IST-REx-ID: 3502
Chatterjee, K., De Alfaro, L., & Pye, I. (2008). Robust content-driven reputation (pp. 33–42). Presented at the AISec: Artificial Intelligence and Security, ACM. https://doi.org/10.1145/1456377.1456387
View | DOI
 
[45]
2008 | Conference Paper | IST-REx-ID: 3874
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2008). Trading infinite memory for uniform randomness in timed games (Vol. 4981, pp. 87–100). Presented at the HSCC: Hybrid Systems - Computation and Control, Springer. https://doi.org/10.1007/978-3-540-78929-1_7
View | DOI
 
[44]
2008 | Conference Paper | IST-REx-ID: 3879
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2008). Quantitative languages (Vol. 5213, pp. 385–400). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/978-3-540-87531-4_28
View | DOI
 
[43]
2008 | Journal Article | IST-REx-ID: 4548
Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2008). Stochastic limit-average games are in EXPTIME. International Journal of Game Theory, 37(2), 219–234. https://doi.org/10.1007/s00182-007-0110-5
View | DOI | Download (ext.)
 
[42]
2008 | Conference Paper | IST-REx-ID: 3875
Chatterjee, K., Henzinger, T. A., & Sen, K. (2008). Model-checking omega-regular properties of interval Markov chains (Vol. 4962, pp. 302–317). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-78499-9_22
View | DOI
 
[41]
2007 | Conference Paper | IST-REx-ID: 3883
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2007). Generalized parity games (Vol. 4423, pp. 153–167). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-71389-0_12
View | DOI
 
[40]
2007 | Conference Paper | IST-REx-ID: 3884
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2007). Strategy logic (Vol. 4703, pp. 59–73). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-74407-8_5
View | Files available | DOI
 
[39]
2007 | Conference Paper | IST-REx-ID: 3885
Chatterjee, K. (2007). Optimal strategy synthesis in stochastic Müller games (Vol. 4423, pp. 138–152). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-71389-0_11
View | DOI
 
[38]
2007 | Journal Article | IST-REx-ID: 4547
Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2007). Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science, 3(184), 1–23. https://doi.org/10.2168/LMCS-3(3:4)2007
View | DOI
 
[37]
2007 | Thesis | IST-REx-ID: 4559
Chatterjee, K. (2007). Stochastic ω-Regular Games (pp. 1–247). University of California, Berkeley.
View | Download (ext.)
 
[36]
2007 | Conference Paper | IST-REx-ID: 3886
Chatterjee, K. (2007). Stochastic Müller games are PSPACE-complete (Vol. 4855, pp. 436–448). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-77050-3_36
View | DOI
 
[35]
2007 | Conference Paper | IST-REx-ID: 3881
De Alfaro, L., Chatterjee, K., Faella, M., & Legay, A. (2007). Qualitative logics and equivalences for probabilistic systems (pp. 237–248). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2007.15
View | DOI
 
[34]
2007 | Conference Paper | IST-REx-ID: 3887
Chatterjee, K. (2007). Markov decision processes with multiple long-run average objectives (Vol. 4855, pp. 473–484). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-77050-3_39
View | DOI
 
[33]
2007 | Journal Article | IST-REx-ID: 3882
Chatterjee, K. (2007). Concurrent games with tail objectives. Theoretical Computer Science, 388(1–3), 181–198. https://doi.org/10.1016/j.tcs.2007.07.047
View | DOI
 
[32]
2007 | Conference Paper | IST-REx-ID: 4537
Chatterjee, K., & Henzinger, T. A. (2007). Assume-guarantee synthesis (Vol. 4424, pp. 261–275). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. https://doi.org/10.1007/978-3-540-71209-1_21
View | DOI
 
[31]
2006 | Conference Paper | IST-REx-ID: 3888
Chatterjee, K., & Henzinger, T. A. (2006). Strategy improvement for stochastic Rabin and Streett games (Vol. 4137, pp. 375–389). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/11817949_25
View | DOI
 
[30]
2006 | Conference Paper | IST-REx-ID: 3890
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2006). The complexity of quantitative concurrent parity games (pp. 678–687). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/10.1145/1109557.1109631
View | DOI
 
[29]
2006 | Conference Paper | IST-REx-ID: 4552
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2006). Strategy improvement for concurrent reachability games (pp. 291–300). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2006.48
View | DOI
 
[28]
2006 | Conference Paper | IST-REx-ID: 4538
Chatterjee, K., & Henzinger, T. A. (2006). Strategy improvement and randomized subexponential algorithms for stochastic parity games (Vol. 3884, pp. 512–523). Presented at the STACS: Theoretical Aspects of Computer Science, Springer. https://doi.org/10.1007/11672142_42
View | DOI
 
[27]
2006 | Conference Paper | IST-REx-ID: 3500
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2006). Algorithms for Büchi Games. Presented at the GDV: Games in Design and Verification, ACM.
View | Download (ext.)
 
[26]
2006 | Conference Paper | IST-REx-ID: 3889
Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2006). Algorithms for omega-regular games with imperfect information (Vol. 4207, pp. 287–302). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_19
View | DOI
 
[25]
2006 | Conference Paper | IST-REx-ID: 3891
Chatterjee, K. (2006). Concurrent games with tail objectives (Vol. 4207, pp. 256–270). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_17
View | DOI
 
[24]
2006 | Conference Paper | IST-REx-ID: 4539
Chatterjee, K., & Henzinger, T. A. (2006). Finitary winning in omega-regular games (Vol. 3920, pp. 257–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. https://doi.org/10.1007/11691372_17
View | DOI
 
[23]
2006 | Conference Paper | IST-REx-ID: 3449
Chatterjee, K., Jagadeesan, R., & Pitcher, C. (2006). Games for controls (pp. 70–82). Presented at the CSF: Computer Security Foundations, IEEE. https://doi.org/10.1109/CSFW.2006.14
View | DOI
 
[22]
2006 | Conference Paper | IST-REx-ID: 3499
Chatterjee, K. (2006). Nash equilibrium for upward-closed objectives (Vol. 4207, pp. 271–286). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_18
View | DOI
 
[21]
2006 | Journal Article | IST-REx-ID: 4550
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2006). Games with secure equilibria. Theoretical Computer Science, 365(1–2), 67–82. https://doi.org/10.1016/j.tcs.2006.07.032
View | DOI
 
[20]
2006 | Conference Paper | IST-REx-ID: 4549
Chatterjee, K., De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., & Stoelinga, M. (2006). Compositional quantitative reasoning (pp. 179–188). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2006.11
View | DOI
 
[19]
2006 | Conference Paper | IST-REx-ID: 4551
Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2006). Markov decision processes with multiple objectives (Vol. 3884, pp. 325–336). Presented at the STACS: Theoretical Aspects of Computer Science, Springer. https://doi.org/10.1007/11672142_26
View | DOI
 
[18]
2005 | Conference Paper | IST-REx-ID: 4557
Chatterjee, K., Henzinger, T. A., Jhala, R., & Majumdar, R. (2005). Counterexample-guided planning (pp. 104–111). Presented at the UAI: Uncertainty in Artificial Intelligence, AUAI Press.
View | Download (ext.)
 
[17]
2005 | Conference Paper | IST-REx-ID: 3896
Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2005). Complexity of compositional model checking of computation tree logic on simple structures (Vol. 3326, pp. 89–102). Presented at the IWDC: International Workshop on Distributed Computing , Springer. https://doi.org/10.1007/978-3-540-30536-1_13
View | DOI
 
[16]
2005 | Conference Paper | IST-REx-ID: 4541
Chatterjee, K., & Henzinger, T. A. (2005). Semiperfect-information games (Vol. 3821, pp. 1–18). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/11590156_1
View | DOI
 
[15]
2005 | Conference Paper | IST-REx-ID: 4553
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2005). The complexity of stochastic Rabin and Streett games (Vol. 3580, pp. 878–890). Presented at the ICALP: Automata, Languages and Programming, Springer. https://doi.org/10.1007/11523468_71
View | DOI
 
[14]
2005 | Conference Paper | IST-REx-ID: 4560
Chakrabarti, A., Chatterjee, K., Henzinger, T. A., Kupferman, O., & Majumdar, R. (2005). Verifying quantitative properties using bound functions (Vol. 3725, pp. 50–64). Presented at the CHARME: Correct Hardware Design and Verification Methods, Springer. https://doi.org/10.1007/11560548_7
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 3892
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2005). Games with secure equilibria (Vol. 3657, pp. 141–161). Presented at the FMCO: Formal Methods for Components and Objects, Springer. https://doi.org/10.1007/11561163_7
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 4554
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2005). Mean-payoff parity games (pp. 178–187). Presented at the LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.2005.26
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 3893
Chatterjee, K. (2005). Two-player nonzero-sum ω-regular games (Vol. 3653, pp. 413–427). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/11539452_32
View | DOI
 
[10]
2004 | Conference Paper | IST-REx-ID: 3895
Chatterjee, K., Henzinger, T. A., & Jurdziński, M. (2004). Games with secure equilibria (pp. 160–169). Presented at the LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.2004.1319610
View | DOI
 
[9]
2004 | Conference Paper | IST-REx-ID: 4558
Chatterjee, K., Jurdziński, M., & Henzinger, T. A. (2004). Quantitative stochastic parity games (pp. 121–130). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
View
 
[8]
2004 | Conference Paper | IST-REx-ID: 4555
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2004). Trading memory for randomness (pp. 206–217). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. https://doi.org/10.1109/QEST.2004.10051
View | DOI
 
[7]
2004 | Conference Paper | IST-REx-ID: 3894
Chatterjee, K., Majumdar, R., & Jurdziński, M. (2004). On Nash equilibria in stochastic games (Vol. 3210, pp. 26–40). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/978-3-540-30124-0_6
View | DOI
 
[6]
2004 | Journal Article | IST-REx-ID: 4556
Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., & Palsberg, J. (2004). Stack size analysis for interrupt-driven programs. Information and Computation, 194(2), 144–174. https://doi.org/10.1016/j.ic.2004.06.001
View | DOI
 
[5]
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. https://doi.org/10.1023/A:1023217515688
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3897
Chatterjee, K., Jurdziński, M., & Henzinger, T. A. (2003). Simple stochastic parity games (Vol. 2803, pp. 100–113). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/978-3-540-45220-1_11
View | DOI
 
[3]
2003 | Conference Paper | IST-REx-ID: 3898
Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., & Palsberg, J. (2003). Stack size analysis for interrupt-driven programs (Vol. 2694, pp. 109–126). Presented at the SAS: Static Analysis Symposium, Springer. https://doi.org/10.1007/3-540-44898-5_7
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 3448
Mallick, S., Chatterjee, K., Merchant, A., & Dasgupta, P. (2002). Implementation of shape grammar for plan analysis. Presented at the IT-Built: Information Technology For Built Environment, Elsevier.
View
 
[1]
2001 | Conference Paper | IST-REx-ID: 3447
Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2001). Weighted quantified computation tree logic. Presented at the CIT: Conference on Information Technology, Elsevier.
View
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed