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.

332 Publications


2017 | Book Chapter | IST-REx-ID: 625   OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.” In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer, 2017. https://doi.org/10.1007/978-3-319-63121-9_18.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 1194   OA
Chatterjee, Krishnendu, Petr Novotny, and Djordje Zikelic. “Stochastic Invariants for Probabilistic Termination,” 52:145–60. ACM, 2017. https://doi.org/10.1145/3009837.3009873.
View | DOI | Download (ext.)
 

2017 | Journal Article | IST-REx-ID: 467
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL) 18, no. 4 (2017): 31. https://doi.org/10.1145/3152769.
View | Files available | DOI | Download (ext.) | arXiv
 

2017 | Technical Report | IST-REx-ID: 5456   OA
Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-872-v1-1.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 551   OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “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. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 645   OA
Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_10.
View | DOI | Download (ext.)
 

2017 | Journal Article | IST-REx-ID: 671   OA
Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak. “Memory-n Strategies of Direct Reciprocity.” PNAS 114, no. 18 (2017): 4715–20. https://doi.org/10.1073/pnas.1621239114.
View | DOI | Download (ext.) | PubMed | Europe PMC
 

2017 | Conference Paper | IST-REx-ID: 950   OA
Avni, Guy, Thomas A Henzinger, and Ventsislav K Chonev. “Infinite-Duration Bidding Games,” 85:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.CONCUR.2017.21.
View | Files available | DOI | arXiv
 

2017 | Conference Paper | IST-REx-ID: 552   OA
Chatterjee, Krishnendu, Monika Henzinger, and Alexander Svozil. “Faster Algorithms for Mean Payoff Parity Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 639   OA
Chatterjee, Krishnendu, Hongfei Fu, and Amir Goharshady. “Non-Polynomial Worst Case Analysis of Recursive Programs.” edited by Rupak Majumdar and Viktor Kunčak, 10427:41–63. Springer, 2017. https://doi.org/10.1007/978-3-319-63390-9_3.
View | DOI | Download (ext.)
 

2017 | Journal Article | IST-REx-ID: 684   OA
Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” Journal of Symbolic Logic 82, no. 2 (2017): 420–52. https://doi.org/10.1017/jsl.2016.71.
View | DOI | Download (ext.)
 

2017 | Conference Paper | IST-REx-ID: 711   OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Bidirectional Nested Weighted Automata,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.CONCUR.2017.5.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 949   OA
Chatterjee, Krishnendu, Amir Goharshady, and Andreas Pavlogiannis. “JTDec: A Tool for Tree Decompositions in Soot.” edited by Deepak D’Souza, 10482:59–66. Springer, 2017. https://doi.org/10.1007/978-3-319-68167-2_4.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 653   OA
Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Božić, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics 49, no. 3 (2017): 358–66. https://doi.org/10.1038/ng.3764.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 716   OA
Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.” Journal of the ACM 64, no. 5 (2017): 34. https://doi.org/10.1145/3121408.
View | DOI | Download (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 464   OA
Chatterjee, Krishnendu, Monika Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science 13, no. 3 (2017). https://doi.org/10.23638/LMCS-13(3:26)2017.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 553   OA
Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.
View | Files available | DOI | Download (ext.)
 

2017 | Research Data | IST-REx-ID: 5559
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak . Strong Amplifiers of Natural Selection. IST Austria, 2017. https://doi.org/10.15479/AT:ISTA:51.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 628   OA
Chatterjee, Krishnendu, Hongfei Fu, and Aniket Murhekar. “Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds.” edited by Rupak Majumdar and Viktor Kunčak, 10426:118–39. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_6.
View | DOI | Download (ext.)
 

2017 | Conference Paper | IST-REx-ID: 6519   OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” 82:18. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. https://doi.org/10.4230/LIPICS.CSL.2017.18.
View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed