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.




534 Publications

2017 | Published | Journal Article | IST-REx-ID: 699 | OA
The red queen and king in finite populations
C. Veller, L. Hayward, M. Nowak, C. Hilbe, PNAS 114 (2017) E5396–E5405.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | PubMed | Europe PMC
 
2017 | Published | 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.
[Published Version] View | Files available | DOI
 
2017 | Published | 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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 717 | OA
Hyperplane separation technique for multidimensional mean-payoff games
K. Chatterjee, Y. Velner, Journal of Computer and System Sciences 88 (2017) 236–259.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 719
Special issue: Synthesis and SYNT 2014
K. Chatterjee, R. Ehlers, Acta Informatica 54 (2017) 543–544.
View | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 466 | OA
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 465 | OA
Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | 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).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 744 | OA
Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma
T. Priklopil, K. Chatterjee, M. Nowak, Journal of Theoretical Biology 433 (2017) 64–72.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
2017 | Published | Journal Article | IST-REx-ID: 467 | OA
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic 18 (2017).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 949 | OA
JTDec: A tool for tree decompositions in soot
K. Chatterjee, A.K. Goharshady, A. Pavlogiannis, in:, D. D’Souza (Ed.), Springer, 2017, pp. 59–66.
[Submitted Version] View | Files available | DOI | WoS
 
earlier version | 2017 | Published | Conference Paper | IST-REx-ID: 639 | OA
Non-polynomial worst case analysis of recursive programs
K. Chatterjee, H. Fu, A.K. Goharshady, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 41–63.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2016 | Published | Conference Paper | IST-REx-ID: 1090 | OA
Nested weighted limit-average automata of bounded width
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
[Published Version] View | Files available | DOI
 
2016 | Published | Conference Paper | IST-REx-ID: 1093 | OA
Linear distances between Markov chains
P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
[Published Version] View | Files available | DOI
 
2016 | Published | Conference Paper | IST-REx-ID: 1140 | OA
Model and objective separation with conditional lower bounds: disjunction is harder than conjunction
K. Chatterjee, W. Dvoák, M. Henzinger, V. Loitzenbauer, in:, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2016 | Published | Conference Paper | IST-REx-ID: 1166 | OA
A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs
K. Chatterjee, M. Chmelik, J. Davies, in:, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI Press, 2016, pp. 3225–3232.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2016 | Published | Conference Paper | IST-REx-ID: 1182 | OA
Robust draws in balanced knockout tournaments
K. Chatterjee, R. Ibsen-Jensen, J. Tkadlec, in:, AAAI Press, 2016, pp. 172–179.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
 
2016 | Published | Conference Paper | IST-REx-ID: 1245
Game-theoretic models identify useful principles for peer collaboration in online learning platforms
V. Pandey, K. Chatterjee, in:, Proceedings of the ACM Conference on Computer Supported Cooperative Work, ACM, 2016, pp. 365–368.
View | DOI | WoS
 
2016 | Published | Journal Article | IST-REx-ID: 1322 | OA
Asymmetric power boosts extortion in an economic experiment
C. Hilbe, K. Hagel, M. Milinski, PLoS One 11 (2016).
[Published Version] View | Files available | DOI | WoS
 

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed