Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
496 Publications
2013 | Published | Conference Paper | IST-REx-ID: 2819 | 
Chatterjee, K., & Prabhu, V. (2013). Quantitative timed simulation functions and refinement metrics for real-time systems. In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control (Vol. 1, pp. 273–282). Philadelphia, PA USA: Springer. https://doi.org/10.1145/2461328.2461370
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Published | Conference Paper | IST-REx-ID: 2886 |
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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2013 | Published | 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
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Published | 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
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2013 | Published | Technical Report | IST-REx-ID: 5406 |
Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013). Distributed synthesis for LTL Fragments. IST Austria. https://doi.org/10.15479/AT:IST-2013-130-v1-1
[Published Version]
View
| Files available
| DOI
2012 | Published | Journal Article | IST-REx-ID: 3846 |
Chatterjee, K., & Henzinger, T. A. (2012). A survey of stochastic ω regular games. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2011.05.002
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2012 | Published | Conference Paper | IST-REx-ID: 10905 |
Chatterjee, K., Henzinger, M., Krinninger, S., & Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In Algorithms – ESA 2012 (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer. https://doi.org/10.1007/978-3-642-33090-2_27
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 2715 |
Chatterjee, K., Joglekar, M., & Shah, N. (2012). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Vol. 18, pp. 461–473). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461
[Published Version]
View
| Files available
| DOI
2012 | Published | Conference Paper | IST-REx-ID: 3165 |
Chatterjee, Krishnendu, An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2012
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | 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. Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.29
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Journal Article | IST-REx-ID: 2848 |
Chatterjee, K., Zufferey, D., & Nowak, M. (2012). Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2012.02.021
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2012 | Published | Journal Article | IST-REx-ID: 3128 |
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2012). A survey of partial-observation stochastic parity games. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-012-0164-2
[Submitted Version]
View
| Files available
| DOI
2012 | Published | 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
[Submitted Version]
View
| Files available
| DOI
2012 | Published | Journal Article | IST-REx-ID: 3157 |
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. Nature Publishing Group. https://doi.org/10.1038/nature11219
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2012 | Published | Conference Paper | IST-REx-ID: 495 |
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
[Published Version]
View
| Files available
| DOI
2012 | Published | Conference Paper | IST-REx-ID: 496 |
Rabinovich, Alexander, Interpretations in trees with countably many branches. 2012
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Published | 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
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | 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
[Published Version]
View
| Files available
| DOI
2012 | Published | Journal Article | IST-REx-ID: 3260 |
Chatterjee, K., Reiter, J., & Nowak, M. (2012). Evolutionary dynamics of biological auctions. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2011.11.003
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2012 | Published | Technical Report | IST-REx-ID: 5378 |
Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations. IST Austria. https://doi.org/10.15479/AT:IST-2012-0001
[Published Version]
View
| Files available
| DOI