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
The cost of exactness in quantitative reachability
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 1194   OA
Stochastic invariants for probabilistic termination
K. Chatterjee, P. Novotny, D. Zikelic, in:, ACM, 2017, pp. 145–160.
View | DOI | Download (ext.)
 

2017 | Journal Article | IST-REx-ID: 467
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017) 31.
View | Files available | DOI | Download (ext.) | arXiv
 

2017 | Technical Report | IST-REx-ID: 5456   OA
Data-centric dynamic partial order reduction
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 551   OA
Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 645   OA
Value iteration for long run average reward in markov decision processes
P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221.
View | DOI | Download (ext.)
 

2017 | Journal Article | IST-REx-ID: 671   OA
Memory-n strategies of direct reciprocity
C. Hilbe, V. Martinez, K. Chatterjee, M. Nowak, PNAS 114 (2017) 4715–4720.
View | DOI | Download (ext.) | PubMed | Europe PMC
 

2017 | Conference Paper | IST-REx-ID: 950   OA
Infinite-duration bidding games
G. Avni, T.A. Henzinger, V.K. Chonev, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 17.
View | Files available | DOI | arXiv
 

2017 | Conference Paper | IST-REx-ID: 552   OA
Faster algorithms for mean payoff parity games
K. Chatterjee, M. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 639   OA
Non-polynomial worst case analysis of recursive programs
K. Chatterjee, H. Fu, A. Goharshady, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 41–63.
View | DOI | Download (ext.)
 

2017 | Journal Article | IST-REx-ID: 684   OA
Obligation blackwell games and p-automata
K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452.
View | DOI | Download (ext.)
 

2017 | Conference Paper | IST-REx-ID: 711   OA
Bidirectional nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 949   OA
JTDec: A tool for tree decompositions in soot
K. Chatterjee, A. Goharshady, A. Pavlogiannis, in:, D. D’Souza (Ed.), Springer, 2017, pp. 59–66.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 653   OA
Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer
A. Makohon Moore, M. Zhang, J. Reiter, I. Božić, B. Allen, D. Kundu, K. Chatterjee, F. Wong, Y. Jiao, Z. Kohutek, J. Hong, M. Attiyeh, B. Javier, L. Wood, R. Hruban, M. Nowak, N. Papadopoulos, K. Kinzler, B. Vogelstein, C. Iacobuzio Donahue, Nature Genetics 49 (2017) 358–366.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 716   OA
The complexity of mean-payoff pushdown games
K. Chatterjee, Y. Velner, Journal of the ACM 64 (2017) 34.
View | DOI | Download (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 464   OA
Improved algorithms for parity and Streett objectives
K. Chatterjee, M. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 553   OA
Strategy complexity of concurrent safety games
K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI | Download (ext.)
 

2017 | Research Data | IST-REx-ID: 5559
Strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak , Strong Amplifiers of Natural Selection, IST Austria, 2017.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 628   OA
Automated recurrence analysis for almost linear expected runtime bounds
K. Chatterjee, H. Fu, A. Murhekar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 118–139.
View | DOI | Download (ext.)
 

2017 | Conference Paper | IST-REx-ID: 6519   OA
Improved set-based symbolic algorithms for parity games
K. Chatterjee, W. Dvorák, M. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017, p. 18.
View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Export / Embed