Please note that IST 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.

330 Publications


2017 | Technical Report | IST-REx-ID: 5456   OA
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
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 551   OA
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
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 645   OA
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
View | DOI | Download (ext.)
 

2017 | Journal Article | IST-REx-ID: 671   OA
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
View | DOI | Download (ext.) | PubMed | Europe PMC
 

2017 | Conference Paper | IST-REx-ID: 950
Avni G, Henzinger TA, Chonev VK. Infinite-duration bidding games. In: Vol 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:17. doi:10.4230/LIPIcs.CONCUR.2017.21
View | Files available | DOI | arXiv
 

2017 | Journal Article | IST-REx-ID: 467   OA
Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 2017;18(4):31. doi:10.1145/3152769
View | Files available | DOI | Download (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 552   OA
Chatterjee K, Henzinger M, 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
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 639   OA
Chatterjee K, Fu H, Goharshady A. 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
View | DOI | Download (ext.)
 

2017 | 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
View | DOI
 

2017 | Journal Article | IST-REx-ID: 684   OA
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
View | DOI | Download (ext.)
 

2017 | Conference Paper | IST-REx-ID: 711   OA
Chatterjee K, Henzinger TA, Otop J. Bidirectional nested weighted automata. In: Vol 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.CONCUR.2017.5
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 716
Chatterjee K, Velner Y. The complexity of mean-payoff pushdown games. Journal of the ACM. 2017;64(5):34. doi:10.1145/3121408
View | DOI
 

2017 | Conference Paper | IST-REx-ID: 949   OA
Chatterjee K, Goharshady A, Pavlogiannis A. JTDec: A tool for tree decompositions in soot. In: D’Souza D, ed. Vol 10482. Springer; 2017:59-66. doi:10.1007/978-3-319-68167-2_4
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 464   OA
Chatterjee K, Henzinger M, 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
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 553   OA
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
View | Files available | DOI | Download (ext.)
 

2017 | Conference Paper | IST-REx-ID: 628   OA
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
View | DOI | Download (ext.)
 

2017 | Conference Paper | IST-REx-ID: 6519   OA
Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. Improved set-based symbolic algorithms for parity games. In: Vol 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik; 2017:18. doi:10.4230/LIPICS.CSL.2017.18
View | Files available | DOI
 

2017 | Research Data | IST-REx-ID: 5559
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Strong Amplifiers of Natural Selection. IST Austria; 2017. doi:10.15479/AT:ISTA:51
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 717
Chatterjee K, Velner Y. Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. 2017;88:236-259. doi:10.1016/j.jcss.2017.04.005
View | Files available | DOI | Download (ext.)
 

2016 | Journal Article | IST-REx-ID: 1200   OA
Hilbe C, Traulsen A. Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze. Physics of Life Reviews. 2016;19:29-31. doi:10.1016/j.plrev.2016.10.004
View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed