Schmid, Stefan, et al. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.”10.1016/j.tcs.2023.114353__Theoretical Computer Science, vol. 989, 114353, Elsevier, 2024, doi:10.1016/j.tcs.2023.114353.

Hirvonen, Juho, et al. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.”10.4230/LIPIcs.OPODIS.2023.11__27th International Conference on Principles of Distributed Systems, vol. 286, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.OPODIS.2023.11.

Hübner, Valentin, et al. “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.”10.1073/pnas.2315558121__Proceedings of the National Academy of Sciences, vol. 121, no. 10, e2315558121, Proceedings of the National Academy of Sciences, 2024, doi:10.1073/pnas.2315558121.

Svoboda, Jakub, et al. “Amplifiers of Selection for the Moran Process with Both Birth-Death and Death-Birth Updating.”10.1371/journal.pcbi.1012008__PLoS Computational Biology, vol. 20, no. 3, e1012008, Public Library of Science, 2024, doi:10.1371/journal.pcbi.1012008.

Chatterjee, Krishnendu, et al. “Faster Algorithm for Turn-Based Stochastic Games with Bounded Treewidth.”10.1137/1.9781611977554.ch173__Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 4590–605, doi:10.1137/1.9781611977554.ch173.

Chatterjee, Krishnendu, et al. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.”10.1007/978-3-031-30823-9_1__Tools and Algorithms for the Construction and Analysis of Systems , vol. 13993, Springer Nature, 2023, pp. 3–25, doi:10.1007/978-3-031-30823-9_1.

Svoboda, Jakub, et al. “Coexistence Times in the Moran Process with Environmental Heterogeneity.”10.1098/rspa.2022.0685__Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 479, no. 2271, 20220685, The Royal Society, 2023, doi:10.1098/rspa.2022.0685.

Schmid, Laura, et al. “Quantitative Assessment Can Stabilize Indirect Reciprocity under Imperfect Information.”10.1038/s41467-023-37817-x__Nature Communications, vol. 14, 2086, Springer Nature, 2023, doi:10.1038/s41467-023-37817-x.

Lechner, Mathias, et al. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.”10.1609/aaai.v37i12.26747__Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 12, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–73, doi:10.1609/aaai.v37i12.26747.

Avni, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.”10.1609/aaai.v37i5.25679__Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 5, 2023, pp. 5464–71, doi:10.1609/aaai.v37i5.25679.

Kretinsky, Jan, et al. “Guessing Winning Policies in LTL Synthesis by Semantic Learning.”10.1007/978-3-031-37706-8_20__35th International Conference on Computer Aided Verification , vol. 13964, Springer Nature, 2023, pp. 390–414, doi:10.1007/978-3-031-37706-8_20.

Sun, Yican, et al. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.”10.1007/978-3-031-37709-9_2__Computer Aided Verification, vol. 13966, Springer Nature, 2023, pp. 16–39, doi:10.1007/978-3-031-37709-9_2.

Akshay, S., et al. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.”10.1007/978-3-031-37709-9_5__International Conference on Computer Aided Verification, vol. 13966, Springer Nature, 2023, pp. 86–112, doi:10.1007/978-3-031-37709-9_5.

Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Objectives.”10.1007/s10703-023-00411-4__Formal Methods in System Design, Springer Nature, 2023, doi:10.1007/s10703-023-00411-4.

Graham, Thomas, et al. “Where Do Mistakes Lead? A Survey of Games with Incompetent Players.”10.1007/s13235-022-00425-3__Dynamic Games and Applications, vol. 13, Springer Nature, 2023, pp. 231–64, doi:10.1007/s13235-022-00425-3.

Baier, Christel, et al. “Entropic Risk for Turn-Based Stochastic Games.”10.4230/LIPIcs.MFCS.2023.15__48th International Symposium on Mathematical Foundations of Computer Science, vol. 272, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.MFCS.2023.15.

Mckerral, Jody C., et al. “Empirical Parameterisation and Dynamical Analysis of the Allometric Rosenzweig-MacArthur Equations.”10.1371/journal.pone.0279838__PLoS One, vol. 18, no. 2, Public Library of Science, 2023, p. e0279838, doi:10.1371/journal.pone.0279838.

Avni, Guy, et al. “Reachability Poorman Discrete-Bidding Games.”10.3233/FAIA230264__Frontiers in Artificial Intelligence and Applications, vol. 372, IOS Press, 2023, pp. 141–48, doi:10.3233/FAIA230264.

Ansaripour, Matin, et al. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.”10.1007/978-3-031-45329-8_17__21st International Symposium on Automated Technology for Verification and Analysis, vol. 14215, Springer Nature, 2023, pp. 357–79, doi:10.1007/978-3-031-45329-8_17.

Schmid, Stefan, et al. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.”10.1007/978-3-031-32733-9_26__SIROCCO 2023: Structural Information and Communication Complexity , vol. 13892, Springer Nature, 2023, pp. 576–94, doi:10.1007/978-3-031-32733-9_26.

Tkadlec, Josef, et al. “Evolutionary Dynamics of Mutants That Modify Population Structure.”10.1098/rsif.2023.0355__Journal of the Royal Society, Interface, vol. 20, no. 208, 20230355, The Royal Society, 2023, doi:10.1098/rsif.2023.0355.

Kleshnina, Maria, et al. “The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games.”10.1038/s41467-023-39625-9__Nature Communications, vol. 14, 4153, Springer Nature, 2023, doi:10.1038/s41467-023-39625-9.

Kretinsky, Jan, et al. “Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives.”10.1109/LICS56636.2023.10175771__38th Annual ACM/IEEE Symposium on Logic in Computer Science, vol. 2023, Institute of Electrical and Electronics Engineers, 2023, doi:10.1109/LICS56636.2023.10175771.

Biniaz, Ahmad, et al. “Token Swapping on Trees.”10.46298/DMTCS.8383__Discrete Mathematics and Theoretical Computer Science, vol. 24, no. 2, 9, EPI Sciences, 2023, doi:10.46298/DMTCS.8383.

Bastankhah, Mahsa, et al. “: Boosting Liquidity in Payment Channel Networks with Online Admission Control.”10.1007/978-3-031-47754-6_18__27th International Conference on Financial Cryptography and Data Security, vol. 13950, Springer Nature, 2023, pp. 309–25, doi:10.1007/978-3-031-47754-6_18.

Zikelic, Dorde. Automated Verification and Control of Infinite State Stochastic Systems. Institute of Science and Technology Austria, 2023, doi:10.15479/14539.

Kisan, Jan Matyás, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration under Token Sliding.”10.1007/978-3-031-43587-4_24__24th International Symposium on Fundamentals of Computation Theory, vol. 14292, Springer Nature, 2023, pp. 333–47, doi:10.1007/978-3-031-43587-4_24.

Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.”10.1609/aaai.v37i10.26407__Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 10, Association for the Advancement of Artificial Intelligence, 2023, pp. 11926–35, doi:10.1609/aaai.v37i10.26407.

Meggendorfer, Tobias. “Correct Approximation of Stationary Distributions.”10.1007/978-3-031-30823-9_25__TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, vol. 13993, Springer Nature, 2023, pp. 489–507, doi:10.1007/978-3-031-30823-9_25.

Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” 37th Conference on Neural Information Processing Systems, 2023.

Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.”10.1145/3585391__Formal Aspects of Computing, vol. 35, no. 2, 11, Association for Computing Machinery, 2023, doi:10.1145/3585391.

Ahmadi, Ali, et al. “Algorithms and Hardness Results for Computing Cores of Markov Chains.”10.4230/LIPIcs.FSTTCS.2022.29__42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.29.

Chatterjee, Krishnendu, et al. “Complexity of Spatial Games.”10.4230/LIPIcs.FSTTCS.2022.11__42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 11:1-11:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.11.

Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.”10.1609/aaai.v36i9.21222__Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, vol. 36, no. 9, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–67, doi:10.1609/aaai.v36i9.21222.

Aichholzer, Oswin, et al. “On Compatible Matchings.”10.7155/jgaa.00591__Journal of Graph Algorithms and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591.

Chatterjee, Krishnendu, et al. “Repeated Prophet Inequality with Near-Optimal Bounds.”10.48550/ARXIV.2209.14368__ArXiv, 2209.14368, doi:10.48550/ARXIV.2209.14368.

Kretinsky, Jan, et al. “Index Appearance Record with Preorders.”10.1007/s00236-021-00412-y__Acta Informatica, vol. 59, Springer Nature, 2022, pp. 585–618, doi:10.1007/s00236-021-00412-y.

Svoboda, Jakub, et al. “Infection Dynamics of COVID-19 Virus under Lockdown and Reopening.”10.1038/s41598-022-05333-5__Scientific Reports, vol. 12, no. 1, 1526, Springer Nature, 2022, doi:10.1038/s41598-022-05333-5.

Zikelic, Dorde, et al. “Differential Cost Analysis with Simultaneous Potentials and Anti-Potentials.”10.1145/3519939.3523435__Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2022, pp. 442–57, doi:10.1145/3519939.3523435.

Chatterjee, Krishnendu, et al. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.”10.1103/physreve.106.034321__Physical Review E, vol. 106, no. 3, 034321, American Physical Society, 2022, doi:10.1103/physreve.106.034321.

Schmid, Laura, et al. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.”10.1371/journal.pcbi.1010149__PLOS Computational Biology, vol. 18, no. 6, e1010149, Public Library of Science, 2022, doi:10.1371/journal.pcbi.1010149.

Chatterjee, Krishnendu, et al. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.”10.1287/moor.2020.1116__Mathematics of Operations Research, vol. 47, no. 1, Institute for Operations Research and the Management Sciences, 2022, pp. 100–19, doi:10.1287/moor.2020.1116.

Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.”10.1007/978-3-031-19992-9_20__20th International Symposium on Automated Technology for Verification and Analysis, vol. 13505, Springer Nature, 2022, pp. 320–26, doi:10.1007/978-3-031-19992-9_20.

Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.”10.1016/j.jcss.2022.04.003__Journal of Computer and System Sciences, vol. 129, Elsevier, 2022, pp. 1–21, doi:10.1016/j.jcss.2022.04.003.

Grover, Kush, et al. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.”10.4230/LIPIcs.CONCUR.2022.11__33rd International Conference on Concurrency Theory , vol. 243, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.CONCUR.2022.11.

Chatterjee, Krishnendu, et al. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.”10.1007/978-3-031-13185-1_4__Proceedings of the 34th International Conference on Computer Aided Verification, vol. 13371, Springer, 2022, pp. 55–78, doi:10.1007/978-3-031-13185-1_4.

Lechner, Mathias, et al. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.”10.1609/aaai.v36i7.20695__Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7, Association for the Advancement of Artificial Intelligence, 2022, pp. 7326–36, doi:10.1609/aaai.v36i7.20695.

Zikelic, Dorde, et al. “Learning Stabilizing Policies in Stochastic Control Systems.”10.48550/arXiv.2205.11991__ArXiv, doi:10.48550/arXiv.2205.11991.

Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.”10.48550/ARXIV.2210.05308__ArXiv, doi:10.48550/ARXIV.2210.05308.

Jecker, Ismael R., et al. “Decomposing Permutation Automata.”10.4230/LIPIcs.CONCUR.2021.18__32nd International Conference on Concurrency Theory, vol. 203, 18, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.CONCUR.2021.18.

Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.”10.4230/LIPIcs.ICALP.2021.124__48th International Colloquium on Automata, Languages, and Programming, vol. 198, 124, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.ICALP.2021.124.

Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.”10.4230/LIPIcs.MFCS.2021.53__46th International Symposium on Mathematical Foundations of Computer Science, vol. 202, 53, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.MFCS.2021.53.

Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.”10.4230/LIPIcs.FSTTCS.2021.34__41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 34, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.34.

Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.”10.4230/LIPIcs.FSTTCS.2021.42__41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.42.

Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.”10.1137/1.9781611976465.38__Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:10.1137/1.9781611976465.38.

Tomásek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.”10.24963/ijcai.2021/575__30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:10.24963/ijcai.2021/575.

Aichholzer, Oswin, et al. “On Compatible Matchings.”10.1007/978-3-030-68211-8_18__15th International Conference on Algorithms and Computation, vol. 12635, Springer Nature, 2021, pp. 221–33, doi:10.1007/978-3-030-68211-8_18.

Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” Deliberate Ignorance: Choosing Not To Know, edited by Ralph Hertwig and Christoph Engel, vol. 29, MIT Press, 2021, pp. 139–52.

Bansal, Suguman, et al. “On Satisficing in Quantitative Games.”10.1007/978-3-030-72016-2__27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12651, Springer Nature, 2021, pp. 20–37, doi:10.1007/978-3-030-72016-2.

Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.”10.48550/arXiv.2111.03165__35th Conference on Neural Information Processing Systems, 2021, doi:10.48550/arXiv.2111.03165.

Zeiner, Martin, et al. “Optimal Strategies for Selecting Coordinators.”10.1016/j.dam.2020.10.022__Discrete Applied Mathematics, vol. 289, no. 1, Elsevier, 2021, pp. 392–415, doi:10.1016/j.dam.2020.10.022.

Kleshnina, Maria, et al. “Mistakes Can Stabilise the Dynamics of Rock-Paper-Scissors Games.”10.1371/journal.pcbi.1008523__PLoS Computational Biology, vol. 17, no. 4, e1008523, Public Library of Science, 2021, doi:10.1371/journal.pcbi.1008523.

Tkadlec, Josef, et al. “Fast and Strong Amplifiers of Natural Selection.”10.1038/s41467-021-24271-w__Nature Communications, vol. 12, no. 1, 4009, Springer Nature, 2021, doi:10.1038/s41467-021-24271-w.

Wang, Jinyi, et al. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.”10.1145/3453483.3454102__Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1171–86, doi:10.1145/3453483.3454102.

Asadi, Ali, et al. “Polynomial Reachability Witnesses via Stellensätze.”10.1145/3453483.3454076__Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 772–87, doi:10.1145/3453483.3454076.

Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.”10.1109/LICS52264.2021.9470739__Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470739.

Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.”10.1109/LICS52264.2021.9470595__Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470595.

Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.”10.4230/LIPIcs.STACS.2021.44__38th International Symposium on Theoretical Aspects of Computer Science, vol. 187, 44, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.STACS.2021.44.

Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.”10.1007/978-3-030-81685-8_16__33rd International Conference on Computer-Aided Verification , vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16.

Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.”10.1145/3485541__Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:10.1145/3485541.

Toman, Viktor. Improved Verification Techniques for Concurrent Systems. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10199.

Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.”10.1016/j.artint.2021.103499__Artificial Intelligence, vol. 297, no. 8, 103499, Elsevier, 2021, doi:10.1016/j.artint.2021.103499.

Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.”10.1007/s10703-021-00373-5__Formal Methods in System Design, vol. 57, Springer, 2021, pp. 401–28, doi:10.1007/s10703-021-00373-5.

Chatterjee, Krishnendu, et al. “Proving Non-Termination by Program Reversal.”10.1145/3453483.3454093__Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1033–48, doi:10.1145/3453483.3454093.

Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.”10.1007/978-3-030-90870-6_33__24th International Symposium on Formal Methods, vol. 13047, Springer Nature, 2021, pp. 619–39, doi:10.1007/978-3-030-90870-6_33.

Goharshady, Amir Kafshdar. Parameterized and Algebro-Geometric Advances in Static Program Analysis. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:8934.

Schmid, Laura. Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10293.

Schmid, Laura, et al. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.”10.1038/s41598-021-96932-1__Scientific Reports, vol. 11, no. 1, 17443, Springer Nature, 2021, doi:10.1038/s41598-021-96932-1.

Schmid, Laura, et al. “A Unified Framework of Direct and Indirect Reciprocity.”10.1038/s41562-021-01114-8__Nature Human Behaviour, vol. 5, no. 10, Springer Nature, 2021, pp. 1292–1302, doi:10.1038/s41562-021-01114-8.

Schmid, Laura, et al. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.”10.4230/LIPIcs.OPODIS.2019.21__Proceedings of the 23rd International Conference on Principles of Distributed Systems, vol. 153, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2019.21.

Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.”10.4230/LIPIcs.CONCUR.2020.23__31st International Conference on Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.23.

Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.”10.4230/LIPIcs.MFCS.2020.22__45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.22.

Jecker, Ismael R., et al. “Unary Prime Languages.”10.4230/LIPIcs.MFCS.2020.51__45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.51.

Ashok, Pranav, et al. “Approximating Values of Generalized-Reachability Stochastic Games.”10.1145/3373718.3394761__Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , Association for Computing Machinery, 2020, pp. 102–15, doi:10.1145/3373718.3394761.

Kaveh, Kamran, et al. “The Moran Process on 2-Chromatic Graphs.”10.1371/journal.pcbi.1008402__PLOS Computational Biology, vol. 16, no. 11, e1008402, Public Library of Science, 2020, doi:10.1371/journal.pcbi.1008402.

Kleshnina, Maria, et al. “Prioritised Learning in Snowdrift-Type Games.”10.3390/math8111945__Mathematics, vol. 8, no. 11, 1945, MDPI, 2020, doi:10.3390/math8111945.

Pavlogiannis, Andreas, et al. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.”10.1109/TCAD.2020.3012803__IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11, IEEE, 2020, pp. 3981–92, doi:10.1109/TCAD.2020.3012803.

Avni, Guy, et al. “All-Pay Bidding Games on Graphs.”10.1609/aaai.v34i02.5546__Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546.

Milutinovic, Barbara, et al. “Social Immunity Modulates Competition between Coinfecting Pathogens.”10.1111/ele.13458__Ecology Letters, vol. 23, no. 3, Wiley, 2020, pp. 565–74, doi:10.1111/ele.13458.

Chatterjee, Krishnendu, et al. “Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.” Proceedings of the 30th International Conference on Automated Planning and Scheduling, vol. 30, Association for the Advancement of Artificial Intelligence, 2020, pp. 48–56.

Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Reachability-Safety Objectives.”10.1007/978-3-030-53291-8_21__International Conference on Computer Aided Verification, vol. 12225, Springer Nature, 2020, pp. 398–420, doi:10.1007/978-3-030-53291-8_21.

Shakiba, A., et al. “A Note on Belief Structures and S-Approximation Spaces.”10.29252/ijmsi.15.2.117__Iranian Journal of Mathematical Sciences and Informatics, vol. 15, no. 2, Iranian Academic Center for Education, Culture and Research, 2020, pp. 117–28, doi:10.29252/ijmsi.15.2.117.

Tkadlec, Josef, et al. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.”10.1371/journal.pcbi.1007494__PLoS Computational Biology, vol. 16, e1007494, Public Library of Science, 2020, doi:10.1371/journal.pcbi.1007494.

Tkadlec, Josef. A Role of Graphs in Evolutionary Processes. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7196.

Wang, Peixin, et al. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.”10.1145/3371093__Proceedings of the ACM on Programming Languages, vol. 4, no. POPL, 25, ACM, 2020, doi:10.1145/3371093.

Brázdil, Tomás, et al. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.”10.1609/aaai.v34i06.6531__Proceedings of the 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 06, Association for the Advancement of Artificial Intelligence, 2020, pp. 9794–801, doi:10.1609/aaai.v34i06.6531.

Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” 36th European Workshop on Computational Geometry, 56, 2020.

Chatterjee, Krishnendu, et al. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.”10.1007/978-3-030-44914-8_5__European Symposium on Programming, vol. 12075, Springer Nature, 2020, pp. 112–40, doi:10.1007/978-3-030-44914-8_5.

Asadi, Ali, et al. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.”10.1007/978-3-030-59152-6_14__Automated Technology for Verification and Analysis, vol. 12302, Springer Nature, 2020, pp. 253–70, doi:10.1007/978-3-030-59152-6_14.

Chatterjee, Krishnendu, et al. “Polynomial Invariant Generation for Non-Deterministic Recursive Programs.”10.1145/3385412.3385969__Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 672–87, doi:10.1145/3385412.3385969.

Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.”10.1016/j.ress.2019.106665__Reliability Engineering and System Safety, vol. 193, 106665, Elsevier, 2020, doi:10.1016/j.ress.2019.106665.

Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.”10.4230/LIPICS.CONCUR.2019.7__Leibniz International Proceedings in Informatics, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7.

Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.

Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6.

Avni, Guy, et al. Bidding Mechanisms in Graph Games. Vol. 138, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.MFCS.2019.11.

Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.”10.1007/978-3-030-11245-5_22__International Conference on Verification, Model Checking, and Abstract Interpretation, vol. 11388, Springer Nature, 2019, pp. 468–90, doi:10.1007/978-3-030-11245-5_22.

Avni, Guy, et al. “Run-Time Optimization for Learned Controllers through Quantitative Games.”10.1007/978-3-030-25540-4_36__31st International Conference on Computer-Aided Verification, vol. 11561, Springer, 2019, pp. 630–49, doi:10.1007/978-3-030-25540-4_36.

Hauser, Oliver P., et al. “Social Dilemmas among Unequals.”10.1038/s41586-019-1488-5__Nature, vol. 572, no. 7770, Springer Nature, 2019, pp. 524–27, doi:10.1038/s41586-019-1488-5.

Ashok, Pranav, et al. “Strategy Representation by Decision Trees with Linear Classifiers.”10.1007/978-3-030-30281-8_7__16th International Conference on Quantitative Evaluation of Systems, vol. 11785, Springer Nature, 2019, pp. 109–28, doi:10.1007/978-3-030-30281-8_7.

Brázdil, Tomás, et al. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.”10.1007/978-3-030-31784-3_27__International Symposium on Automated Technology for Verification and Analysis, vol. 11781, Springer Nature, 2019, pp. 462–78, doi:10.1007/978-3-030-31784-3_27.

Tkadlec, Josef, et al. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.”10.1038/s42003-019-0373-y__Communications Biology, vol. 2, 138, Springer Nature, 2019, doi:10.1038/s42003-019-0373-y.

Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.”10.1145/3360550__Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550.

Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.”10.1109/lics.2019.8785706__34th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2019, pp. 1–13, doi:10.1109/lics.2019.8785706.

Biniaz, Ahmad, et al. “Token Swapping on Trees.” ArXiv, 1903.06981.

Huang, Mingzhang, et al. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.”10.1145/3360555__Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , vol. 3, 129, ACM, 2019, doi:10.1145/3360555.

Chatterjee, Krishnendu, et al. “Efficient Parameterized Algorithms for Data Packing.”10.1145/3290366__Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, 53, ACM, 2019, doi:10.1145/3290366.

Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.”10.1109/BLOC.2019.8751326__IEEE International Conference on Blockchain and Cryptocurrency, 8751326, IEEE, 2019, doi:10.1109/BLOC.2019.8751326.

Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.”10.1145/3297280.3297319__Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part 7772, ACM, 2019, pp. 374–81, doi:10.1145/3297280.3297319.

Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.”10.1145/3314221.3314581__PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–20, doi:10.1145/3314221.3314581.

Chatterjee, Krishnendu, et al. “The Treewidth of Smart Contracts.”10.1145/3297280.3297322__Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part 7772, ACM, pp. 400–08, doi:10.1145/3297280.3297322.

Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.”10.1145/3363525__ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 23, ACM, 2019, doi:10.1145/3363525.

Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive Programs.”10.1145/3339984__ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 20, ACM, 2019, doi:10.1145/3339984.

Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.”10.29007/5z5k__22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol. 57, EasyChair, 2018, pp. 233–53, doi:10.29007/5z5k.

Agrawal, Sheshansh, et al. Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs. Vol. 2, no. POPL, 34, ACM, 2018, doi:10.1145/3158122.

Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.”10.1007/978-3-319-10575-8_27__Handbook of Model Checking, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018, pp. 921–62, doi:10.1007/978-3-319-10575-8_27.

Chatterjee, Krishnendu, et al. “Computing Average Response Time.”10.1007/978-3-319-95246-8_9__Principles of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:10.1007/978-3-319-95246-8_9.

Reiter, Johannes, et al. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.”10.1038/s41467-017-02721-8__Nature Communications, vol. 9, no. 1, 555, Nature Publishing Group, 2018, doi:10.1038/s41467-017-02721-8.

Brázdil, Tomás, et al. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. Vol. 8033, IEEE, 2018, pp. 185–94, doi:10.1145/3209108.3209191.

Hilbe, Christian, et al. “Evolution of Cooperation in Stochastic Games.”10.1038/s41586-018-0277-x__Nature, vol. 559, no. 7713, Nature Publishing Group, 2018, pp. 246–49, doi:10.1038/s41586-018-0277-x.

Chatterjee, Krishnendu, et al. Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. ACM, 2018, pp. 2341–56, doi:10.1137/1.9781611975031.151.

Huang, Mingzhang, et al. New Approaches for Almost-Sure Termination of Probabilistic Programs. Edited by Sukyoung Ryu, vol. 11275, Springer, 2018, pp. 181–201, doi:10.1007/978-3-030-02768-1_11.

Hilbe, Christian, et al. “Partners and Rivals in Direct Reciprocity.”10.1038/s41562-018-0320-9__Nature Human Behaviour, vol. 2, Nature Publishing Group, 2018, pp. 469–477, doi:10.1038/s41562-018-0320-9.

Arming, Sebastian, et al. Parameter-Independent Strategies for PMDPs via POMDPs. Vol. 11024, Springer, 2018, pp. 53–70, doi:10.1007/978-3-319-99154-2_4.

Brázdil, Tomás, et al. Strategy Representation by Decision Trees in Reactive Synthesis. Vol. 10805, Springer, 2018, pp. 385–407, doi:10.1007/978-3-319-89960-2_21.

Chatterjee, Krishnendu, et al. Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. Vol. 10982, Springer, 2018, pp. 178–97, doi:10.1007/978-3-319-96142-2_13.

Hoffman, Moshe, et al. “The Signal-Burying Game Can Explain Why We Obscure Positive Traits and Good Deeds.”10.1038/s41562-018-0354-z__Nature Human Behaviour, vol. 2, Nature Publishing Group, 2018, pp. 397–404, doi:10.1038/s41562-018-0354-z.

Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.”10.1145/3219166.3219198__Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM Press, 2018, pp. 149–50, doi:10.1145/3219166.3219198.

Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.”10.1145/3174800__ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, 7, Association for Computing Machinery (ACM), 2018, doi:10.1145/3174800.

Horák, Karel, et al. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.”10.24963/ijcai.2018/662__Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018–July, IJCAI, 2018, pp. 4764–70, doi:10.24963/ijcai.2018/662.

Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.

Chatterjee, Krishnendu, et al. Sensor Synthesis for POMDPs with Reachability Objectives. Vol. 2018, AAAI Press, 2018, pp. 47–55.

Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.

Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.”10.1007/s11241-017-9293-4__Real-Time Systems, vol. 54, no. 1, Springer, 2018, pp. 166–207, doi:10.1007/s11241-017-9293-4.

Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between Learners.”10.1098/rsif.2018.0073__Journal of the Royal Society Interface, vol. 15, no. 140, 20180073, The Royal Society, 2018, doi:10.1098/rsif.2018.0073.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Chalupa, Marek, et al. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017, 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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Pavlogiannis, Andreas. Algorithmic Advances in Program Analysis and Their Applications. Institute of Science and Technology Austria, 2017, 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.

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.

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.

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.

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.

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.

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.

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.

Chatterjee, Krishnendu, et al. Stochastic Invariants for Probabilistic Termination. Vol. 52, no. 1, ACM, 2017, pp. 145–60, doi:10.1145/3009837.3009873.

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.

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.

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.

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.

Chatterjee, Krishnendu, and Laurent Doyen. Computation Tree Logic for Synchronization Properties. Vol. 55, 98, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:10.4230/LIPIcs.ICALP.2016.98.

Chatterjee, Krishnendu, et al. Nested Weighted Limit-Average Automata of Bounded Width. Vol. 58, 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.MFCS.2016.24.

Chatterjee, Krishnendu, et al. “Quantitative Automata under Probabilistic Semantics.”10.1145/2933575.2933588__Proceedings of the 31st Annual ACM/IEEE Symposium, IEEE, 2016, pp. 76–85, doi:10.1145/2933575.2933588.

Chatterjee, Krishnendu, et al. “Model and Objective Separation with Conditional Lower Bounds: Disjunction Is Harder than Conjunction.”10.1145/2933575.2935304__Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206, doi:10.1145/2933575.2935304.

Chatterjee, Krishnendu, et al. Robust Draws in Balanced Knockout Tournaments. Vol. 2016–January, AAAI Press, 2016, pp. 172–79.

Hilbe, Christian, and Arne Traulsen. “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.”10.1016/j.plrev.2016.10.004__Physics of Life Reviews, vol. 19, Elsevier, 2016, pp. 29–31, doi:10.1016/j.plrev.2016.10.004.

Pandey, Vineet, and Krishnendu Chatterjee. “Game-Theoretic Models Identify Useful Principles for Peer Collaboration in Online Learning Platforms.”10.1145/2818052.2869122__Proceedings of the ACM Conference on Computer Supported Cooperative Work, vol. 26, no. Februar-2016, ACM, 2016, pp. 365–68, doi:10.1145/2818052.2869122.

Brázdil, Tomás, et al. Stability in Graphs and Games. Vol. 59, 10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.10.

Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, vol. 2016–January, AAAI Press, 2016, pp. 88–96.

Brázdil, Tomás, et al. “Stochastic Shortest Path with Energy Constraints in POMDPs.” Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–66.

Brázdil, Tomás, et al. Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. Vol. 9938, Springer, 2016, pp. 32–49, doi:10.1007/978-3-319-46520-3_3.

Milinski, Manfred, et al. “Humans Choose Representatives Who Enforce Cooperation in Social Dilemmas through Extortion.”10.1038/ncomms10915__Nature Communications, vol. 7, 10915, Nature Publishing Group, 2016, doi:10.1038/ncomms10915.

Chatterjee, Krishnendu, et al. Quantitative Monitor Automata. Vol. 9837, Springer, 2016, pp. 23–38, doi:10.1007/978-3-662-53413-7_2.

Hansen, Kristoffer, et al. The Big Match in Small Space. Vol. 9928, Springer, 2016, pp. 64–76, doi:10.1007/978-3-662-53354-3_6.

Chonev, Ventsislav K., et al. “On the Complexity of the Orbit Problem.”10.1145/2857050__Journal of the ACM, vol. 63, no. 3, 23, ACM, 2016, doi:10.1145/2857050.

Chonev, Ventsislav K., et al. “On Recurrent Reachability for Continuous Linear Dynamical Systems.”10.1145/2933575.2934548__LICS ’16, IEEE, 2016, pp. 515–24, doi:10.1145/2933575.2934548.

Chakra, Maria, et al. “Coevolutionary Interactions between Farmers and Mafia Induce Host Acceptance of Avian Brood Parasites.”10.1098/rsos.160036__Royal Society Open Science, vol. 3, no. 5, 160036, Royal Society, The, 2016, doi:10.1098/rsos.160036.

Baek, Seung, et al. “Comparing Reactive and Memory-One Strategies of Direct Reciprocity.”10.1038/srep25676__Scientific Reports, vol. 6, 25676, Nature Publishing Group, 2016, doi:10.1038/srep25676.

Lohse, Konrad, et al. “Efficient Strategies for Calculating Blockwise Likelihoods under the Coalescent.”10.1534/genetics.115.183814__Genetics, vol. 202, no. 2, Genetics Society of America, 2016, pp. 775–86, doi:10.1534/genetics.115.183814.

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Deciding Legality of a Single Step of Magic: The Gathering. Vol. 285, IOS Press, 2016, pp. 1432–39, doi:10.3233/978-1-61499-672-9-1432.

Chatterjee, Krishnendu, and Laurent Doyen. Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives. Vol. 05-08-July-2016, IEEE, 2016, pp. 247–56, doi:10.1145/2933575.2934513.

Chatterjee, Krishnendu, et al. “What Is Decidable about Partially Observable Markov Decision Processes with <9-Regular Objectives.”10.1016/j.jcss.2016.02.009__Journal of Computer and System Sciences, vol. 82, no. 5, Elsevier, 2016, pp. 878–911, doi:10.1016/j.jcss.2016.02.009.

Chatterjee, Krishnendu, et al. “Optimal Cost Almost-Sure Reachability in POMDPs.”10.1016/j.artint.2016.01.007__Artificial Intelligence, vol. 234, Elsevier, 2016, pp. 26–48, doi:10.1016/j.artint.2016.01.007.

Chatterjee, Krishnendu, et al. Quantitative Interprocedural Analysis. IST Austria, 2016, doi:10.15479/AT:IST-2016-523-v1-1.

Chatterjee, Krishnendu, et al. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, vol. 2016, AAAI Press, 2016, pp. 3225–32.

Pavlogiannis, Andreas, et al. Amplification on Undirected Population Structures: Comets Beat Stars. IST Austria, 2016, doi:10.15479/AT:IST-2016-648-v1-1.

Pavlogiannis, Andreas, et al. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016, doi:10.15479/AT:IST-2017-749-v3-1.

Pavlogiannis, Andreas, et al. Strong Amplifiers of Natural Selection. IST Austria, 2016, doi:10.15479/AT:IST-2016-728-v1-1.

Hilbe, Christian, et al. “Asymmetric Power Boosts Extortion in an Economic Experiment.”10.1371/journal.pone.0163867__PLoS One, vol. 11, no. 10, e0163867, Public Library of Science, 2016, doi:10.1371/journal.pone.0163867.

Chmelik, Martin. Algorithms for Partially Observable Markov Decision Processes. Institute of Science and Technology Austria, 2016.

Daca, Przemyslaw, et al. Linear Distances between Markov Chains. Vol. 59, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.20.

Chatterjee, Krishnendu, et al. Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs. Vol. 57, 28, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:10.4230/LIPIcs.ESA.2016.28.

Chatterjee, Krishnendu, et al. Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. Vol. 20–22, ACM, 2016, pp. 327–42, doi:10.1145/2837614.2837639.

Pavlogiannis, Andreas, et al. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016, doi:10.15479/AT:IST-2017-728-v2-1.

Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. Vol. 20–22, ACM, 2016, pp. 733–47, doi:10.1145/2837614.2837624.

Chatterjee, Krishnendu, et al. Termination Analysis of Probabilistic Programs through Positivstellensatz’s. Vol. 9779, Springer, 2016, pp. 3–22, doi:10.1007/978-3-319-41528-4_1.

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under Finite-Memory Strategies for Concurrent Mean-Payoff Games.”10.1137/1.9781611973730.69__Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2015, no. 1, SIAM, 2015, pp. 1018–29, doi:10.1137/1.9781611973730.69.

Kretinsky, Jan, et al. Polynomial Time Decidability of Weighted Synchronization under Partial Observability. Vol. 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–54, doi:10.4230/LIPIcs.CONCUR.2015.142.

Ibsen-Jensen, Rasmus, et al. “Computational Complexity of Ecological and Evolutionary Spatial Dynamics.”10.1073/pnas.1511366112__PNAS, vol. 112, no. 51, National Academy of Sciences, 2015, pp. 15636–41, doi:10.1073/pnas.1511366112.

Forejt, Vojtbch, et al. Controller Synthesis for MDPs and Frequency LTL\'47U. Vol. 9450, Springer, 2015, pp. 162–77, doi:10.1007/978-3-662-48899-7_12.

Babiak, Tomás, et al. The Hanoi Omega-Automata Format. Vol. 9206, Springer, 2015, pp. 479–86, doi:10.1007/978-3-319-21690-4_31.

Chatterjee, Krishnendu, et al. “The Complexity of Synthesis from Probabilistic Components.”10.1007/978-3-662-47666-6_9__42nd International Colloquium, vol. 9135, Springer Nature, 2015, pp. 108–20, doi:10.1007/978-3-662-47666-6_9.

Pavlogiannis, Andreas, et al. “Cellular Cooperation with Shift Updating and Repulsion.”10.1038/srep17147__Scientific Reports, vol. 5, 17147, Nature Publishing Group, 2015, doi:10.1038/srep17147.

Brázdil, Tomás, et al. Long-Run Average Behaviour of Probabilistic Vector Addition Systems. IEEE, 2015, pp. 44–55, doi:10.1109/LICS.2015.15.

Landau, Dan, et al. “Mutations Driving CLL and Their Evolution in Progression and Relapse.”10.1038/nature15395__Nature, vol. 526, no. 7574, Nature Publishing Group, 2015, pp. 525–30, doi:10.1038/nature15395.

Brázdil, Tomás, et al. Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis. Vol. 9259, Springer, 2015, pp. 141–59, doi:10.1007/978-3-319-22264-6_10.

Adlam, Ben, et al. “Amplifiers of Selection.”10.1098/rspa.2015.0114__Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 471, no. 2181, 20150114, Royal Society of London, 2015, doi:10.1098/rspa.2015.0114.

Svoreová, Mária, et al. “Temporal Logic Motion Planning Using POMDPs with Parity Objectives: Case Study Paper.”10.1145/2728606.2728617__Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 233–38, doi:10.1145/2728606.2728617.

Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Temporal Simulation and Refinement Distances for Timed Systems.”10.1109/TAC.2015.2404612__IEEE Transactions on Automatic Control, vol. 60, no. 9, IEEE, 2015, pp. 2291–306, doi:10.1109/TAC.2015.2404612.

Velner, Yaron, et al. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.”10.1016/j.ic.2015.03.001__Information and Computation, vol. 241, no. 4, Elsevier, 2015, pp. 177–96, doi:10.1016/j.ic.2015.03.001.

Chatterjee, Krishnendu, et al. “Optimal Cost Almost-Sure Reachability in POMDPs.” Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , vol. 5, AAAI Press, 2015, pp. 3496–502.

Bloem, Roderick, et al. Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information. Vol. 9035, Springer, 2015, pp. 517–32, doi:10.1007/978-3-662-46681-0_50.

Brázdil, Tomás, et al. Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives. Vol. 9035, Springer, 2015, pp. 181–87, doi:10.1007/978-3-662-46681-0_12.

Benes, Nikola, et al. “Refinement Checking on Parametric Modal Transition Systems.”10.1007/s00236-015-0215-4__Acta Informatica, vol. 52, no. 2–3, Springer, 2015, pp. 269–97, doi:10.1007/s00236-015-0215-4.

Priklopil, Tadeas, et al. “Evolutionarily Stable Mating Decisions for Sequentially Searching Females and the Stability of Reproductive Isolation by Assortative Mating.”10.1111/evo.12618__Evolution, vol. 69, no. 4, Wiley, 2015, pp. 1015–26, doi:10.1111/evo.12618.

Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.”10.1016/j.artint.2014.12.009__Artificial Intelligence, vol. 221, Elsevier, 2015, pp. 46–72, doi:10.1016/j.artint.2014.12.009.

Fahrenberg, Uli, et al. Compositionality for Quantitative Specifications. Vol. 8997, Springer, 2015, pp. 306–24, doi:10.1007/978-3-319-15317-9_19.

Bérard, Béatrice, et al. “Probabilistic Opacity for Markov Decision Processes.”10.1016/j.ipl.2014.09.001__10.1016/j.ipl.2014.09.001__Information Processing Letters, vol. 115, no. 1, Elsevier, 2015, pp. 52–59, doi:10.1016/j.ipl.2014.09.001.

Chatterjee, Krishnendu, et al. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.”10.1016/j.tcs.2015.01.050__Theoretical Computer Science, vol. 573, no. 3, Elsevier, 2015, pp. 71–89, doi:10.1016/j.tcs.2015.01.050.

Chatterjee, Krishnendu, et al. “Randomness for Free.”10.1016/j.ic.2015.06.003__Information and Computation, vol. 245, no. 12, Elsevier, 2015, pp. 3–16, doi:10.1016/j.ic.2015.06.003.

Chatterjee, Krishnendu, et al. “Measuring and Synthesizing Systems in Probabilistic Environments.”10.1145/2699430__Journal of the ACM, vol. 62, no. 1, 9, ACM, 2015, doi:10.1145/2699430.

Chatterjee, Krishnendu, et al. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.”10.1109/LICS.2015.34__Proceedings - Symposium on Logic in Computer Science, vol. 2015–July, 7174888, IEEE, 2015, doi:10.1109/LICS.2015.34.

Chatterjee, Krishnendu, et al. “Looking at Mean-Payoff and Total-Payoff through Windows.”10.1016/j.ic.2015.03.010__Information and Computation, vol. 242, no. 6, Elsevier, 2015, pp. 25–52, doi:10.1016/j.ic.2015.03.010.

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.”10.1016/j.ic.2015.03.009__Information and Computation, vol. 242, no. 6, Elsevier, 2015, pp. 2–24, doi:10.1016/j.ic.2015.03.009.

Ahmed, Umair, et al. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, vol. 2, AAAI Press, 2015, pp. 745–52.

Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IEEE, 2015, pp. 325–30, doi:10.1109/ICRA.2015.7139019.

Chatterjee, Krishnendu, et al. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015, doi:10.15479/AT:IST-2015-322-v1-1.

Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IEEE, 2015, pp. 244–56, doi:10.1109/LICS.2015.32.

Chatterjee, Krishnendu, et al. “Nested Weighted Automata.”10.1109/LICS.2015.72__Proceedings - Symposium on Logic in Computer Science, vol. 2015–July, 7174926, IEEE, 2015, doi:10.1109/LICS.2015.72.

Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v1-1.

Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v2-1.

Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria, 2015, doi:10.15479/AT:IST-2015-170-v2-2.

Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.”10.1007/978-3-662-47666-6_10__42nd International Colloquium, vol. 9135, no. Part II, Springer Nature, 2015, pp. 121–33, doi:10.1007/978-3-662-47666-6_10.

Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-330-v2-1.

Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-319-v1-1.

Chatterjee, Krishnendu, et al. Edit Distance for Pushdown Automata. IST Austria, 2015, doi:10.15479/AT:IST-2015-334-v1-1.

Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v2-2.

Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v1-1.

Reiter, Johannes, et al. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria, 2015, doi:10.15479/AT:IST-2015-399-v1-1.

Chatterjee, Krishnendu, et al. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015, doi:10.15479/AT:IST-2015-325-v2-1.

Reiter, Johannes, et al. “Biological Auctions with Multiple Rewards.”10.1098/rspb.2015.1041__Proceedings of the Royal Society of London Series B Biological Sciences, vol. 282, no. 1812, Royal Society, 2015, doi:10.1098/rspb.2015.1041.

Reiter, Johannes. The Subclonal Evolution of Cancer. Institute of Science and Technology Austria, 2015.

Benes, Nikola, et al. Complete Composition Operators for IOCO-Testing Theory. ACM, 2015, pp. 101–10, doi:10.1145/2737166.2737175.

Chatterjee, Krishnendu, et al. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.”10.1007/s10703-015-0235-2__Formal Methods in System Design, vol. 47, no. 2, Springer, 2015, pp. 230–64, doi:10.1007/s10703-015-0235-2.

Chatterjee, Krishnendu, et al. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.”10.1145/2676726.2676979__ACM SIGPLAN Notices, vol. 50, no. 1, ACM, 2015, pp. 97–109, doi:10.1145/2676726.2676979.

Chatterjee, Krishnendu, et al. “Quantitative Interprocedural Analysis.”10.1145/2676726.2676968__Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT , vol. 50, no. 1, ACM, 2015, pp. 539–51, doi:10.1145/2676726.2676968.

Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. Vol. 9206, Springer, 2015, pp. 140–57, doi:10.1007/978-3-319-21690-4_9.

Chatterjee, Krishnendu, et al. “A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks.”10.1109/RTSS.2014.9__Real-Time Systems Symposium, vol. 2015, no. January, IEEE, 2015, pp. 118–27, doi:10.1109/RTSS.2014.9.

Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015, doi:10.15479/AT:IST-2015-340-v1-1.

Svoreová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.”10.1145/2728606.2728608__Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–68, doi:10.1145/2728606.2728608.

Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.”10.3390/g6040413__Games, vol. 6, no. 4, MDPI, 2015, pp. 413–37, doi:10.3390/g6040413.

Brázdil, Tomás, et al. Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Vol. 9206, Springer, 2015, pp. 158–77, doi:10.1007/978-3-319-21690-4_10.

Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.”10.1007/978-3-642-54013-4_15__Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 262–81, doi:10.1007/978-3-642-54013-4_15.

Chatterjee, Krishnendu, et al. “Approximating the Minimum Cycle Mean.”10.1016/j.tcs.2014.06.031__Theoretical Computer Science, vol. 547, no. C, Elsevier, 2014, pp. 104–16, doi:10.1016/j.tcs.2014.06.031.

Jha, Susmit, et al. Game Theoretic Secure Localization in Wireless Sensor Networks. IEEE, 2014, pp. 85–90, doi:10.1109/IOT.2014.7030120.

Landau, Dan, et al. “Novel Putative Driver Gene Mutations in Chronic Lymphocytic Leukemia (CLL): Results from a Combined Analysis of Whole Exome Sequencing of 262 Primary CLL Aamples.” Blood, vol. 124, no. 21, American Society of Hematology, 2014, pp. 1952–1952.

Brázdil, Tomás, et al. “Verification of Markov Decision Processes Using Learning Algorithms.”10.1007/978-3-319-11936-6_8__10.1007/978-3-319-11936-6_8__Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, vol. 8837, Society of Industrial and Applied Mathematics, 2014, pp. 98–114, doi:10.1007/978-3-319-11936-6_8.

Hermanns, Holger, et al. “Probabilistic Bisimulation: Naturally on Distributions.”10.1007/978-3-662-44584-6_18__Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–65, doi:10.1007/978-3-662-44584-6_18.

Aminof, Benjamin, et al. “Parameterized Model Checking of Rendezvous Systems.”10.1007/978-3-662-44584-6_9__Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 109–24, doi:10.1007/978-3-662-44584-6_9.

Bloem, Roderick, et al. “Synthesizing Robust Systems.”10.1007/s00236-013-0191-5__Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 193–220, doi:10.1007/s00236-013-0191-5.

Esparza, Javier, and Jan Kretinsky. From LTL to Deterministic Automata: A Safraless Compositional Approach. Vol. 8559, Springer, 2014, pp. 192–208, doi:10.1007/978-3-319-08867-9_13.

Brázdil, Tomás, et al. “Markov Decision Processes with Multiple Long-Run Average Objectives.”10.2168/LMCS-10(1:13)2014__Logical Methods in Computer Science, vol. 10, no. 1, International Federation of Computational Logic, 2014, doi:10.2168/LMCS-10(1:13)2014.

Grinshpun, Andrey, et al. “Alternating Traps in Muller and Parity Games.”10.1016/j.tcs.2013.11.032__Theoretical Computer Science, vol. 521, Elsevier, 2014, pp. 73–91, doi:10.1016/j.tcs.2013.11.032.

Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.”10.1007/s00236-013-0182-6__Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 129–63, doi:10.1007/s00236-013-0182-6.

Cerny, Pavol, et al. “Interface Simulation Distances.”10.1016/j.tcs.2014.08.019__Theoretical Computer Science, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:10.1016/j.tcs.2014.08.019.

Chatterjee, Krishnendu, and Monika H. Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.”10.1145/2597631__Journal of the ACM, vol. 61, no. 3, , ACM, 2014, doi:10.1145/2597631.

Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.”10.1007/978-3-662-44584-6_37__Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–59, doi:10.1007/978-3-662-44584-6_37.

Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.”10.4204/EPTCS.146.11__Electronic Proceedings in Theoretical Computer Science, EPTCS, vol. 146, Open Publishing Association, 2014, pp. 83–90, doi:10.4204/EPTCS.146.11.

Chatterjee, Krishnendu. Partial-Observation Stochastic Reachability and Parity Games. Vol. 8634, no. PART 1, Springer, 2014, pp. 1–4, doi:10.1007/978-3-662-44522-8_1.

Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.”10.1145/2579821__ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2, 16, ACM, 2014, doi:10.1145/2579821.

Boker, Udi, et al. “Temporal Specifications with Accumulative Values.”10.1145/2629686__ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4, 27, ACM, 2014, doi:10.1145/2629686.

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Mean Payoff Games. Vol. 8573, no. Part 2, Springer, 2014, pp. 122–33, doi:10.1007/978-3-662-43951-7_11.

Chatterjee, Krishnendu, et al. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. Vol. 8412, Springer, 2014, pp. 242–57, doi:10.1007/978-3-642-54830-7_16.

Chatterjee, Krishnendu, et al. Perfect-Information Stochastic Mean-Payoff Parity Games. Vol. 8412, Springer, 2014, pp. 210–25, doi:10.1007/978-3-642-54830-7_14.

Chatterjee, Krishnendu, et al. Edit Distance for Timed Automata. Springer, 2014, pp. 303–12, doi:10.1145/2562059.2562141.

Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v2-2.

Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v3-1.

Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v1-1.

Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.”10.1007/978-3-662-43951-7_10__Lecture Notes in Computer Science, vol. 8573, no. Part 2, Springer, 2014, pp. 110–21, doi:10.1007/978-3-662-43951-7_10.

Chatterjee, Krishnendu, et al. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-187-v1-1.

Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary. IST Austria, 2014, doi:10.15479/AT:IST-2014-176-v1-1.

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-191-v1-1.

Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014, doi:10.15479/AT:IST-2014-305-v1-1.

Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014, doi:10.15479/AT:IST-2014-305-v2-1.

Chatterjee, Krishnendu, et al. A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks. IST Austria, 2014, doi:10.15479/AT:IST-2014-300-v1-1.

Chatterjee, Krishnendu, et al. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-314-v1-1.

Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria, 2014, doi:10.15479/AT:IST-2014-170-v1-1.

Chatterjee, Krishnendu, et al. The Complexity of Evolution on Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-190-v2-2.

Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.”10.1007/978-3-642-54013-4_5__VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 78–97, doi:10.1007/978-3-642-54013-4_5.

Chatterjee, Krishnendu, et al. “The Time Scale of Evolutionary Innovation.”10.1371/journal.pcbi.1003818__PLoS Computational Biology, vol. 10, no. 9, 7p, Public Library of Science, 2014, doi:10.1371/journal.pcbi.1003818.

Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”10.1007/s00453-013-9843-7__Algorithmica, vol. 70, no. 3, Springer, 2014, pp. 457–92, doi:10.1007/s00453-013-9843-7.

Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. Vol. 8559, Springer, 2014, pp. 473–90, doi:10.1007/978-3-319-08867-9_31.

Chatterjee, Krishnendu, et al. Quantitative Fair Simulation Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-315-v1-1.

Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.”10.4230/LIPIcs.CSL.2013.181__22nd EACSL Annual Conference on Computer Science Logic, vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–96, doi:10.4230/LIPIcs.CSL.2013.181.

Chatterjee, Krishnendu, et al. Multi-Objective Discounted Reward Verification in Graphs and MDPs. Vol. 8312, Springer, 2013, pp. 228–42, doi:10.1007/978-3-642-45221-5_17.

Chatterjee, Krishnendu, and Jiri Sgall, editors. Mathematical Foundations of Computer Science 2013. Vol. 8087, Springer, 2013, p. VI-854, doi:10.1007/978-3-642-40313-2.

Godhal, Yashdeep, et al. “Synthesis of AMBA AHB from Formal Specification: A Case Study.”10.1007/s10009-011-0207-9__International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6, Springer, 2013, pp. 585–601, doi:10.1007/s10009-011-0207-9.

Chatterjee, Krishnendu, et al. Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. Vol. 8044, Springer, 2013, pp. 559–75, doi:10.1007/978-3-642-39799-8_37.

Chatterjee, Krishnendu, and Jakub aCki. Faster Algorithms for Markov Decision Processes with Low Treewidth. Vol. 8044, Springer, 2013, pp. 543–58, doi:10.1007/978-3-642-39799-8_36.

Chatterjee, Krishnendu, et al. “The Complexity of Coverage.”10.1142/S0129054113400066__International Journal of Foundations of Computer Science, vol. 24, no. 2, World Scientific Publishing, 2013, pp. 165–85, doi:10.1142/S0129054113400066.

Novak, Sebastian, et al. “Density Games.”10.1016/j.jtbi.2013.05.029__Journal of Theoretical Biology, vol. 334, Elsevier, 2013, pp. 26–34, doi:10.1016/j.jtbi.2013.05.029.

Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Timed Simulation Functions and Refinement Metrics for Real-Time Systems.”10.1145/2461328.2461370__Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, vol. 1, Springer, 2013, pp. 273–82, doi:10.1145/2461328.2461370.

Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory-Efficient, Clock-Memory Free, and Non-Zeno Safety Controllers for Timed Systems.”10.1016/j.ic.2013.04.003__Information and Computation, vol. 228–229, Elsevier, 2013, pp. 83–119, doi:10.1016/j.ic.2013.04.003.

Chatterjee, Krishnendu, and Vishwanath Raman. “Assume-Guarantee Synthesis for Digital Contract Signing.”10.1007/s00165-013-0283-6__Formal Aspects of Computing, vol. 26, no. 4, Springer, 2013, pp. 825–59, doi:10.1007/s00165-013-0283-6.

Chatterjee, Krishnendu, et al. “Strategy Improvement for Concurrent Reachability and Turn Based Stochastic Safety Games.”10.1016/j.jcss.2012.12.001__Journal of Computer and System Sciences, vol. 79, no. 5, Elsevier, 2013, pp. 640–57, doi:10.1016/j.jcss.2012.12.001.

Chmelik, Martin, and Vojtbch ehák. Controllable-Choice Message Sequence Graphs. Vol. 7721, Springer, 2013, pp. 118–30, doi:10.1007/978-3-642-36046-6_12.

Chatterjee, Krishnendu, et al. “Code Aware Resource Management.”10.1007/s10703-012-0170-4__Formal Methods in System Design, vol. 42, no. 2, Springer, 2013, pp. 142–74, doi:10.1007/s10703-012-0170-4.

Chatterjee, Krishnendu, et al. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.”10.1007/s10703-012-0180-2__Formal Methods in System Design, vol. 42, no. 3, Springer, 2013, pp. 301–27, doi:10.1007/s10703-012-0180-2.

Chatterjee, Krishnendu, et al. Looking at Mean-Payoff and Total-Payoff through Windows. Vol. 8172, Springer, 2013, pp. 118–32, doi:10.1007/978-3-319-02444-8_10.

Reiter, Johannes, et al. TTP: Tool for Tumor Progression. IST Austria, 2013, doi:10.15479/AT:IST-2013-104-v1-1.

Chatterjee, Krishnendu, et al. What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 165–80, doi:10.4230/LIPIcs.CSL.2013.165.

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. Qualitative Analysis of Concurrent Mean-Payoff Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-126-v1-1.

Chatterjee, Krishnendu, et al. What Is Decidable about Partially Observable Markov Decision Processes with <9-Regular Objectives. IST Austria, 2013, doi:10.15479/AT:IST-2013-109-v1-1.

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-127-v1-1.

Chatterjee, Krishnendu, et al. Perfect-Information Stochastic Mean-Payoff Parity Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-128-v1-1.

Chatterjee, Krishnendu, et al. Edit Distance for Timed Automata. IST Austria, 2013, doi:10.15479/AT:IST-2013-144-v1-1.

Chatterjee, Krishnendu, et al. “Distributed Synthesis for LTL Fragments.”10.1109/FMCAD.2013.6679386__13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25, doi:10.1109/FMCAD.2013.6679386.

Chatterjee, Krishnendu, et al. Distributed Synthesis for LTL Fragments. IST Austria, 2013, doi:10.15479/AT:IST-2013-130-v1-1.

Chatterjee, Krishnendu, et al. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. IST Austria, 2013, doi:10.15479/AT:IST-2013-141-v1-1.

Ahmed, Umair, et al. Automatic Generation of Alternative Starting Positions for Traditional Board Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-146-v1-1.

Chatterjee, Krishnendu, and Yaron Velner. Hyperplane Separation Technique for Multidimensional Mean-Payoff Games. Vol. 8052, Springer, 2013, pp. 500–15, doi:10.1007/978-3-642-40184-8_35.

Chatterjee, Krishnendu, et al. “How to Travel between Languages.”10.1007/978-3-642-37064-9_20__7th International Conference on Language and Automata Theory and Applications, vol. 7810, Springer Nature, 2013, pp. 214–25, doi:10.1007/978-3-642-37064-9_20.

Zagorsky, Benjamin, et al. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .”10.1371/journal.pone.0080814__PLoS One, vol. 8, no. 12, e80814, Public Library of Science, 2013, doi:10.1371/journal.pone.0080814.

Reiter, Johannes, et al. “The Effect of One Additional Driver Mutation on Tumor Progression.”10.1111/eva.12020__Evolutionary Applications, vol. 6, no. 1, Wiley-Blackwell, 2013, pp. 34–45, doi:10.1111/eva.12020.

Boei, Ivana, et al. “Evolutionary Dynamics of Cancer in Response to Targeted Combination Therapy.”10.7554/eLife.00747__ELife, vol. 2, e00747, eLife Sciences Publications, 2013, doi:10.7554/eLife.00747.

Reiter, Johannes, et al. “TTP: Tool for Tumor Progression.”10.1007/978-3-642-39799-8_6__Proceedings of 25th Int. Conf. on Computer Aided Verification, vol. 8044, Springer, 2013, pp. 101–06, doi:10.1007/978-3-642-39799-8_6.

Brázdil, Tomás, et al. “Trading Performance for Stability in Markov Decision Processes.”10.1109/LICS.2013.39__28th Annual ACM/IEEE Symposium, IEEE, 2013, pp. 331–40, doi:10.1109/LICS.2013.39.

Chatterjee, Krishnendu, et al. “Automated Analysis of Real-Time Scheduling Using Graph Games.”10.1145/2461328.2461356__Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, ACM, 2013, pp. 163–72, doi:10.1145/2461328.2461356.

Chatterjee, Krishnendu, et al. Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives. Vol. 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 461–73, doi:10.4230/LIPIcs.FSTTCS.2012.461.

Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.”10.1007/978-3-642-32940-1_10__CONCUR 2012 - Concurrency Theory, edited by Maciej Koutny and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi:10.1007/978-3-642-32940-1_10.

Chatterjee, Krishnendu, et al. “Evolutionary Game Dynamics in Populations with Different Learners.”10.1016/j.jtbi.2012.02.021__Journal of Theoretical Biology, vol. 301, Elsevier, 2012, pp. 161–73, doi:10.1016/j.jtbi.2012.02.021.

Cerny, Pavol, et al. “Interface Simulation Distances.”10.4204/EPTCS.96.3__Electronic Proceedings in Theoretical Computer Science, vol. 96, EPTCS, 2012, pp. 29–42, doi:10.4204/EPTCS.96.3.

Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.”10.1145/2380356.2380370__Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52, doi:10.1145/2380356.2380370.

Chatterjee, Krishnendu, et al. Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games. Vol. 7561, Springer, 2012, pp. 385–99, doi:10.1007/978-3-642-33386-6_30.

Brázdil, Brázdil, et al. Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. Vol. 7358, Springer, 2012, pp. 23–38, doi:10.1007/978-3-642-31424-7_8.

Chatterjee, Krishnendu, and Vishwanath Raman. Synthesizing Protocols for Digital Contract Signing. Vol. 7148, Springer, 2012, pp. 152–68, doi:10.1007/978-3-642-27940-9_11.

Chatterjee, Krishnendu, and Laurent Doyen. Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives. Vol. 7119, Springer, 2012, pp. 37–46, doi:10.1007/978-3-642-25929-6_3.

Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.”10.1016/j.ic.2011.11.004__Information and Computation, vol. 211, Elsevier, 2012, pp. 29–48, doi:10.1016/j.ic.2011.11.004.

Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.”10.1142/S0129054112400308__International Journal of Foundations of Computer Science, vol. 23, no. 3, World Scientific Publishing, 2012, pp. 609–25, doi:10.1142/S0129054112400308.

Chatterjee, Krishnendu, and Thomas A. Henzinger. “A Survey of Stochastic <9 Regular Games.”10.1016/j.jcss.2011.05.002__Journal of Computer and System Sciences, vol. 78, no. 2, Elsevier, 2012, pp. 394–413, doi:10.1016/j.jcss.2011.05.002.

Chatterjee, Krishnendu, et al. “A Survey of Partial-Observation Stochastic Parity Games.”10.1007/s10703-012-0164-2__Formal Methods in System Design, vol. 43, no. 2, Springer, 2012, pp. 268–84, doi:10.1007/s10703-012-0164-2.

Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.”10.1016/j.tcs.2012.07.038__Theoretical Computer Science, vol. 458, Elsevier, 2012, pp. 49–60, doi:10.1016/j.tcs.2012.07.038.

Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.”10.4204/EPTCS.96.18__Proceedings GandALF 2012, vol. 96, Open Publishing Association, 2012, pp. 238–46, doi:10.4204/EPTCS.96.18.

Rabinovich, Alexander, and Sasha Rubin. Interpretations in Trees with Countably Many Branches. 6280474, IEEE, 2012, doi:10.1109/LICS.2012.65.

Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement Relations. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–82, doi:10.4230/LIPIcs.CSL.2012.167.

Chatterjee, Krishnendu, and Monika H. Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.”10.1137/1.9781611973099.109__Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–99, doi:10.1137/1.9781611973099.109.

Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.”10.1109/LICS.2012.30__Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280438, IEEE, 2012, doi:10.1109/LICS.2012.30.

Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games. IST Austria, 2012, doi:10.15479/AT:IST-2012-0002.

Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement Relations. IST Austria, 2012, doi:10.15479/AT:IST-2012-0001.

Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.”10.1109/LICS.2012.28__Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280436, IEEE, 2012, doi:10.1109/LICS.2012.28.

Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. Vol. 7213, Springer, 2012, pp. 270–85, doi:10.1007/978-3-642-28729-9_18.

Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.”10.1109/LICS.2012.29__Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280437, IEEE, 2012, doi:10.1109/LICS.2012.29.

Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”10.1007/978-3-642-33090-2_27__Algorithms – ESA 2012, vol. 7501, Springer, 2012, pp. 301–12, doi:10.1007/978-3-642-33090-2_27.

Diaz Jr, Luis, et al. “The Molecular Evolution of Acquired Resistance to Targeted EGFR Blockade in Colorectal Cancers.”10.1038/nature11219__Nature, vol. 486, no. 7404, Nature Publishing Group, 2012, pp. 537–40, doi:10.1038/nature11219.

Chatterjee, Krishnendu, et al. “Evolutionary Dynamics of Biological Auctions.”10.1016/j.tpb.2011.11.003__Theoretical Population Biology, vol. 81, no. 1, Academic Press, 2012, pp. 69–80, doi:10.1016/j.tpb.2011.11.003.

Bloem, Roderick, et al. “Specification-Centered Robustness.”10.1109/SIES.2011.5953660__6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–85, doi:10.1109/SIES.2011.5953660.

Chatterjee, Krishnendu, and Ritankar Majumdar. Minimum Attention Controller Synthesis for Omega Regular Objectives. Edited by Uli Fahrenberg and Stavros Tripakis, vol. 6919, Springer, 2011, pp. 145–59, doi:10.1007/978-3-642-24310-3_11.

Chatterjee, Krishnendu, et al. On Memoryless Quantitative Objectives. Edited by Olaf Owe et al., vol. 6914, Springer, 2011, pp. 148–59, doi:10.1007/978-3-642-22953-4_13.

Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.”10.1145/1970398.1970404__ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4, 28, ACM, 2011, doi:10.1145/1970398.1970404.

Chatterjee, Krishnendu, and Nathanaël Fijalkow. A Reduction from Parity Games to Simple Stochastic Games. Vol. 54, EPTCS, 2011, pp. 74–86, doi:10.4204/EPTCS.54.6.

Chatterjee, Krishnendu, et al. QUASY: Quantitative Synthesis Tool. Vol. 6605, Springer, 2011, pp. 267–71, doi:10.1007/978-3-642-19835-9_24.

Chatterjee, Krishnendu, et al. The Decidability Frontier for Probabilistic Automata on Infinite Words. ArXiv.

Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.”10.2168/LMCS-7(4:8)2011__Logical Methods in Computer Science, vol. 7, no. 4, International Federation of Computational Logic, 2011, doi:10.2168/LMCS-7(4:8)2011.

Chatterjee, Krishnendu, et al. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv, ArXiv, 2011.

Chatterjee, Krishnendu, et al. Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 260–76, doi:10.1007/978-3-642-22110-1_21.

Chatterjee, Krishnendu, and Nathanaël Fijalkow. Finitary Languages. Vol. 6638, Springer, 2011, pp. 216–26, doi:10.1007/978-3-642-21254-3_16.

Brázdil, Tomás, et al. Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes. 5970225, IEEE, 2011, doi:10.1109/LICS.2011.10.

Chatterjee, Krishnendu, and Vinayak Prabhu. Synthesis of Memory Efficient Real Time Controllers for Safety Objectives. Springer, 2011, pp. 221–30, doi:10.1145/1967701.1967734.

Chatterjee, Krishnendu. Graph Games with Reachability Objectives. Edited by Giorgo Delzanno and Igor Potapov, vol. 6945, Springer, 2011, pp. 1–1, doi:10.1007/978-3-642-24288-5_1.

Chatterjee, Krishnendu, and Monika H. Henzinger. Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification. SIAM, 2011, pp. 1318–36, doi:10.1137/1.9781611973082.101.

Cerny, Pavol, et al. The Complexity of Quantitative Information Flow Problems. IEEE, 2011, pp. 205–17, doi:10.1109/CSF.2011.21.

Chatterjee, Krishnendu, et al. The Complexity of Request-Response Games. Edited by Adrian-Horia Dediu et al., vol. 6638, Springer, 2011, pp. 227–37, doi:10.1007/978-3-642-21254-3_17.

Chatterjee, Krishnendu, and Monika H. Henzinger. An O(N2) Time Algorithm for Alternating Büchi Games. IST Austria, 2011, doi:10.15479/AT:IST-2011-0009.

Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic Games: How to Win When Belief Fails. IST Austria, 2011, doi:10.15479/AT:IST-2011-0007.

Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games. IST Austria, 2011, doi:10.15479/AT:IST-2011-0008.

Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. IST Austria, 2011, doi:10.15479/AT:IST-2011-0006.

Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv, ArXiv, 2011, pp. 1–51.

Boker, Udi, et al. Temporal Specifications with Accumulative Values. 5970226, IEEE, 2011, doi:10.1109/LICS.2011.33.

Boker, Udi, et al. Temporal Specifications with Accumulative Values. IST Austria, 2011, doi:10.15479/AT:IST-2011-0003.

Chatterjee, Krishnendu, and Mathieu Tracol. Decidable Problems for Probabilistic Automata on Infinite Words. IST Austria, 2011, doi:10.15479/AT:IST-2011-0004.

Cerny, Pavol, et al. Quantitative Synthesis for Concurrent Programs. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 243–59, doi:10.1007/978-3-642-22110-1_20.

Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. Vol. 6907, Springer, 2011, pp. 206–18, doi:10.1007/978-3-642-22993-0_21.

Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. IST Austria, 2011, doi:10.15479/AT:IST-2011-0001.

Chatterjee, Krishnendu, and Laurent Doyen. The Complexity of Partial-Observation Parity Games. Vol. 6397, Springer, 2010, pp. 1–14, doi:10.1007/978-3-642-16242-8_1.

Chatterjee, Krishnendu, et al. Randomness for Free. Vol. 6281, Springer, 2010, pp. 246–57, doi:10.1007/978-3-642-15155-2_23.

Chatterjee, Krishnendu, and Thomas A. Henzinger, editors. Formal Modeling and Analysis of Timed Systems. Vol. 6246, Springer, 2010, doi:10.1007/978-3-642-15297-9.

Bloem, Roderick, et al. Robustness in the Presence of Liveness. Edited by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:10.1007/978-3-642-14295-6_36.

Chatterjee, Krishnendu, et al. “Algorithms for Game Metrics.”10.2168/LMCS-6(3:13)2010__Logical Methods in Computer Science, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–27, doi:10.2168/LMCS-6(3:13)2010.

Chatterjee, Krishnendu, et al. Mean-Payoff Automaton Expressions. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:10.1007/978-3-642-15375-4_19.

Chatterjee, Krishnendu, et al. Obliging Games. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 284–96, doi:10.1007/978-3-642-15375-4_20.

Chatterjee, Krishnendu, and Laurent Doyen. Energy Parity Games. Vol. 6199, Springer, 2010, pp. 599–610, doi:10.1007/978-3-642-14162-1_50.

Chatterjee, Krishnendu, et al. Generalized Mean-Payoff and Energy Games. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–16, doi:10.4230/LIPIcs.FSTTCS.2010.505.

Chatterjee, Krishnendu, et al. Measuring and Synthesizing Systems in Probabilistic Environments. Vol. 6174, Springer, 2010, pp. 380–95, doi:10.1007/978-3-642-14295-6_34.

Chatterjee, Krishnendu, et al. Analyzing the Impact of Change in Multi-Threaded Programs. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 293–307, doi:10.1007/978-3-642-12029-9_21.

Berwanger, Dietmar, et al. “Strategy Construction for Parity Games with Imperfect Information.”10.1016/j.ic.2009.09.006__Information and Computation, vol. 208, no. 10, Elsevier, 2010, pp. 1206–20, doi:10.1016/j.ic.2009.09.006.

Chatterjee, Krishnendu, et al. “Strategy Logic.”10.1016/j.ic.2009.07.004__Information and Computation, vol. 208, no. 6, Elsevier, 2010, pp. 677–93, doi:10.1016/j.ic.2009.07.004.

Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative Languages.”10.2168/LMCS-6(3:10)2010__Logical Methods in Computer Science, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–23, doi:10.2168/LMCS-6(3:10)2010.

Cristau, Julien, et al. “How Do We Remember the Past in Randomised Strategies? .”10.4204/EPTCS.25.7__Proceedings of GandALF 2010, vol. 25, Open Publishing Association, 2010, pp. 30–39, doi:10.4204/EPTCS.25.7.

Chatterjee, Krishnendu, et al. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010, doi:10.15479/AT:IST-2010-0004.

Chatterjee, Krishnendu, et al. GIST: A Solver for Probabilistic Games. Vol. 6174, Springer, 2010, pp. 665–69, doi:10.1007/978-3-642-14295-6_57.

Chatterjee, Krishnendu, and Nathanaël Fijalkow. Topological, Automata-Theoretic and Logical Characterization of Finitary Languages. IST Austria, 2010, doi:10.15479/AT:IST-2010-0002.

Chatterjee, Krishnendu, and Thomas A. Henzinger. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. Vol. 6252, Springer, 2010, pp. 1–16, doi:10.1007/978-3-642-15643-4_1.

Chatterjee, Krishnendu, et al. Qualitative Analysis of Partially-Observable Markov Decision Processes. Vol. 6281, Springer, 2010, pp. 258–69, doi:10.1007/978-3-642-15155-2_24.

Chatterjee, Krishnendu, and Ritankar Majumdar. Discounting in Games across Time Scales. Vol. 25, EPTCS, 2010, pp. 22–29, doi:10.4204/EPTCS.25.6.

Chatterjee, Krishnendu, et al. Probabilistic Weighted Automata. Vol. 5710, Springer, 2009, pp. 244–58, doi:10.1007/978-3-642-04081-8_17.

Chatterjee, Krishnendu, et al. “Finitary Winning in Omega-Regular Games.”10.1145/1614431.1614432__ACM Transactions on Computational Logic (TOCL), vol. 11, no. 1, 1, ACM, 2009, doi:10.1145/1614431.1614432.

Chatterjee, Krishnendu, et al. Alternating Weighted Automata. Vol. 5699, Springer, 2009, pp. 3–13, doi:10.1007/978-3-642-03409-1_2.

Chatterjee, Krishnendu, et al. A Survey of Stochastic Games with Limsup and Liminf Objectives. Vol. 5556, Springer, 2009, pp. 1–15, doi:10.1007/978-3-642-02930-1_1.

Chatterjee, Krishnendu, et al. Stochastic Games with Finitary Objectives. Vol. 5734, Springer, 2009, pp. 34–54, doi:10.1007/978-3-642-03816-7_4.

Bloem, Roderick, et al. Better Quality in Synthesis through Quantitative Objectives. Vol. 5643, Springer, 2009, pp. 140–56, doi:10.1007/978-3-642-02658-4_14.

Chatterjee, Krishnendu, et al. Gist: A Solver for Probabilistic Games. IST Austria, 2009, doi:10.15479/AT:IST-2009-0003.

Chatterjee, Krishnendu, et al. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009, doi:10.15479/AT:IST-2009-0002.

Chatterjee, Krishnendu. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. IST Austria, 2009, doi:10.15479/AT:IST-2009-0004.

Chatterjee, Krishnendu, et al. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009, doi:10.15479/AT:IST-2009-0001.