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.
465 Publications
2018 |Published| Journal Article | IST-REx-ID: 6009 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3. Association for Computing Machinery (ACM), 2018.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |Published| Conference Paper | IST-REx-ID: 5977 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, H. Fu, A. K. Goharshady, and N. Okati, “Computational approaches for stochastic shortest path on succinct MDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4700–4707.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |Published| Journal Article | IST-REx-ID: 2 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, and M. Nowak, “Indirect reciprocity with private, noisy, and incomplete information,” PNAS, vol. 115, no. 48. National Academy of Sciences, pp. 12241–12246, 2018.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| PubMed | Europe PMC
2017 |Published| Journal Article | IST-REx-ID: 10418 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule for almost-sure termination,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 |Published| Journal Article | IST-REx-ID: 464 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, M. H. 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
| arXiv
2017 |Published| Journal Article | IST-REx-ID: 466 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2. International Federation of Computational Logic, 2017.
[Published Version]
View
| Files available
| DOI
2017 |Published| Journal Article | IST-REx-ID: 467 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4. ACM, 2017.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2017 |Published| Journal Article | IST-REx-ID: 465 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
2017 |Published| Journal Article | IST-REx-ID: 512 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
2017 |Published| Journal Article | IST-REx-ID: 10416 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability for data-dependence and Alias analysis,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.
[Published Version]
View
| Files available
| DOI
| arXiv
2017 |Published| Technical Report | IST-REx-ID: 5455 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.
[Published Version]
View
| Files available
| DOI
2017 |Published| 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 |Published| 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 |Published| 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 |Published| 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 |Published| 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 |Published| 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 |Published| 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 |Published| 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 |Published| 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