Chatterjee K, Velner Y. The complexity of mean-payoff pushdown games. Journal of the ACM. 2017;64(5):34. doi:10.1145/3121408
LibreCat: https://research-explorer.ista.ac.at/record/716
DOI: 10.1145/3121408
arXiv: 1201.2829

Chatterjee K, Velner Y. Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. 2017;88:236-259. doi:10.1016/j.jcss.2017.04.005
LibreCat: https://research-explorer.ista.ac.at/record/717
DOI: 10.1016/j.jcss.2017.04.005

Chatterjee K, Ehlers R. Special issue: Synthesis and SYNT 2014. Acta Informatica. 2017;54(6):543-544. doi:10.1007/s00236-017-0299-0
LibreCat: https://research-explorer.ista.ac.at/record/719
DOI: 10.1007/s00236-017-0299-0

Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record for transforming Rabin automata into parity automata. In: Tools and Algorithms for the Construction and Analysis of Systems. Vol 10205. Springer; 2017:443-460. doi:10.1007/978-3-662-54577-5_26
LibreCat: https://research-explorer.ista.ac.at/record/13160
DOI: 10.1007/978-3-662-54577-5_26
arXiv: 1701.05738

Avni G, Henzinger TA, Chonev VK. Infinite-duration bidding games. In: Vol 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.CONCUR.2017.21
LibreCat: https://research-explorer.ista.ac.at/record/950
DOI: 10.4230/LIPIcs.CONCUR.2017.21
arXiv: 1705.01433

Pavlogiannis A. Algorithmic advances in program analysis and their applications. 2017. doi:10.15479/AT:ISTA:th_854
LibreCat: https://research-explorer.ista.ac.at/record/821
DOI: 10.15479/AT:ISTA:th_854

Svoreová M, Kretinsky J, Chmelik M, Chatterjee K, Cbrná I, Belta C. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 2017;23(2):230-253. doi:10.1016/j.nahs.2016.04.006
LibreCat: https://research-explorer.ista.ac.at/record/1407
DOI: 10.1016/j.nahs.2016.04.006
WoS: 000390637000014
arXiv: 1410.5387

Brázdil T, Chatterjee K, Forejt V, Kudera A. Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. 2017;84:144-170. doi:10.1016/j.jcss.2016.09.009
LibreCat: https://research-explorer.ista.ac.at/record/1294
DOI: 10.1016/j.jcss.2016.09.009
WoS: 000388430000011

Reiter J, Makohon Moore A, Gerold J, et al. Reconstructing metastatic seeding patterns of human cancers. Nature Communications. 2017;8. doi:10.1038/ncomms14114
LibreCat: https://research-explorer.ista.ac.at/record/1080
DOI: 10.1038/ncomms14114
WoS: 000393096600001

Chatterjee K, Osang GF. Pushdown reachability with constant treewidth. Information Processing Letters. 2017;122:25-29. doi:10.1016/j.ipl.2017.02.003
LibreCat: https://research-explorer.ista.ac.at/record/1065
DOI: 10.1016/j.ipl.2017.02.003
WoS: 000399506600005

Chatterjee K, Henzinger TA, Otop J, Velner Y. Quantitative fair simulation games. Information and Computation. 2017;254(2):143-166. 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 K, Kragl B, Mishra S, Pavlogiannis A. Faster algorithms for weighted recursive state machines. In: Yang H, ed. Vol 10201. Springer; 2017: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 K, Novotný P, Pérez G, Raskin J, Zikelic D. Optimizing expectation with guarantees in POMDPs. In: Proceedings of the 31st AAAI Conference on Artificial Intelligence. Vol 5. AAAI Press; 2017:3725-3732.
LibreCat: https://research-explorer.ista.ac.at/record/1009
WoS: 000485630703107

Priklopil T, Chatterjee K, Nowak M. Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. 10.1016/j.jtbi.2017.08.025__Journal of Theoretical Biology. 2017;433: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 K, Novotný P, Zikelic D. Stochastic invariants for probabilistic termination. In: Vol 52. ACM; 2017:145-160. doi:10.1145/3009837.3009873
LibreCat: https://research-explorer.ista.ac.at/record/1194
DOI: 10.1145/3009837.3009873
WoS: 000408311200013

Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak10.15479/AT:ISTA:51__M. Strong amplifiers of natural selection. 2017. doi:10.15479/AT:ISTA:51
LibreCat: https://research-explorer.ista.ac.at/record/5559
DOI: 10.15479/AT:ISTA:51

Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst case analysis of recursive programs. In: Majumdar R, Kundak V, eds. Vol 10427. Springer; 2017: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 K, Goharshady AK, Pavlogiannis A. JTDec: A tool for tree decompositions in soot. In: D’Souza D, ed. Vol 10482. Springer; 2017: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 K, Dvorák W, Henzinger MH, Loitzenbauer V. Conditionally optimal algorithms for generalized Büchi Games. In: Vol 58. 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 VK, Ouaknine J, Worrell J. On the skolem problem for continuous linear dynamical systems. In: Vol 55. 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 K, Doyen L. Computation tree logic for synchronization properties. In: Vol 55. 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 K, Henzinger TA, Otop J. Nested weighted limit-average automata of bounded width. In: Vol 58. 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 K, Henzinger TA, Otop J. Quantitative automata under probabilistic semantics. In: Proceedings of the 31st Annual ACM/IEEE Symposium. IEEE; 2016: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 K, Dvoák W, Henzinger MH, Loitzenbauer V. Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2016: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 K, Ibsen-Jensen R, Tkadlec J. Robust draws in balanced knockout tournaments. In: Vol 2016-January. AAAI Press; 2016:172-179.
LibreCat: https://research-explorer.ista.ac.at/record/1182

Hilbe C, Traulsen A. 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”10.1016/j.plrev.2016.10.004__by C. Adami, J. Schossau and A. Hintze. Physics of Life Reviews. 2016;19: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 V, Chatterjee K. Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In: Proceedings of the ACM Conference on Computer Supported Cooperative Work. Vol 26. ACM; 2016:365-368. doi:10.1145/2818052.2869122
LibreCat: https://research-explorer.ista.ac.at/record/1245
DOI: 10.1145/2818052.2869122

Brázdil T, Forejt V, Kudera A, Novotný P. Stability in graphs and games. In: Vol 59. 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 K, Chmelik M. Indefinite-horizon reachability in Goal-DEC-POMDPs. In: Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. Vol 2016-January. AAAI Press; 2016:88-96.
LibreCat: https://research-explorer.ista.ac.at/record/1324

Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotný P. Stochastic shortest path with energy constraints in POMDPs. In: Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. ACM; 2016:1465-1466.
LibreCat: https://research-explorer.ista.ac.at/record/1327

Brázdil T, Kudera A, Novotný P. Optimizing the expected mean payoff in Energy Markov Decision Processes. In: Vol 9938. Springer; 2016: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 M, Hilbe C, Semmann D, Sommerfeld R, Marotzke J. Humans choose representatives who enforce cooperation in social dilemmas through extortion. Nature Communications. 2016;7. doi:10.1038/ncomms10915
LibreCat: https://research-explorer.ista.ac.at/record/1333
DOI: 10.1038/ncomms10915

Chatterjee K, Henzinger TA, Otop J. Quantitative monitor automata. In: Vol 9837. Springer; 2016: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 K, Ibsen-Jensen R, Koucký M. The big match in small space. In: Vol 9928. Springer; 2016: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 VK, Ouaknine J, Worrell J. On the complexity of the orbit problem. Journal of the ACM. 2016;63(3). doi:10.1145/2857050
LibreCat: https://research-explorer.ista.ac.at/record/1380
DOI: 10.1145/2857050

Chonev VK, Ouaknine J, Worrell J. On recurrent reachability for continuous linear dynamical systems. In: LICS ’16. IEEE; 2016:515-524. doi:10.1145/2933575.2934548
LibreCat: https://research-explorer.ista.ac.at/record/1389
DOI: 10.1145/2933575.2934548

Chakra M, Hilbe C, Traulsen A. Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites. Royal Society Open Science. 2016;3(5). doi:10.1098/rsos.160036
LibreCat: https://research-explorer.ista.ac.at/record/1426
DOI: 10.1098/rsos.160036

Baek S, Jeong H, Hilbe C, Nowak M. Comparing reactive and memory-one strategies of direct reciprocity. Scientific Reports. 2016;6. doi:10.1038/srep25676
LibreCat: https://research-explorer.ista.ac.at/record/1423
DOI: 10.1038/srep25676

Lohse K, Chmelik M, Martin S, Barton NH. Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. 2016;202(2):775-786. doi:10.1534/genetics.115.183814
LibreCat: https://research-explorer.ista.ac.at/record/1518
DOI: 10.1534/genetics.115.183814
PMID: 26715666

Chatterjee K, Ibsen-Jensen R. The complexity of deciding legality of a single step of magic: The gathering. In: Vol 285. IOS Press; 2016:1432-1439. 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 K, Doyen L. Perfect-information stochastic games with generalized mean-payoff objectives. In: Vol 05-08-July-2016. IEEE; 2016:247-256. doi:10.1145/2933575.2934513
LibreCat: https://research-explorer.ista.ac.at/record/480
DOI: 10.1145/2933575.2934513

Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable Markov decision processes with <9-regular objectives. Journal of Computer and System Sciences. 2016;82(5):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 K, Chmelik M, Gupta R, Kanodia A. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 2016;234: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 K, Pavlogiannis A, Velner Y. 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 K, Chmelik M, Davies J. A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. Vol 2016. AAAI Press; 2016:3225-3232.
LibreCat: https://research-explorer.ista.ac.at/record/1166

Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 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 A, Tkadlec J, Chatterjee K, Nowak M. 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 A, Tkadlec J, Chatterjee K, Nowak M. 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 C, Hagel K, Milinski M. Experimental game instructions. 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 C, Hagel K, Milinski M. Asymmetric power boosts extortion in an economic experiment. PLoS One. 2016;11(10). doi:10.1371/journal.pone.0163867
LibreCat: https://research-explorer.ista.ac.at/record/1322
DOI: 10.1371/journal.pone.0163867

Hilbe C, Hagel K, Milinski M. Experimental data. 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 M. Algorithms for partially observable markov decision processes. 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1397

Daca P, Henzinger TA, Kretinsky J, Petrov T. Linear distances between Markov chains. In: Vol 59. 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 K, Ibsen-Jensen R, Pavlogiannis A. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. In: Vol 57. 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 K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. In: Vol 20-22. ACM; 2016:327-342. doi:10.1145/2837614.2837639
LibreCat: https://research-explorer.ista.ac.at/record/1438
DOI: 10.1145/2837614.2837639
arXiv: 1510.08517

Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 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 K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. In: Vol 20-22. ACM; 2016:733-747. doi:10.1145/2837614.2837624
LibreCat: https://research-explorer.ista.ac.at/record/1437
DOI: 10.1145/2837614.2837624
arXiv: 1510.07565

Chatterjee K, Fu H, Goharshady AK. Termination analysis of probabilistic programs through Positivstellensatz’s. In: Vol 9779. Springer; 2016: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 K, Ibsen-Jensen R. The value 1 problem under finite-memory strategies for concurrent mean-payoff games. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2015. SIAM; 2015:1018-1029. 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 J, Larsen K, Laursen S, Srba J. Polynomial time decidability of weighted synchronization under partial observability. In: Vol 42. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:142-154. 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 R, Chatterjee K, Nowak M. Computational complexity of ecological and evolutionary spatial dynamics. PNAS. 2015;112(51):15636-15641. doi:10.1073/pnas.1511366112
LibreCat: https://research-explorer.ista.ac.at/record/1559
DOI: 10.1073/pnas.1511366112
PMID: 26644569

Forejt V, Krdál J, Kretinsky J. Controller synthesis for MDPs and frequency LTL\'47U. In: Vol 9450. Springer; 2015:162-177. 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 T, Blahoudek F, Duret Lutz A, et al. The Hanoi omega-automata format. In: Vol 9206. Springer; 2015:479-486. 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 K, Doyen L, Vardi M. The complexity of synthesis from probabilistic components. In: 42nd International Colloquium. Vol 9135. Springer Nature; 2015:108-120. 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 A, Chatterjee K, Adlam B, Nowak M. Cellular cooperation with shift updating and repulsion. Scientific Reports. 2015;5. doi:10.1038/srep17147
LibreCat: https://research-explorer.ista.ac.at/record/1624
DOI: 10.1038/srep17147

Brázdil T, Kiefer S, Kudera A, Novotný P. Long-run average behaviour of probabilistic vector addition systems. In: IEEE; 2015:44-55. doi:10.1109/LICS.2015.15
LibreCat: https://research-explorer.ista.ac.at/record/1660
DOI: 10.1109/LICS.2015.15

Landau D, Tausch E, Taylor Weiner A, et al. Mutations driving CLL and their evolution in progression and relapse. Nature. 2015;526(7574):525-530. doi:10.1038/nature15395
LibreCat: https://research-explorer.ista.ac.at/record/1665
DOI: 10.1038/nature15395
PMID: 26466571

Brázdil T, Korendiak L, Krdál J, Novotný P, ehák V. Optimizing performance of continuous-time stochastic systems using timeout synthesis. 2015;9259:141-159. 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 B, Chatterjee K, Nowak M. Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 2015;471(2181). doi:10.1098/rspa.2015.0114
LibreCat: https://research-explorer.ista.ac.at/record/1673
DOI: 10.1098/rspa.2015.0114

Svoreová M, Chmelik M, Leahy K, et al. Temporal logic motion planning using POMDPs with parity objectives: Case study paper. In: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. ACM; 2015:233-238. doi:10.1145/2728606.2728617
LibreCat: https://research-explorer.ista.ac.at/record/1691
DOI: 10.1145/2728606.2728617

Chatterjee K, Prabhu V. Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. 2015;60(9):2291-2306. doi:10.1109/TAC.2015.2404612
LibreCat: https://research-explorer.ista.ac.at/record/1694
DOI: 10.1109/TAC.2015.2404612

Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. The complexity of multi-mean-payoff and multi-energy games. Information and Computation. 2015;241(4):177-196. 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 K, Chmelik M, Gupta R, Kanodia A. Optimal cost almost-sure reachability in POMDPs. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence . Vol 5. AAAI Press; 2015:3496-3502.
LibreCat: https://research-explorer.ista.ac.at/record/1820
arXiv: 1411.3880

Bloem R, Chatterjee K, Jacobs S, Könighofer R. Assume-guarantee synthesis for concurrent reactive programs with partial information. In: Vol 9035. Springer; 2015:517-532. 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 T, Chatterjee K, Forejt V, Kudera A. Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. 2015;9035:181-187. 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 N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. Refinement checking on parametric modal transition systems. Acta Informatica. 2015;52(2-3):269-297. doi:10.1007/s00236-015-0215-4
LibreCat: https://research-explorer.ista.ac.at/record/1846
DOI: 10.1007/s00236-015-0215-4

Priklopil T, Kisdi E, Gyllenberg M. Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. 2015;69(4):1015-1026. doi:10.1111/evo.12618
LibreCat: https://research-explorer.ista.ac.at/record/1851
DOI: 10.1111/evo.12618
PMID: 25662095

Chatterjee K, Chmelik M. POMDPs under probabilistic semantics. Artificial Intelligence. 2015;221: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 U, Kretinsky J, Legay A, Traonouez L. Compositionality for quantitative specifications. In: Vol 8997. Springer; 2015:306-324. 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, Chatterjee K, Sznajder N. Probabilistic opacity for Markov decision processes. 10.1016/j.ipl.2014.09.001__Information Processing Letters. 2015;115(1):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 K, Joglekar M, Shah N. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 2015;573(3):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 K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. Information and Computation. 2015;245(12):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 K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 2015;62(1). doi:10.1145/2699430
LibreCat: https://research-explorer.ista.ac.at/record/1856
DOI: 10.1145/2699430

Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for one-pair and k-pair Streett objectives. In: Proceedings - Symposium on Logic in Computer Science. Vol 2015-July. IEEE; 2015. doi:10.1109/LICS.2015.34
LibreCat: https://research-explorer.ista.ac.at/record/1661
DOI: 10.1109/LICS.2015.34

Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff through windows. Information and Computation. 2015;242(6):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 K, Ibsen-Jensen R. Qualitative analysis of concurrent mean payoff games. Information and Computation. 2015;242(6):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 U, Chatterjee K, Gulwani S. Automatic generation of alternative starting positions for simple traditional board games. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. Vol 2. AAAI Press; 2015:745-752.
LibreCat: https://research-explorer.ista.ac.at/record/1481

Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. In: IEEE; 2015:325-330. 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 K, Ibsen-Jensen R, Hansen K. 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 K, Komárková Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. 2015:244-256. doi:10.1109/LICS.2015.32
LibreCat: https://research-explorer.ista.ac.at/record/1657
DOI: 10.1109/LICS.2015.32

Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. In: Proceedings - Symposium on Logic in Computer Science. Vol 2015-July. 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 K, Komarkova Z, Kretinsky J. 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 K, Komarkova Z, Kretinsky J. 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 K, Henzinger TA, Otop J. 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 K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. In: 42nd International Colloquium. Vol 9135. Springer Nature; 2015:121-133. 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 K, Ibsen-Jensen R, Pavlogiannis A. 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 K, Ibsen-Jensen R, Pavlogiannis A. 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 K, Henzinger TA, Ibsen-Jensen R, Otop J. 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 K, Ibsen-Jensen R, Nowak M. 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 K, Ibsen-Jensen R, Nowak M. 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