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

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

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

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

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

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

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

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

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

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

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.
LibreCat: https://research-explorer.ista.ac.at/record/1070
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.
LibreCat: https://research-explorer.ista.ac.at/record/1090
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.
LibreCat: https://research-explorer.ista.ac.at/record/1138
DOI: 10.1145/2933575.2933588
arXiv: 1604.06764

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.
LibreCat: https://research-explorer.ista.ac.at/record/1140
DOI: 10.1145/2933575.2935304
arXiv: 1602.02670

Chatterjee, Krishnendu, et al. Robust Draws in Balanced Knockout Tournaments. Vol. 2016–January, AAAI Press, 2016, pp. 172–79.
LibreCat: https://research-explorer.ista.ac.at/record/1182

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.
LibreCat: https://research-explorer.ista.ac.at/record/1200
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.
LibreCat: https://research-explorer.ista.ac.at/record/1245
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.
LibreCat: https://research-explorer.ista.ac.at/record/1325
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.
LibreCat: https://research-explorer.ista.ac.at/record/1324

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.
LibreCat: https://research-explorer.ista.ac.at/record/1327

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.
LibreCat: https://research-explorer.ista.ac.at/record/1326
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.
LibreCat: https://research-explorer.ista.ac.at/record/1333
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.
LibreCat: https://research-explorer.ista.ac.at/record/1335
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.
LibreCat: https://research-explorer.ista.ac.at/record/1340
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.
LibreCat: https://research-explorer.ista.ac.at/record/1380
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.
LibreCat: https://research-explorer.ista.ac.at/record/1389
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.
LibreCat: https://research-explorer.ista.ac.at/record/1426
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.
LibreCat: https://research-explorer.ista.ac.at/record/1423
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.
LibreCat: https://research-explorer.ista.ac.at/record/1518
DOI: 10.1534/genetics.115.183814
PMID: 26715666

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.
LibreCat: https://research-explorer.ista.ac.at/record/478
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.
LibreCat: https://research-explorer.ista.ac.at/record/480
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.
LibreCat: https://research-explorer.ista.ac.at/record/1477
DOI: 10.1016/j.jcss.2016.02.009
arXiv: 1309.2802

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.
LibreCat: https://research-explorer.ista.ac.at/record/1529
DOI: 10.1016/j.artint.2016.01.007
arXiv: 1411.3880

Chatterjee, Krishnendu, et al. Quantitative Interprocedural Analysis. IST Austria, 2016, doi:10.15479/AT:IST-2016-523-v1-1.
LibreCat: https://research-explorer.ista.ac.at/record/5445
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.
LibreCat: https://research-explorer.ista.ac.at/record/1166

Pavlogiannis, Andreas, et al. Amplification on Undirected Population Structures: Comets Beat Stars. IST Austria, 2016, doi:10.15479/AT:IST-2016-648-v1-1.
LibreCat: https://research-explorer.ista.ac.at/record/5449
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.
LibreCat: https://research-explorer.ista.ac.at/record/5453
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.
LibreCat: https://research-explorer.ista.ac.at/record/5451
DOI: 10.15479/AT:IST-2016-728-v1-1

Hilbe, Christian, et al. Experimental Game Instructions. Public Library of Science, 2016, doi:10.1371/journal.pone.0163867.s008.
LibreCat: https://research-explorer.ista.ac.at/record/9867
DOI: 10.1371/journal.pone.0163867.s008

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.
LibreCat: https://research-explorer.ista.ac.at/record/1322
DOI: 10.1371/journal.pone.0163867

Hilbe, Christian, et al. Experimental Data. Public Library of Science, 2016, doi:10.1371/journal.pone.0163867.s009.
LibreCat: https://research-explorer.ista.ac.at/record/9868
DOI: 10.1371/journal.pone.0163867.s009

Chmelik, Martin. Algorithms for Partially Observable Markov Decision Processes. Institute of Science and Technology Austria, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1397

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.
LibreCat: https://research-explorer.ista.ac.at/record/1093
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.
LibreCat: https://research-explorer.ista.ac.at/record/1071
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.
LibreCat: https://research-explorer.ista.ac.at/record/1438
DOI: 10.1145/2837614.2837639
arXiv: 1510.08517

Pavlogiannis, Andreas, et al. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016, doi:10.15479/AT:IST-2017-728-v2-1.
LibreCat: https://research-explorer.ista.ac.at/record/5452
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.
LibreCat: https://research-explorer.ista.ac.at/record/1437
DOI: 10.1145/2837614.2837624
arXiv: 1510.07565

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.
LibreCat: https://research-explorer.ista.ac.at/record/1386
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.
LibreCat: https://research-explorer.ista.ac.at/record/10796
DOI: 10.1137/1.9781611973730.69
arXiv: 1409.6690

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.
LibreCat: https://research-explorer.ista.ac.at/record/1499
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.
LibreCat: https://research-explorer.ista.ac.at/record/1559
DOI: 10.1073/pnas.1511366112
PMID: 26644569

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.
LibreCat: https://research-explorer.ista.ac.at/record/1594
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.
LibreCat: https://research-explorer.ista.ac.at/record/1601
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.
LibreCat: https://research-explorer.ista.ac.at/record/1609
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.
LibreCat: https://research-explorer.ista.ac.at/record/1624
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.
LibreCat: https://research-explorer.ista.ac.at/record/1660
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.
LibreCat: https://research-explorer.ista.ac.at/record/1665
DOI: 10.1038/nature15395
PMID: 26466571

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.
LibreCat: https://research-explorer.ista.ac.at/record/1667
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.
LibreCat: https://research-explorer.ista.ac.at/record/1673
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.
LibreCat: https://research-explorer.ista.ac.at/record/1691
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.
LibreCat: https://research-explorer.ista.ac.at/record/1694
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.
LibreCat: https://research-explorer.ista.ac.at/record/1698
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.
LibreCat: https://research-explorer.ista.ac.at/record/1820
arXiv: 1411.3880

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.
LibreCat: https://research-explorer.ista.ac.at/record/1838
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.
LibreCat: https://research-explorer.ista.ac.at/record/1839
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.
LibreCat: https://research-explorer.ista.ac.at/record/1846
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.
LibreCat: https://research-explorer.ista.ac.at/record/1851
DOI: 10.1111/evo.12618
PMID: 25662095

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.
LibreCat: https://research-explorer.ista.ac.at/record/1873
DOI: 10.1016/j.artint.2014.12.009
arXiv: 1408.2058

Fahrenberg, Uli, et al. Compositionality for Quantitative Specifications. Vol. 8997, Springer, 2015, pp. 306–24, doi:10.1007/978-3-319-15317-9_19.
LibreCat: https://research-explorer.ista.ac.at/record/1882
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.
LibreCat: https://research-explorer.ista.ac.at/record/2034
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.
LibreCat: https://research-explorer.ista.ac.at/record/1598
DOI: 10.1016/j.tcs.2015.01.050
arXiv: 1202.4175

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.
LibreCat: https://research-explorer.ista.ac.at/record/1731
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.
LibreCat: https://research-explorer.ista.ac.at/record/1856
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.
LibreCat: https://research-explorer.ista.ac.at/record/1661
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.
LibreCat: https://research-explorer.ista.ac.at/record/523
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.
LibreCat: https://research-explorer.ista.ac.at/record/524
DOI: 10.1016/j.ic.2015.03.009
arXiv: 1409.5306

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.
LibreCat: https://research-explorer.ista.ac.at/record/1481

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.
LibreCat: https://research-explorer.ista.ac.at/record/1732
DOI: 10.1109/ICRA.2015.7139019
arXiv: 1409.3360

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.
LibreCat: https://research-explorer.ista.ac.at/record/5431
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.
LibreCat: https://research-explorer.ista.ac.at/record/1657
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.
LibreCat: https://research-explorer.ista.ac.at/record/1656
DOI: 10.1109/LICS.2015.72
arXiv: 1606.03598

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.
LibreCat: https://research-explorer.ista.ac.at/record/5429
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.
LibreCat: https://research-explorer.ista.ac.at/record/5435
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.
LibreCat: https://research-explorer.ista.ac.at/record/5436
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.
LibreCat: https://research-explorer.ista.ac.at/record/1610
DOI: 10.1007/978-3-662-47666-6_10
arXiv: 1504.08259

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.
LibreCat: https://research-explorer.ista.ac.at/record/5437
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.
LibreCat: https://research-explorer.ista.ac.at/record/5430
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.
LibreCat: https://research-explorer.ista.ac.at/record/5438
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.
LibreCat: https://research-explorer.ista.ac.at/record/5440
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.
LibreCat: https://research-explorer.ista.ac.at/record/5432
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.
LibreCat: https://research-explorer.ista.ac.at/record/5444
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.
LibreCat: https://research-explorer.ista.ac.at/record/5443
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.
LibreCat: https://research-explorer.ista.ac.at/record/1709
DOI: 10.1098/rspb.2015.1041
PMID: 26180069

Reiter, Johannes. The Subclonal Evolution of Cancer. Institute of Science and Technology Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1400

Benes, Nikola, et al. Complete Composition Operators for IOCO-Testing Theory. ACM, 2015, pp. 101–10, doi:10.1145/2737166.2737175.
LibreCat: https://research-explorer.ista.ac.at/record/1502
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.
LibreCat: https://research-explorer.ista.ac.at/record/1501
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.
LibreCat: https://research-explorer.ista.ac.at/record/1602
DOI: 10.1145/2676726.2676979
arXiv: 1410.7724

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.
LibreCat: https://research-explorer.ista.ac.at/record/1604
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.
LibreCat: https://research-explorer.ista.ac.at/record/1607
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.
LibreCat: https://research-explorer.ista.ac.at/record/1714
DOI: 10.1109/RTSS.2014.9