Ibsen-Jensen R, Chatterjee K, Nowak M. 2015. Computational complexity of ecological and evolutionary spatial dynamics. PNAS. 112(51), 15636–15641.
LibreCat: https://research-explorer.ista.ac.at/record/1559
DOI: 10.1073/pnas.1511366112
PMID: 26644569

Forejt V, Krdál J, Kretinsky J. 2015. Controller synthesis for MDPs and frequency LTL\'47U. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 9450, 162–177.
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, Klein J, Kretinsky J, Mueller D, Parker D, Strejdek J. 2015. The Hanoi omega-automata format. CAV: Computer Aided Verification, LNCS, vol. 9206, 479–486.
LibreCat: https://research-explorer.ista.ac.at/record/1601
DOI: 10.1007/978-3-319-21690-4_31

Chatterjee K, Doyen L, Vardi M. 2015. The complexity of synthesis from probabilistic components. 42nd International Colloquium. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 108–120.
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. 2015. Cellular cooperation with shift updating and repulsion. Scientific Reports. 5, 17147.
LibreCat: https://research-explorer.ista.ac.at/record/1624
DOI: 10.1038/srep17147

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

Landau D, Tausch E, Taylor Weiner A, Stewart C, Reiter J, Bahlo J, Kluth S, Boei I, Lawrence M, Böttcher S, Carter S, Cibulskis K, Mertens D, Sougnez C, Rosenberg M, Hess J, Edelmann J, Kless S, Kneba M, Ritgen M, Fink A, Fischer K, Gabriel S, Lander E, Nowak M, Döhner H, Hallek M, Neuberg D, Getz G, Stilgenbauer S, Wu C. 2015. Mutations driving CLL and their evolution in progression and relapse. Nature. 526(7574), 525–530.
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. 2015. Optimizing performance of continuous-time stochastic systems using timeout synthesis. 9259, 141–159.
LibreCat: https://research-explorer.ista.ac.at/record/1667
DOI: 10.1007/978-3-319-22264-6_10

Adlam B, Chatterjee K, Nowak M. 2015. Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 471(2181), 20150114.
LibreCat: https://research-explorer.ista.ac.at/record/1673
DOI: 10.1098/rspa.2015.0114

Svoreová M, Chmelik M, Leahy K, Eniser H, Chatterjee K, Cbrná I, Belta C. 2015. Temporal logic motion planning using POMDPs with parity objectives: Case study paper. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 233–238.
LibreCat: https://research-explorer.ista.ac.at/record/1691
DOI: 10.1145/2728606.2728617

Chatterjee K, Prabhu V. 2015. Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. 60(9), 2291–2306.
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. 2015. The complexity of multi-mean-payoff and multi-energy games. Information and Computation. 241(4), 177–196.
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. 2015. Optimal cost almost-sure reachability in POMDPs. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence . IAAI: Innovative Applications of Artificial Intelligence, Artifical Intelligence, vol. 5, 3496–3502.
LibreCat: https://research-explorer.ista.ac.at/record/1820
arXiv: 1411.3880

Bloem R, Chatterjee K, Jacobs S, Könighofer R. 2015. Assume-guarantee synthesis for concurrent reactive programs with partial information. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 9035, 517–532.
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. 2015. Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. 9035, 181–187.
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. 2015. Refinement checking on parametric modal transition systems. Acta Informatica. 52(2–3), 269–297.
LibreCat: https://research-explorer.ista.ac.at/record/1846
DOI: 10.1007/s00236-015-0215-4

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

Chatterjee K, Chmelik M. 2015. POMDPs under probabilistic semantics. Artificial Intelligence. 221, 46–72.
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. 2015. Compositionality for quantitative specifications. FACS: Formal Aspects of Component Software, LNCS, vol. 8997, 306–324.
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. 2015. Probabilistic opacity for Markov decision processes.  Information Processing Letters. 115(1), 52–59.
LibreCat: https://research-explorer.ista.ac.at/record/2034
DOI: 10.1016/j.ipl.2014.09.001

Chatterjee K, Joglekar M, Shah N. 2015. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 573(3), 71–89.
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. 2015. Randomness for free. Information and Computation. 245(12), 3–16.
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. 2015. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 62(1), 9.
LibreCat: https://research-explorer.ista.ac.at/record/1856
DOI: 10.1145/2699430

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

Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and total-payoff through windows. Information and Computation. 242(6), 25–52.
LibreCat: https://research-explorer.ista.ac.at/record/523
DOI: 10.1016/j.ic.2015.03.010

Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean payoff games. Information and Computation. 242(6), 2–24.
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. 2015. Automatic generation of alternative starting positions for simple traditional board games. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2, 745–752.
LibreCat: https://research-explorer.ista.ac.at/record/1481

Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. ICRA: International Conference on Robotics and Automation, 325–330.
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. 2015. The patience of concurrent stochastic games with safety and reachability objectives, IST Austria, 25p.
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. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes. , 244–256.
LibreCat: https://research-explorer.ista.ac.at/record/1657
DOI: 10.1109/LICS.2015.32

Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174926.
LibreCat: https://research-explorer.ista.ac.at/record/1656
DOI: 10.1109/LICS.2015.72
arXiv: 1606.03598

Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 41p.
LibreCat: https://research-explorer.ista.ac.at/record/5429
DOI: 10.15479/AT:IST-2015-318-v1-1

Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p.
LibreCat: https://research-explorer.ista.ac.at/record/5435
DOI: 10.15479/AT:IST-2015-318-v2-1

Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria, 29p.
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. 2015. Edit distance for pushdown automata. 42nd International Colloquium. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 121–133.
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. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 27p.
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. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 31p.
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. 2015. Edit distance for pushdown automata, IST Austria, 15p.
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. 2015. The complexity of evolutionary games on graphs, IST Austria, 18p.
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. 2015. The complexity of evolutionary games on graphs, IST Austria, 29p.
LibreCat: https://research-explorer.ista.ac.at/record/5432
DOI: 10.15479/AT:IST-2015-323-v1-1

Reiter J, Makohon-Moore A, Gerold J, Bozic I, Chatterjee K, Iacobuzio-Donahue C, Vogelstein B, Nowak M. 2015. Reconstructing robust phylogenies of metastatic cancers, IST Austria, 25p.
LibreCat: https://research-explorer.ista.ac.at/record/5444
DOI: 10.15479/AT:IST-2015-399-v1-1

Chatterjee K, Chmelik M, Davies J. 2015. A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs, IST Austria, 23p.
LibreCat: https://research-explorer.ista.ac.at/record/5443
DOI: 10.15479/AT:IST-2015-325-v2-1

Reiter J, Kanodia A, Gupta R, Nowak M, Chatterjee K. 2015. Biological auctions with multiple rewards. Proceedings of the Royal Society of London Series B Biological Sciences. 282(1812).
LibreCat: https://research-explorer.ista.ac.at/record/1709
DOI: 10.1098/rspb.2015.1041
PMID: 26180069

Reiter J. 2015. The subclonal evolution of cancer. Institute of Science and Technology Austria.
LibreCat: https://research-explorer.ista.ac.at/record/1400

Benes N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. 2015. Complete composition operators for IOCO-testing theory. CBSE: Component-Based Software Engineering , Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering , , 101–110.
LibreCat: https://research-explorer.ista.ac.at/record/1502
DOI: 10.1145/2737166.2737175

Chatterjee K, Chmelik M, Daca P. 2015. CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. 47(2), 230–264.
LibreCat: https://research-explorer.ista.ac.at/record/1501
DOI: 10.1007/s10703-015-0235-2

Chatterjee K, Ibsen-Jensen R, Pavlogiannis A, Goyal P. 2015. Faster algorithms for algebraic path properties in recursive state machines with constant treewidth. ACM SIGPLAN Notices. 50(1), 97–109.
LibreCat: https://research-explorer.ista.ac.at/record/1602
DOI: 10.1145/2676726.2676979
arXiv: 1410.7724

Chatterjee K, Pavlogiannis A, Velner Y. 2015. Quantitative interprocedural analysis. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . 50(1), 539–551.
LibreCat: https://research-explorer.ista.ac.at/record/1604
DOI: 10.1145/2676726.2676968

Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs. CAV: Computer Aided Verification, LNCS, vol. 9206, 140–157.
LibreCat: https://research-explorer.ista.ac.at/record/1607
DOI: 10.1007/978-3-319-21690-4_9

Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2015. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. Real-Time Systems Symposium. RTSS: Real-Time Systems Symposium vol. 2015, 118–127.
LibreCat: https://research-explorer.ista.ac.at/record/1714
DOI: 10.1109/RTSS.2014.9

Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 24p.
LibreCat: https://research-explorer.ista.ac.at/record/5441
DOI: 10.15479/AT:IST-2015-340-v1-1

Svoreová M, Kretinsky J, Chmelik M, Chatterjee K, Cbrná I, Belta C. 2015. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 259–268.
LibreCat: https://research-explorer.ista.ac.at/record/1689
DOI: 10.1145/2728606.2728608

Priklopil T, Chatterjee K. 2015. Evolution of decisions in population games with sequentially searching individuals. Games. 6(4), 413–437.
LibreCat: https://research-explorer.ista.ac.at/record/1681
DOI: 10.3390/g6040413

Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. 2015. Counterexample explanation by learning small strategies in Markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 9206, 158–177.
LibreCat: https://research-explorer.ista.ac.at/record/1603
DOI: 10.1007/978-3-319-21690-4_10

Fellner A. 2015. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes, Institute of Science and Technology Austria,10.15479/AT:ISTA:28 .
LibreCat: https://research-explorer.ista.ac.at/record/5549
DOI: 10.15479/AT:ISTA:28

Aminof B, Jacobs S, Khalimov A, Rubin S. 2014. Parameterized model checking of token-passing systems. Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 262–281.
LibreCat: https://research-explorer.ista.ac.at/record/10884
DOI: 10.1007/978-3-642-54013-4_15
arXiv: 1311.4425

Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. 2014. Approximating the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.
LibreCat: https://research-explorer.ista.ac.at/record/1375
DOI: 10.1016/j.tcs.2014.06.031
arXiv: 1307.4473

Jha S, Tripakis S, Seshia S, Chatterjee K. 2014. Game theoretic secure localization in wireless sensor networks. IOT: Internet of Things, 85–90.
LibreCat: https://research-explorer.ista.ac.at/record/1853
DOI: 10.1109/IOT.2014.7030120

Landau D, Stewart C, Reiter J, Lawrence M, Sougnez C, Brown J, Lopez Guillermo A, Gabriel S, Lander E, Neuberg D, López Otín C, Campo E, Getz G, Wu C. 2014. 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. 124(21), 1952–1952.
LibreCat: https://research-explorer.ista.ac.at/record/1884

Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of markov decision processes using learning algorithms.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ALENEX: Algorithm Engineering and Experiments, LNCS, vol. 8837, 98–114.
LibreCat: https://research-explorer.ista.ac.at/record/2027
DOI: 10.1007/978-3-319-11936-6_8

Hermanns H, Krdál J, Kretinsky J. 2014. Probabilistic bisimulation: Naturally on distributions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 249–265.
LibreCat: https://research-explorer.ista.ac.at/record/2053
DOI: 10.1007/978-3-662-44584-6_18

Aminof B, Kotek T, Rubin S, Spegni F, Veith H. 2014. Parameterized model checking of rendezvous systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 109–124.
LibreCat: https://research-explorer.ista.ac.at/record/2052
DOI: 10.1007/978-3-662-44584-6_9

Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220.
LibreCat: https://research-explorer.ista.ac.at/record/2187
DOI: 10.1007/s00236-013-0191-5

Esparza J, Kretinsky J. 2014. From LTL to deterministic automata: A safraless compositional approach. CAV: Computer Aided Verification, LNCS, vol. 8559, 192–208.
LibreCat: https://research-explorer.ista.ac.at/record/2190
DOI: 10.1007/978-3-319-08867-9_13

Brázdil T, Broeek V, Chatterjee K, Forejt V, Kudera A. 2014. Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. 10(1).
LibreCat: https://research-explorer.ista.ac.at/record/2234
DOI: 10.2168/LMCS-10(1:13)2014

Grinshpun A, Phalitnonkiat P, Rubin S, Tarfulea A. 2014. Alternating traps in Muller and parity games. Theoretical Computer Science. 521, 73–91.
LibreCat: https://research-explorer.ista.ac.at/record/2246
DOI: 10.1016/j.tcs.2013.11.032

Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163.
LibreCat: https://research-explorer.ista.ac.at/record/2716
DOI: 10.1007/s00236-013-0182-6
arXiv: 1201.5073

Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.
LibreCat: https://research-explorer.ista.ac.at/record/1733
DOI: 10.1016/j.tcs.2014.08.019

Chatterjee K, Henzinger MH. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), .
LibreCat: https://research-explorer.ista.ac.at/record/2141
DOI: 10.1145/2597631

Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 544–559.
LibreCat: https://research-explorer.ista.ac.at/record/2054
DOI: 10.1007/978-3-662-44584-6_37

Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.
LibreCat: https://research-explorer.ista.ac.at/record/475
DOI: 10.4204/EPTCS.146.11

Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4.
LibreCat: https://research-explorer.ista.ac.at/record/1903
DOI: 10.1007/978-3-662-44522-8_1

Chatterjee K, Doyen L. 2014. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). 15(2), 16.
LibreCat: https://research-explorer.ista.ac.at/record/2211
DOI: 10.1145/2579821
arXiv: 1107.2141

Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.
LibreCat: https://research-explorer.ista.ac.at/record/2038
DOI: 10.1145/2629686

Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff games. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573, 122–133.
LibreCat: https://research-explorer.ista.ac.at/record/2162
DOI: 10.1007/978-3-662-43951-7_11
arXiv: 1404.5734

Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 242–257.
LibreCat: https://research-explorer.ista.ac.at/record/2213
DOI: 10.1007/978-3-642-54830-7_16
arXiv: 1401.3289

Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2014. Perfect-information stochastic mean-payoff parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 210–225.
LibreCat: https://research-explorer.ista.ac.at/record/2212
DOI: 10.1007/978-3-642-54830-7_14

Chatterjee K, Ibsen-Jensen R, Majumdar R. 2014. Edit distance for timed automata. HSCC: Hybrid Systems - Computation and Control, 303–312.
LibreCat: https://research-explorer.ista.ac.at/record/2216
DOI: 10.1145/2562059.2562141

Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
LibreCat: https://research-explorer.ista.ac.at/record/5413
DOI: 10.15479/AT:IST-2014-153-v2-2

Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
LibreCat: https://research-explorer.ista.ac.at/record/5414
DOI: 10.15479/AT:IST-2014-153-v3-1

Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p.
LibreCat: https://research-explorer.ista.ac.at/record/5412
DOI: 10.15479/AT:IST-2014-153-v1-1

Chatterjee K, Doyen L. 2014. Games with a weak adversary. Lecture Notes in Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573, 110–121.
LibreCat: https://research-explorer.ista.ac.at/record/2163
DOI: 10.1007/978-3-662-43951-7_10
arXiv: 1404.5453

Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for reachability and shortest path on low tree-width graphs, IST Austria, 34p.
LibreCat: https://research-explorer.ista.ac.at/record/5419
DOI: 10.15479/AT:IST-2014-187-v1-1

Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.
LibreCat: https://research-explorer.ista.ac.at/record/5418
DOI: 10.15479/AT:IST-2014-176-v1-1

Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff games, IST Austria, 49p.
LibreCat: https://research-explorer.ista.ac.at/record/5420
DOI: 10.15479/AT:IST-2014-191-v1-1

Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 12p.
LibreCat: https://research-explorer.ista.ac.at/record/5424
DOI: 10.15479/AT:IST-2014-305-v1-1

Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 10p.
LibreCat: https://research-explorer.ista.ac.at/record/5426
DOI: 10.15479/AT:IST-2014-305-v2-1

Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. 2014. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks, IST Austria, 14p.
LibreCat: https://research-explorer.ista.ac.at/record/5423
DOI: 10.15479/AT:IST-2014-300-v1-1

Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Optimal tree-decomposition balancing and reachability on low treewidth graphs, IST Austria, 24p.
LibreCat: https://research-explorer.ista.ac.at/record/5427
DOI: 10.15479/AT:IST-2014-314-v1-1

Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.
LibreCat: https://research-explorer.ista.ac.at/record/5415
DOI: 10.15479/AT:IST-2014-170-v1-1

Chatterjee K, Ibsen-Jensen R, Nowak M. 2014. The complexity of evolution on graphs, IST Austria, 27p.
LibreCat: https://research-explorer.ista.ac.at/record/5421
DOI: 10.15479/AT:IST-2014-190-v2-2

Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 78–97.
LibreCat: https://research-explorer.ista.ac.at/record/10885
DOI: 10.1007/978-3-642-54013-4_5
arXiv: 1311.3238

Chatterjee K, Pavlogiannis A, Adlam B, Nowak M. 2014. The time scale of evolutionary innovation. PLoS Computational Biology. 10(9), 7p.
LibreCat: https://research-explorer.ista.ac.at/record/2039
DOI: 10.1371/journal.pcbi.1003818

Chatterjee K, Pavlogiannis A, Adlam B, Novak M. 2014. Detailed proofs for “The time scale of evolutionary innovation”, Public Library of Science,10.1371/journal.pcbi.1003818.s001 .
LibreCat: https://research-explorer.ista.ac.at/record/9739
DOI: 10.1371/journal.pcbi.1003818.s001

Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2014. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492.
LibreCat: https://research-explorer.ista.ac.at/record/535
DOI: 10.1007/s00453-013-9843-7
arXiv: 1604.08234

Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490.
LibreCat: https://research-explorer.ista.ac.at/record/2063
DOI: 10.1007/978-3-319-08867-9_31

Chatterjee K, Henzinger TA, Otop J, Velner Y. 2014. Quantitative fair simulation games, IST Austria, 26p.
LibreCat: https://research-explorer.ista.ac.at/record/5428
DOI: 10.15479/AT:IST-2014-315-v1-1

Chatterjee K, Fijalkow N. 2013. Infinite-state games with finitary conditions. 22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23, 181–196.
LibreCat: https://research-explorer.ista.ac.at/record/1374
DOI: 10.4230/LIPIcs.CSL.2013.181

Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward verification in graphs and MDPs. 8312, 228–242.
LibreCat: https://research-explorer.ista.ac.at/record/2238
DOI: 10.1007/978-3-642-45221-5_17

Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.
LibreCat: https://research-explorer.ista.ac.at/record/2292
DOI: 10.1007/978-3-642-40313-2