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.
454 Publications
2017 | Published | Journal Article | IST-REx-ID: 10417 | 
Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158119
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 10418 |
Mciver A, Morgan C, Kaminski BL, Katoen JP. A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158121
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 1065 |
Chatterjee K, Osang GF. Pushdown reachability with constant treewidth. Information Processing Letters. 2017;122:25-29. doi:10.1016/j.ipl.2017.02.003
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Published | Journal Article | IST-REx-ID: 1066
Chatterjee K, Henzinger TA, Otop J, Velner Y. Quantitative fair simulation games. Information and Computation. 2017;254(2):143-166. doi:10.1016/j.ic.2016.10.006
View
| Files available
| DOI
| WoS
2017 | Published | Journal Article | IST-REx-ID: 1080 |
Reiter J, Makohon Moore A, Gerold J, et al. Reconstructing metastatic seeding patterns of human cancers. Nature Communications. 2017;8. doi:10.1038/ncomms14114
[Published Version]
View
| Files available
| DOI
| WoS
2017 | Published | Journal Article | IST-REx-ID: 464 |
Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017
[Published Version]
View
| Files available
| DOI
| arXiv
2017 | Published | Book Chapter | IST-REx-ID: 625 |
Chatterjee K, Doyen L, Henzinger TA. The cost of exactness in quantitative reachability. In: Aceto L, Bacci G, Ingólfsdóttir A, Legay A, Mardare R, eds. Models, Algorithms, Logics and Tools. Vol 10460. Theoretical Computer Science and General Issues. Springer; 2017:367-381. doi:10.1007/978-3-319-63121-9_18
[Submitted Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 6519 |
Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Improved set-based symbolic algorithms for parity games. In: Vol 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik; 2017. doi:10.4230/LIPICS.CSL.2017.18
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 645 |
Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. Value iteration for long run average reward in markov decision processes. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:201-221. doi:10.1007/978-3-319-63387-9_10
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Published | Conference Paper | IST-REx-ID: 628 |
Chatterjee K, Fu H, Murhekar A. Automated recurrence analysis for almost linear expected runtime bounds. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:118-139. doi:10.1007/978-3-319-63387-9_6
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Published | Conference Paper | IST-REx-ID: 639 |
Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst case analysis of recursive programs. In: Majumdar R, Kunčak V, eds. Vol 10427. Springer; 2017:41-63. doi:10.1007/978-3-319-63390-9_3
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 1009 |
Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. Optimizing expectation with guarantees in POMDPs. In: Proceedings of the 31st AAAI Conference on Artificial Intelligence. Vol 5. AAAI Press; 2017:3725-3732.
[Submitted Version]
View
| Download Submitted Version (ext.)
| WoS
2017 | Published | Conference Paper | IST-REx-ID: 1194 |
Chatterjee K, Novotný P, Zikelic D. Stochastic invariants for probabilistic termination. In: Vol 52. ACM; 2017:145-160. doi:10.1145/3009837.3009873
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
2016 | Published | Conference Paper | IST-REx-ID: 478 |
Chatterjee K, Ibsen-Jensen R. The complexity of deciding legality of a single step of magic: The gathering. In: Vol 285. IOS Press; 2016:1432-1439. doi:10.3233/978-1-61499-672-9-1432
[Published Version]
View
| Files available
| DOI
2016 | Published | Technical Report | IST-REx-ID: 5445 |
Chatterjee K, Pavlogiannis A, Velner Y. Quantitative Interprocedural Analysis. IST Austria; 2016. doi:10.15479/AT:IST-2016-523-v1-1
[Published Version]
View
| Files available
| DOI
2016 | Published | Technical Report | IST-REx-ID: 5449 |
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on Undirected Population Structures: Comets Beat Stars. IST Austria; 2016. doi:10.15479/AT:IST-2016-648-v1-1
[Updated Version]
View
| Files available
| DOI
2016 | Published | Technical Report | IST-REx-ID: 5451 |
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Strong Amplifiers of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2016-728-v1-1
[Published Version]
View
| Files available
| DOI
2016 | Published | Technical Report | IST-REx-ID: 5452 |
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2017-728-v2-1
[Published Version]
View
| Files available
| DOI
2016 | Published | Technical Report | IST-REx-ID: 5453 |
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2017-749-v3-1
[Published Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1245
Pandey V, Chatterjee K. Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In: Proceedings of the ACM Conference on Computer Supported Cooperative Work. Vol 26. ACM; 2016:365-368. doi:10.1145/2818052.2869122
View
| DOI