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.
508 Publications
2017 | Published | Conference Paper | IST-REx-ID: 1194 | 
K. Chatterjee, P. Novotný, and D. Zikelic, “Stochastic invariants for probabilistic termination,” presented at the POPL: Principles of Programming Languages, Paris, France, 2017, vol. 52, no. 1, pp. 145–160.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 551 |
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 552 |
K. Chatterjee, M. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 950 |
G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85.
[Published Version]
View
| Files available
| DOI
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 711 |
K. Chatterjee, T. A. Henzinger, and J. Otop, “Bidirectional nested weighted automata,” presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany, 2017, vol. 85.
[Published Version]
View
| Files available
| DOI
2017 | Published | Journal Article | IST-REx-ID: 744 |
T. Priklopil, K. Chatterjee, and M. Nowak, “Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma,” Journal of Theoretical Biology, vol. 433. Elsevier, pp. 64–72, 2017.
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2017 | Published | Journal Article | IST-REx-ID: 716 |
K. Chatterjee and Y. Velner, “The complexity of mean-payoff pushdown games,” Journal of the ACM, vol. 64, no. 5. ACM, p. 34, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 717 |
K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” Journal of Computer and System Sciences, vol. 88. Academic Press, pp. 236–259, 2017.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 699 |
C. Veller, L. Hayward, M. Nowak, and C. Hilbe, “The red queen and king in finite populations,” PNAS, vol. 114, no. 27. National Academy of Sciences, pp. E5396–E5405, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| PubMed | Europe PMC
2017 | Published | Journal Article | IST-REx-ID: 684 |
K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,” Journal of Symbolic Logic, vol. 82, no. 2. Cambridge University Press, pp. 420–452, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 681 |
K. Chatterjee, L. Doyen, E. Filiot, and J. Raskin, “Doomsday equilibria for omega-regular games,” Information and Computation, vol. 254. Elsevier, pp. 296–315, 2017.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 671 |
C. Hilbe, V. Martinez, K. Chatterjee, and M. Nowak, “Memory-n strategies of direct reciprocity,” PNAS, vol. 114, no. 18. National Academy of Sciences, pp. 4715–4720, 2017.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| PubMed | Europe PMC
2017 | Published | Journal Article | IST-REx-ID: 653 |
A. Makohon Moore et al., “Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer,” Nature Genetics, vol. 49, no. 3. Nature Publishing Group, pp. 358–366, 2017.
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2017 | Published | Conference Paper | IST-REx-ID: 645 |
P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 628 |
K. Chatterjee, H. Fu, and A. Murhekar, “Automated recurrence analysis for almost linear expected runtime bounds,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 118–139.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 512 |
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1. Nature Publishing Group, 2017.
[Published Version]
View
| Files available
| DOI
| WoS
2017 | Published | Conference Paper | IST-REx-ID: 13160 |
J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record for transforming Rabin automata into parity automata,” in Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 443–460.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 465 |
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.
[Published Version]
View
| Files available
| DOI
| WoS
2017 | Published | Journal Article | IST-REx-ID: 464 |
K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv