Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

527 Publications


2017 | Published | Book Chapter | IST-REx-ID: 625 | OA
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 | OA
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 | Conference Paper | IST-REx-ID: 1009 | OA
K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, and D. Zikelic, “Optimizing expectation with guarantees in POMDPs,” in Proceedings of the 31st AAAI Conference on Artificial Intelligence, San Francisco, CA, United States, 2017, vol. 5, pp. 3725–3732.
[Submitted Version] View | Download Submitted Version (ext.) | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 1011 | OA
K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 10416 | OA
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 | Journal Article | IST-REx-ID: 10418 | OA
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: 1065 | OA
K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,” Information Processing Letters, vol. 122. Elsevier, pp. 25–29, 2017.
[Submitted Version] View | Files available | DOI | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1066 | OA
K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, “Quantitative fair simulation games,” Information and Computation, vol. 254, no. 2. Elsevier, pp. 143–166, 2017.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1080 | OA
J. Reiter et al., “Reconstructing metastatic seeding patterns of human cancers,” Nature Communications, vol. 8. Nature Publishing Group, 2017.
[Published Version] View | Files available | DOI | WoS
 

2017 | Published | Thesis | PhD | IST-REx-ID: 821 | OA
A. Pavlogiannis, “Algorithmic advances in program analysis and their applications,” Institute of Science and Technology Austria, 2017.
[Published Version] View | Files available | DOI
 

earlier version | 2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
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: 645 | OA
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: 6519 | OA
K. Chatterjee, W. Dvorák, M. 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 | Published | Journal Article | IST-REx-ID: 653 | OA
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 | Journal Article | IST-REx-ID: 671 | OA
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: 681 | OA
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: 684 | OA
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: 699 | OA
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 | Conference Paper | IST-REx-ID: 711 | OA
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: 716 | OA
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
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed