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.
454 Publications
2017 |
Published |
Journal Article |
IST-REx-ID: 744 |
Priklopil T, Chatterjee K, Nowak M. Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. 2017;433:64-72. doi:10.1016/j.jtbi.2017.08.025
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2017 |
Published |
Journal Article |
IST-REx-ID: 1407 |
Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 2017;23(2):230-253. doi:10.1016/j.nahs.2016.04.006
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 |
Published |
Technical Report |
IST-REx-ID: 5455 |
Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria; 2017. doi:10.15479/AT:IST-2017-870-v1-1
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Technical Report |
IST-REx-ID: 5456 |
Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-Centric Dynamic Partial Order Reduction. IST Austria; 2017. doi:10.15479/AT:IST-2017-872-v1-1
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Conference Paper |
IST-REx-ID: 551 |
Chatterjee K, Ibsen-Jensen R, Nowak M. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.61
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Conference Paper |
IST-REx-ID: 552 |
Chatterjee K, Henzinger MH, Svozil A. Faster algorithms for mean-payoff parity games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.39
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Conference Paper |
IST-REx-ID: 553 |
Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent safety games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.55
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2017 |
Research Data |
IST-REx-ID: 5559 |
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Strong amplifiers of natural selection. 2017. doi:10.15479/AT:ISTA:51
[Published Version]
View
| Files available
| DOI
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: 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: 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: 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 |
Journal Article |
IST-REx-ID: 653 |
Makohon Moore A, Zhang M, Reiter J, et al. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 2017;49(3):358-366. doi:10.1038/ng.3764
[Submitted Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2017 |
Published |
Journal Article |
IST-REx-ID: 671 |
Hilbe C, Martinez V, Chatterjee K, Nowak M. Memory-n strategies of direct reciprocity. PNAS. 2017;114(18):4715-4720. doi:10.1073/pnas.1621239114
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
2017 |
Published |
Journal Article |
IST-REx-ID: 681 |
Chatterjee K, Doyen L, Filiot E, Raskin J. Doomsday equilibria for omega-regular games. Information and Computation. 2017;254:296-315. doi:10.1016/j.ic.2016.10.012
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2017 |
Published |
Journal Article |
IST-REx-ID: 684 |
Chatterjee K, Piterman N. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 2017;82(2):420-452. doi:10.1017/jsl.2016.71
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
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: 1011 |
Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. Faster algorithms for weighted recursive state machines. In: Yang H, ed. Vol 10201. Springer; 2017:287-313. doi:10.1007/978-3-662-54434-1_11
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 |
Published |
Journal Article |
IST-REx-ID: 10416 |
Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158118
[Published Version]
View
| Files available
| DOI
| arXiv