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 |
Veller, C., Hayward, L., Nowak, M., & Hilbe, C. (2017). The red queen and king in finite populations. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1702020114
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| PubMed | Europe PMC
2017 |
Published |
Conference Paper |
IST-REx-ID: 711 |
Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Bidirectional nested weighted automata (Vol. 85). Presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.5
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Journal Article |
IST-REx-ID: 716 |
Chatterjee, K., & Velner, Y. (2017). The complexity of mean-payoff pushdown games. Journal of the ACM. ACM. https://doi.org/10.1145/3121408
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 |
Published |
Journal Article |
IST-REx-ID: 717 |
Chatterjee, K., & Velner, Y. (2017). Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. Academic Press. https://doi.org/10.1016/j.jcss.2017.04.005
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 |
Published |
Journal Article |
IST-REx-ID: 719
Chatterjee, K., & Ehlers, R. (2017). Special issue: Synthesis and SYNT 2014. Acta Informatica. Springer. https://doi.org/10.1007/s00236-017-0299-0
View
| DOI
| WoS
2017 |
Published |
Journal Article |
IST-REx-ID: 466 |
Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation for Computational Logic. https://doi.org/10.23638/LMCS-13(2:15)2017
[Published Version]
View
| Files available
| DOI
| WoS
2017 |
Published |
Journal Article |
IST-REx-ID: 465 |
Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation for Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017
[Published Version]
View
| Files available
| DOI
| WoS
2017 |
Published |
Journal Article |
IST-REx-ID: 464 |
Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation for Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2017 |
Published |
Journal Article |
IST-REx-ID: 744 |
Priklopil, T., Chatterjee, K., & Nowak, M. (2017). Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2017.08.025
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2017 |
Published |
Journal Article |
IST-REx-ID: 467 |
Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic. ACM. https://doi.org/10.1145/3152769
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 |
Published |
Conference Paper |
IST-REx-ID: 949 |
Chatterjee, K., Goharshady, A. K., & Pavlogiannis, A. (2017). JTDec: A tool for tree decompositions in soot. In D. D’Souza (Ed.) (Vol. 10482, pp. 59–66). Presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India: Springer. https://doi.org/10.1007/978-3-319-68167-2_4
[Submitted Version]
View
| Files available
| DOI
| WoS
earlier version | 2017 |
Published |
Conference Paper |
IST-REx-ID: 639 |
Chatterjee, K., Fu, H., & Goharshady, A. K. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63390-9_3
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2016 |
Published |
Conference Paper |
IST-REx-ID: 1090 |
Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science, Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.24
[Published Version]
View
| Files available
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1093 |
Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2016). Linear distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2016.20
[Published Version]
View
| Files available
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1140 |
Chatterjee, K., Dvoák, W., Henzinger, M., & Loitzenbauer, V. (2016). Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 197–206). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2935304
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2016 |
Published |
Conference Paper |
IST-REx-ID: 1166 |
Chatterjee, K., Chmelik, M., & Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, United States: AAAI Press. https://doi.org/10.1609/aaai.v30i1.10422
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 |
Published |
Conference Paper |
IST-REx-ID: 1182 |
Chatterjee, K., Ibsen-Jensen, R., & Tkadlec, J. (2016). Robust draws in balanced knockout tournaments (Vol. 2016–January, pp. 172–179). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA: AAAI Press.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2016 |
Published |
Journal Article |
IST-REx-ID: 1200 |
Hilbe, C., & Traulsen, A. (2016). 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. Elsevier. https://doi.org/10.1016/j.plrev.2016.10.004
[Submitted Version]
View
| Files available
| DOI
| WoS
2016 |
Published |
Conference Paper |
IST-REx-ID: 1245
Pandey, V., & Chatterjee, K. (2016). Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In Proceedings of the ACM Conference on Computer Supported Cooperative Work (Vol. 26, pp. 365–368). San Francisco, CA, USA: ACM. https://doi.org/10.1145/2818052.2869122
View
| DOI
| WoS
2016 |
Published |
Journal Article |
IST-REx-ID: 1322 |
Hilbe, C., Hagel, K., & Milinski, M. (2016). Asymmetric power boosts extortion in an economic experiment. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0163867
[Published Version]
View
| Files available
| DOI
| WoS