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.
464 Publications
2017 | Journal Article | IST-REx-ID: 10417 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric dynamic partial order reduction,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Technical Report | IST-REx-ID: 5456 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 551 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 | Conference Paper | IST-REx-ID: 552 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, M. H. 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 | Conference Paper | IST-REx-ID: 553 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2017 | Book Chapter | IST-REx-ID: 625 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative reachability,” in Models, Algorithms, Logics and Tools, vol. 10460, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017, pp. 367–381.
[Submitted Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 628 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.)
2017 | Conference Paper | IST-REx-ID: 645 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.)
2017 | Conference Paper | IST-REx-ID: 6519 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.
[Published Version]
View
| Files available
| DOI
2017 | Journal Article | IST-REx-ID: 653 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
| PubMed | Europe PMC
2017 | Journal Article | IST-REx-ID: 671 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.)
| PubMed | Europe PMC
2017 | Journal Article | IST-REx-ID: 681 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.)
| arXiv
2017 | Journal Article | IST-REx-ID: 684 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.)
2017 | Journal Article | IST-REx-ID: 699 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.)
| PubMed | Europe PMC
2017 | Conference Paper | IST-REx-ID: 711 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 | Journal Article | IST-REx-ID: 716 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.)
| arXiv
2017 | Journal Article | IST-REx-ID: 717 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.)
2017 | Conference Paper | IST-REx-ID: 13160 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 950 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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