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.
514 Publications
2013 | Published | Journal Article | IST-REx-ID: 2836 | 
K. Chatterjee and V. Raman, “Assume-guarantee synthesis for digital contract signing,” Formal Aspects of Computing, vol. 26, no. 4. Springer, pp. 825–859, 2013.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2013 | Published | Journal Article | IST-REx-ID: 2817 |
S. Novak, K. Chatterjee, and M. Nowak, “Density games,” Journal of Theoretical Biology, vol. 334. Elsevier, pp. 26–34, 2013.
[Published Version]
View
| Files available
| DOI
| WoS
2013 | Published | Journal Article | IST-REx-ID: 2816 |
I. Božić et al., “Evolutionary dynamics of cancer in response to targeted combination therapy,” eLife, vol. 2. eLife Sciences Publications, 2013.
[Published Version]
View
| Files available
| DOI
| WoS
2013 | Published | Journal Article | IST-REx-ID: 2814 |
K. Chatterjee, L. Alfaro, and R. Majumdar, “The complexity of coverage,” International Journal of Foundations of Computer Science, vol. 24, no. 2. World Scientific Publishing, pp. 165–185, 2013.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2013 | Published | Conference Paper | IST-REx-ID: 2305 |
T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” in 28th Annual ACM/IEEE Symposium, New Orleans, LA, United States, 2013, pp. 331–340.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2013 | Published | Journal Article | IST-REx-ID: 2247 |
B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in alternating prisoner’s dilemma ,” PLoS One, vol. 8, no. 12. Public Library of Science, 2013.
[Published Version]
View
| Files available
| DOI
| WoS
2013 | Research Data Reference | IST-REx-ID: 9749
B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in alternating prisoner’s dilemma .” Public Library of Science, 2013.
[Published Version]
View
| Files available
| DOI
2012 | Published | Conference Paper | IST-REx-ID: 3255 |
K. Chatterjee and L. Doyen, “Games and Markov decision processes with mean payoff parity and energy parity objectives,” presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic, 2012, vol. 7119, pp. 37–46.
[Submitted Version]
View
| Files available
| DOI
2012 | Published | Conference Paper | IST-REx-ID: 495 |
A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for automata with advice,” in Proceedings GandALF 2012, Napoli, Italy, 2012, vol. 96, pp. 238–246.
[Published Version]
View
| Files available
| DOI
2012 | Published | Conference Paper | IST-REx-ID: 3341 |
K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 497 |
K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.
[Published Version]
View
| Files available
| DOI
2012 | Published | Technical Report | IST-REx-ID: 5378 |
K. Chatterjee, S. Chaubal, and P. Kamath, Faster algorithms for alternating refinement relations. IST Austria, 2012.
[Published Version]
View
| Files available
| DOI
2012 | Published | Conference Paper | IST-REx-ID: 2936 |
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in roceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 43–52.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 3135 |
B. Brázdil, K. Chatterjee, A. Kučera, and P. Novotný, “Efficient controller synthesis for consumption games with multiple resource types,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 23–38.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 3252 |
K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 2947 |
K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic uncertainty and partial observation games,” presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 385–399.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 2715 |
K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 2012, vol. 18, pp. 461–473.
[Published Version]
View
| Files available
| DOI
2012 | Published | Conference Paper | IST-REx-ID: 10904 |
K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” in CONCUR 2012 - Concurrency Theory, Newcastle upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 3165 |
K. Chatterjee and M. Henzinger, “An O(n2) time algorithm for alternating Büchi games,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japan, 2012, pp. 1386–1399.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv