Pavlogiannis, Andreas, et al. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.”10.1038/s42003-018-0078-7__Communications Biology, vol. 1, no. 1, 71, Springer Nature, 2018, doi:10.1038/s42003-018-0078-7.
LibreCat: https://research-explorer.ista.ac.at/record/5751
DOI: 10.1038/s42003-018-0078-7
WoS: 000461126500071

Chatterjee, Krishnendu, et al. Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. Vol. 118, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.11.
LibreCat: https://research-explorer.ista.ac.at/record/66
DOI: 10.4230/LIPIcs.CONCUR.2018.11
arXiv: 1806.03108

Chatterjee, Krishnendu, et al. Quantitative Analysis of Smart Contracts. Vol. 10801, Springer, 2018, pp. 739–67, doi:10.1007/978-3-319-89884-1_26.
LibreCat: https://research-explorer.ista.ac.at/record/311
DOI: 10.1007/978-3-319-89884-1_26

Goharshady, Amir Kafshdar, et al. “Secure Credit Reporting on the Blockchain.”10.1109/Cybermatics_2018.2018.00231__Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–48, doi:10.1109/Cybermatics_2018.2018.00231.
LibreCat: https://research-explorer.ista.ac.at/record/6340
DOI: 10.1109/Cybermatics_2018.2018.00231
WoS: 000481634500196
arXiv: 1805.09104

Chatterjee, Krishnendu, et al. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.”10.1145/3210257__ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, 9, Association for Computing Machinery (ACM), 2018, doi:10.1145/3210257.
LibreCat: https://research-explorer.ista.ac.at/record/6009
DOI: 10.1145/3210257
WoS: 000444694800001
arXiv: 1510.07565

Chatterjee, Krishnendu, et al. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.”10.24963/ijcai.2018/653__Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018, IJCAI, 2018, pp. 4700–07, doi:10.24963/ijcai.2018/653.
LibreCat: https://research-explorer.ista.ac.at/record/5977
DOI: 10.24963/ijcai.2018/653
WoS: 000764175404118
arXiv: 1804.08984

Hilbe, Christian, et al. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.”10.1073/pnas.1810565115__PNAS, vol. 115, no. 48, National Academy of Sciences, 2018, pp. 12241–46, doi:10.1073/pnas.1810565115.
LibreCat: https://research-explorer.ista.ac.at/record/2
DOI: 10.1073/pnas.1810565115
WoS: 000451351000063
PMID: 30429320

Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.”10.1145/3158121__Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 33, Association for Computing Machinery, 2017, doi:10.1145/3158121.
LibreCat: https://research-explorer.ista.ac.at/record/10418
DOI: 10.1145/3158121
arXiv: 1711.03588

Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.”10.23638/LMCS-13(3:26)2017__Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.
LibreCat: https://research-explorer.ista.ac.at/record/464
DOI: 10.23638/LMCS-13(3:26)2017
arXiv: 1410.0833

Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.”10.23638/LMCS-13(2:15)2017__Logical Methods in Computer Science, vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(2:15)2017.
LibreCat: https://research-explorer.ista.ac.at/record/466
DOI: 10.23638/LMCS-13(2:15)2017

Chatterjee, Krishnendu, et al. “Nested Weighted Automata.”10.1145/3152769__ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.
LibreCat: https://research-explorer.ista.ac.at/record/467
DOI: 10.1145/3152769
arXiv: 1606.03598

Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.”10.23638/LMCS-13(3:23)2017__Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.
LibreCat: https://research-explorer.ista.ac.at/record/465
DOI: 10.23638/LMCS-13(3:23)2017

Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures: Comets Beat Stars.”10.1038/s41598-017-00107-w__Scientific Reports, vol. 7, no. 1, 82, Nature Publishing Group, 2017, doi:10.1038/s41598-017-00107-w.
LibreCat: https://research-explorer.ista.ac.at/record/512
DOI: 10.1038/s41598-017-00107-w

Chatterjee, Krishnendu, et al. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.”10.1145/3158118__Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 30, Association for Computing Machinery, 2017, doi:10.1145/3158118.
LibreCat: https://research-explorer.ista.ac.at/record/10416
DOI: 10.1145/3158118
arXiv: 1910.00241

Chatterjee, Krishnendu, et al. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017, doi:10.15479/AT:IST-2017-870-v1-1.
LibreCat: https://research-explorer.ista.ac.at/record/5455
DOI: 10.15479/AT:IST-2017-870-v1-1

Chalupa, Marek, et al. “Data-Centric Dynamic Partial Order Reduction.”10.1145/3158119__Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 31, Association for Computing Machinery, 2017, doi:10.1145/3158119.
LibreCat: https://research-explorer.ista.ac.at/record/10417
DOI: 10.1145/3158119
arXiv: 1610.01188

Chalupa, Marek, et al. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017, doi:10.15479/AT:IST-2017-872-v1-1.
LibreCat: https://research-explorer.ista.ac.at/record/5456
DOI: 10.15479/AT:IST-2017-872-v1-1

Chatterjee, Krishnendu, et al. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.”10.4230/LIPIcs.MFCS.2017.61__Leibniz International Proceedings in Informatics, vol. 83, 61, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.61.
LibreCat: https://research-explorer.ista.ac.at/record/551
DOI: 10.4230/LIPIcs.MFCS.2017.61

Chatterjee, Krishnendu, et al. “Faster Algorithms for Mean-Payoff Parity Games.”10.4230/LIPIcs.MFCS.2017.39__Leibniz International Proceedings in Informatics, vol. 83, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.39.
LibreCat: https://research-explorer.ista.ac.at/record/552
DOI: 10.4230/LIPIcs.MFCS.2017.39

Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.”10.4230/LIPIcs.MFCS.2017.55__Leibniz International Proceedings in Informatics, vol. 83, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.55.
LibreCat: https://research-explorer.ista.ac.at/record/553
DOI: 10.4230/LIPIcs.MFCS.2017.55

Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.”10.1007/978-3-319-63121-9_18__Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.
LibreCat: https://research-explorer.ista.ac.at/record/625
DOI: 10.1007/978-3-319-63121-9_18

Chatterjee, Krishnendu, et al. Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds. Edited by Rupak Majumdar and Viktor Kundak, vol. 10426, Springer, 2017, pp. 118–39, doi:10.1007/978-3-319-63387-9_6.
LibreCat: https://research-explorer.ista.ac.at/record/628
DOI: 10.1007/978-3-319-63387-9_6

Ashok, Pranav, et al. Value Iteration for Long Run Average Reward in Markov Decision Processes. Edited by Rupak Majumdar and Viktor Kundak, vol. 10426, Springer, 2017, pp. 201–21, doi:10.1007/978-3-319-63387-9_10.
LibreCat: https://research-explorer.ista.ac.at/record/645
DOI: 10.1007/978-3-319-63387-9_10

Chatterjee, Krishnendu, et al. Improved Set-Based Symbolic Algorithms for Parity Games. Vol. 82, 18, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017, doi:10.4230/LIPICS.CSL.2017.18.
LibreCat: https://research-explorer.ista.ac.at/record/6519
DOI: 10.4230/LIPICS.CSL.2017.18

Makohon Moore, Alvin, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.”10.1038/ng.3764__Nature Genetics, vol. 49, no. 3, Nature Publishing Group, 2017, pp. 358–66, doi:10.1038/ng.3764.
LibreCat: https://research-explorer.ista.ac.at/record/653
DOI: 10.1038/ng.3764
PMID: 28092682

Hilbe, Christian, et al. “Memory-n Strategies of Direct Reciprocity.”10.1073/pnas.1621239114__PNAS, vol. 114, no. 18, National Academy of Sciences, 2017, pp. 4715–20, doi:10.1073/pnas.1621239114.
LibreCat: https://research-explorer.ista.ac.at/record/671
DOI: 10.1073/pnas.1621239114
PMID: 28420786

Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.”10.1016/j.ic.2016.10.012__Information and Computation, vol. 254, Elsevier, 2017, pp. 296–315, doi:10.1016/j.ic.2016.10.012.
LibreCat: https://research-explorer.ista.ac.at/record/681
DOI: 10.1016/j.ic.2016.10.012
arXiv: 1311.3238

Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.”10.1017/jsl.2016.71__Journal of Symbolic Logic, vol. 82, no. 2, Cambridge University Press, 2017, pp. 420–52, doi:10.1017/jsl.2016.71.
LibreCat: https://research-explorer.ista.ac.at/record/684
DOI: 10.1017/jsl.2016.71

Veller, Carl, et al. “The Red Queen and King in Finite Populations.”10.1073/pnas.1702020114__PNAS, vol. 114, no. 27, National Academy of Sciences, 2017, pp. 96–405, doi:10.1073/pnas.1702020114.
LibreCat: https://research-explorer.ista.ac.at/record/699
DOI: 10.1073/pnas.1702020114
PMID: 28630336

Chatterjee, Krishnendu, et al. Bidirectional Nested Weighted Automata. Vol. 85, 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.5.
LibreCat: https://research-explorer.ista.ac.at/record/711
DOI: 10.4230/LIPIcs.CONCUR.2017.5

Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.”10.1145/3121408__Journal of the ACM, vol. 64, no. 5, ACM, 2017, p. 34, doi:10.1145/3121408.
LibreCat: https://research-explorer.ista.ac.at/record/716
DOI: 10.1145/3121408
arXiv: 1201.2829

Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.”10.1016/j.jcss.2017.04.005__Journal of Computer and System Sciences, vol. 88, Academic Press, 2017, pp. 236–59, doi:10.1016/j.jcss.2017.04.005.
LibreCat: https://research-explorer.ista.ac.at/record/717
DOI: 10.1016/j.jcss.2017.04.005

Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and SYNT 2014.”10.1007/s00236-017-0299-0__Acta Informatica, vol. 54, no. 6, Springer, 2017, pp. 543–44, doi:10.1007/s00236-017-0299-0.
LibreCat: https://research-explorer.ista.ac.at/record/719
DOI: 10.1007/s00236-017-0299-0

Kretinsky, Jan, et al. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.”10.1007/978-3-662-54577-5_26__Tools and Algorithms for the Construction and Analysis of Systems, vol. 10205, Springer, 2017, pp. 443–60, doi:10.1007/978-3-662-54577-5_26.
LibreCat: https://research-explorer.ista.ac.at/record/13160
DOI: 10.1007/978-3-662-54577-5_26
arXiv: 1701.05738

Avni, Guy, et al. Infinite-Duration Bidding Games. Vol. 85, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.21.
LibreCat: https://research-explorer.ista.ac.at/record/950
DOI: 10.4230/LIPIcs.CONCUR.2017.21
arXiv: 1705.01433

Pavlogiannis, Andreas. Algorithmic Advances in Program Analysis and Their Applications. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_854.
LibreCat: https://research-explorer.ista.ac.at/record/821
DOI: 10.15479/AT:ISTA:th_854

Svoreová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.”10.1016/j.nahs.2016.04.006__Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, Elsevier, 2017, pp. 230–53, doi:10.1016/j.nahs.2016.04.006.
LibreCat: https://research-explorer.ista.ac.at/record/1407
DOI: 10.1016/j.nahs.2016.04.006
WoS: 000390637000014
arXiv: 1410.5387

Brázdil, Tomás, et al. “Trading Performance for Stability in Markov Decision Processes.”10.1016/j.jcss.2016.09.009__Journal of Computer and System Sciences, vol. 84, Elsevier, 2017, pp. 144–70, doi:10.1016/j.jcss.2016.09.009.
LibreCat: https://research-explorer.ista.ac.at/record/1294
DOI: 10.1016/j.jcss.2016.09.009
WoS: 000388430000011

Reiter, Johannes, et al. “Reconstructing Metastatic Seeding Patterns of Human Cancers.”10.1038/ncomms14114__Nature Communications, vol. 8, 14114, Nature Publishing Group, 2017, doi:10.1038/ncomms14114.
LibreCat: https://research-explorer.ista.ac.at/record/1080
DOI: 10.1038/ncomms14114
WoS: 000393096600001

Chatterjee, Krishnendu, and Georg F. Osang. “Pushdown Reachability with Constant Treewidth.”10.1016/j.ipl.2017.02.003__Information Processing Letters, vol. 122, Elsevier, 2017, pp. 25–29, doi:10.1016/j.ipl.2017.02.003.
LibreCat: https://research-explorer.ista.ac.at/record/1065
DOI: 10.1016/j.ipl.2017.02.003
WoS: 000399506600005

Chatterjee, Krishnendu, et al. “Quantitative Fair Simulation Games.”10.1016/j.ic.2016.10.006__Information and Computation, vol. 254, no. 2, Elsevier, 2017, pp. 143–66, doi:10.1016/j.ic.2016.10.006.
LibreCat: https://research-explorer.ista.ac.at/record/1066
DOI: 10.1016/j.ic.2016.10.006
WoS: 000402025600002

Chatterjee, Krishnendu, et al. Faster Algorithms for Weighted Recursive State Machines. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313, doi:10.1007/978-3-662-54434-1_11.
LibreCat: https://research-explorer.ista.ac.at/record/1011
DOI: 10.1007/978-3-662-54434-1_11
WoS: 000681702400011

Chatterjee, Krishnendu, et al. “Optimizing Expectation with Guarantees in POMDPs.” Proceedings of the 31st AAAI Conference on Artificial Intelligence, vol. 5, AAAI Press, 2017, pp. 3725–32.
LibreCat: https://research-explorer.ista.ac.at/record/1009
WoS: 000485630703107

Priklopil, Tadeas, et al. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.”10.1016/j.jtbi.2017.08.025__10.1016/j.jtbi.2017.08.025__Journal of Theoretical Biology, vol. 433, Elsevier, 2017, pp. 64–72, doi:10.1016/j.jtbi.2017.08.025.
LibreCat: https://research-explorer.ista.ac.at/record/744
DOI: 10.1016/j.jtbi.2017.08.025
WoS: 000412039800007
PMID: 28867224

Chatterjee, Krishnendu, et al. Stochastic Invariants for Probabilistic Termination. Vol. 52, no. 1, ACM, 2017, pp. 145–60, doi:10.1145/3009837.3009873.
LibreCat: https://research-explorer.ista.ac.at/record/1194
DOI: 10.1145/3009837.3009873
WoS: 000408311200013

Pavlogiannis, Andreas, et al. Strong Amplifiers of Natural Selection. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:51.
LibreCat: https://research-explorer.ista.ac.at/record/5559
DOI: 10.15479/AT:ISTA:51

Chatterjee, Krishnendu, et al. Non-Polynomial Worst Case Analysis of Recursive Programs. Edited by Rupak Majumdar and Viktor Kundak, vol. 10427, Springer, 2017, pp. 41–63, doi:10.1007/978-3-319-63390-9_3.
LibreCat: https://research-explorer.ista.ac.at/record/639
DOI: 10.1007/978-3-319-63390-9_3
arXiv: 1705.00317

Chatterjee, Krishnendu, et al. JTDec: A Tool for Tree Decompositions in Soot. Edited by Deepak D’Souza, vol. 10482, Springer, 2017, pp. 59–66, doi:10.1007/978-3-319-68167-2_4.
LibreCat: https://research-explorer.ista.ac.at/record/949
DOI: 10.1007/978-3-319-68167-2_4
WoS: 000723567800004

Chatterjee, Krishnendu, et al. Conditionally Optimal Algorithms for Generalized Büchi Games. Vol. 58, 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.MFCS.2016.25.
LibreCat: https://research-explorer.ista.ac.at/record/1068
DOI: 10.4230/LIPIcs.MFCS.2016.25

Chonev, Ventsislav K., et al. On the Skolem Problem for Continuous Linear Dynamical Systems. Vol. 55, 100, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:10.4230/LIPIcs.ICALP.2016.100.
LibreCat: https://research-explorer.ista.ac.at/record/1069
DOI: 10.4230/LIPIcs.ICALP.2016.100