Please note that IST Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

348 Publications


2014 | Conference Paper | IST-REx-ID: 2163 | OA
Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. In Lecture Notes in Computer Science (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer. https://doi.org/10.1007/978-3-662-43951-7_10
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

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
 

2014 | Conference Paper | IST-REx-ID: 2190 | OA
Esparza, J., & Kretinsky, J. (2014). From LTL to deterministic automata: A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the CAV: Computer Aided Verification, Springer. https://doi.org/10.1007/978-3-319-08867-9_13
View | DOI | Download Submitted Version (ext.)
 

2014 | Journal Article | IST-REx-ID: 2211 | OA
Chatterjee, K., & Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL), 15(2). https://doi.org/10.1145/2579821
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

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
 

2014 | Conference Paper | IST-REx-ID: 2213 | OA
Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2014). The complexity of partial-observation stochastic parity games with finite-memory strategies (Vol. 8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-54830-7_16
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Conference Paper | IST-REx-ID: 2216 | OA
Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2014). Edit distance for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany: Springer. https://doi.org/10.1145/2562059.2562141
View | Files available | DOI | Download Submitted Version (ext.)
 

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 Published Version (ext.)
 

2014 | Journal Article | IST-REx-ID: 2246 | OA
Grinshpun, A., Phalitnonkiat, P., Rubin, S., & Tarfulea, A. (2014). Alternating traps in Muller and parity games. Theoretical Computer Science, 521, 73–91. https://doi.org/10.1016/j.tcs.2013.11.032
View | DOI | Download Submitted Version (ext.)
 

2014 | Conference Paper | IST-REx-ID: 475 | OA
Aminof, B., & Rubin, S. (2014). First cycle games. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 146, pp. 83–90). Grenoble, France: Open Publishing Association. https://doi.org/10.4204/EPTCS.146.11
View | Files available | DOI
 

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 Submitted Version (ext.)
 

2014 | Technical Report | IST-REx-ID: 5412 | OA
Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v1-1
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5413 | OA
Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v2-2
View | Files available | DOI
 

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
 

2014 | Technical Report | IST-REx-ID: 5415 | OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2014). Nested weighted automata. IST Austria. https://doi.org/10.15479/AT:IST-2014-170-v1-1
View | Files available | DOI
 

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
 

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
 

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
 

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
 

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
 

2014 | Technical Report | IST-REx-ID: 5424 | OA
Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria. https://doi.org/10.15479/AT:IST-2014-305-v1-1
View | Files available | DOI
 

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
 

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
 

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
 

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 Preprint (ext.)
 

2014 | Journal Article | IST-REx-ID: 1733 | OA
Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science, 560(3), 348–363. https://doi.org/10.1016/j.tcs.2014.08.019
View | Files available | DOI | Download Submitted Version (ext.)
 

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
 

2014 | Journal Article | IST-REx-ID: 1884
Landau, D., Stewart, C., Reiter, J., Lawrence, M., Sougnez, C., Brown, J., … Wu, C. (2014). Novel putative driver gene mutations in chronic lymphocytic leukemia (CLL): results from a combined analysis of whole exome sequencing of 262 primary CLL aamples. Blood, 124(21), 1952–1952.
View | Download None (ext.)
 

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
 

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 Submitted Version (ext.)
 

2013 | Conference Paper | IST-REx-ID: 2000 | OA
Reiter, J., Božić, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for tumor progression. In Proceedings of 25th Int. Conf. on Computer Aided Verification (Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_6
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

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
 

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
 

2013 | Conference Paper | IST-REx-ID: 2279 | OA
Chatterjee, K., Doyen, L., Randour, M., & Raskin, J. (2013). Looking at mean-payoff and total-payoff through windows. Presented at the ATVA: Automated Technology for Verification and Analysis, Hanoi, Vietnam: Springer. https://doi.org/10.1007/978-3-319-02444-8_10
View | Files available | DOI | Download Preprint (ext.)
 

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
 

2013 | Conference Paper | IST-REx-ID: 2295 | OA
Chatterjee, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.165
View | Files available | DOI
 

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
 

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 Preprint (ext.) | arXiv
 

2013 | Conference Paper | IST-REx-ID: 2329 | OA
Chatterjee, K., & Velner, Y. (2013). Hyperplane separation technique for multidimensional mean-payoff games. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentinia: Springer. https://doi.org/10.1007/978-3-642-40184-8_35
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

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 Preprint (ext.) | arXiv
 

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 Preprint (ext.) | arXiv
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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 Preprint (ext.) | arXiv
 

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
 

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
 

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 Preprint (ext.)
 

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
 

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
 

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

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 Preprint (ext.) | arXiv
 

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
 

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
 

2013 | Conference Paper | IST-REx-ID: 2886 | OA
Chmelik, M., & Řehák, V. (2013). Controllable-choice message sequence graphs. Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Znojmo, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-36046-6_12
View | DOI | Download Submitted Version (ext.)
 

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
 

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
 

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
 

2012 | Conference Paper | IST-REx-ID: 495 | OA
Kruckman, A., Rubin, S., Sheridan, J., & Zax, B. (2012). A Myhill Nerode theorem for automata with advice. In Proceedings GandALF 2012 (Vol. 96, pp. 238–246). Napoli, Italy: Open Publishing Association. https://doi.org/10.4204/EPTCS.96.18
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 496 | OA
Rabinovich, A., & Rubin, S. (2012). Interpretations in trees with countably many branches. Presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.65
View | DOI | Download Preprint (ext.)
 

2012 | Conference Paper | IST-REx-ID: 497 | OA
Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2012.167
View | Files available | DOI
 

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
 

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
 

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
 

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 Submitted Version (ext.) | PubMed | Europe PMC
 

2012 | Conference Paper | IST-REx-ID: 2916 | OA
Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2012). Interface Simulation Distances. In Electronic Proceedings in Theoretical Computer Science (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. https://doi.org/10.4204/EPTCS.96.3
View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 

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 Preprint (ext.)
 

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 Preprint (ext.)
 

2012 | Conference Paper | IST-REx-ID: 2955 | OA
Chatterjee, K., & Doyen, L. (2012). Partial-observation stochastic games: How to win when belief fails. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.28
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

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
 

2012 | Conference Paper | IST-REx-ID: 2957 | OA
Chatterjee, K., & Tracol, M. (2012). Decidable problems for probabilistic automata on infinite words. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.29
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

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

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
 

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 Preprint (ext.)
 

2012 | Journal Article | IST-REx-ID: 3157 | OA
Diaz Jr, L., Williams, R., Wu, J., Kinde, I., Hecht, J., Berlin, J., … Vogelstein, B. (2012). The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature, 486(7404), 537–540. https://doi.org/10.1038/nature11219
View | Files available | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 

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
 

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 Preprint (ext.)
 

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 None (ext.)
 

2012 | Conference Paper | IST-REx-ID: 3255 | OA
Chatterjee, K., & Doyen, L. (2012). Games and Markov decision processes with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-25929-6_3
View | Files available | DOI
 

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 Submitted Version (ext.) | PubMed | Europe PMC
 

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
 

2012 | Conference Paper | IST-REx-ID: 3341 | OA
Chatterjee, K. (2012). Robustness of structurally equivalent concurrent parity games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia: Springer. https://doi.org/10.1007/978-3-642-28729-9_18
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

2011 | Journal Article | IST-REx-ID: 3315 | OA
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games: Complexity and robustness. Logical Methods in Computer Science, 7(4). https://doi.org/10.2168/LMCS-7(4:8)2011
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3316 | OA
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2011). Specification-centered robustness. In 6th IEEE International Symposium on Industrial and Embedded Systems (pp. 176–185). Vasteras, Sweden: IEEE. https://doi.org/10.1109/SIES.2011.5953660
View | DOI | Download Published Version (ext.)
 

2011 | Preprint | IST-REx-ID: 3338 | OA
Chatterjee, K. (2011). Bounded rationality in concurrent parity games. ArXiv. ArXiv.
View | Files available | Download Preprint (ext.) | arXiv
 

2011 | Preprint | IST-REx-ID: 3339 | OA
Chatterjee, K., De Alfaro, L., & Pritam, R. (2011). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. ArXiv. ArXiv.
View | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications