Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.
LibreCat: https://research-explorer.ista.ac.at/record/3361
DOI: 10.1109/CSF.2011.21

Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.
LibreCat: https://research-explorer.ista.ac.at/record/3357
DOI: 10.1007/978-3-642-21254-3_17

Chatterjee K, Henzinger MH. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p.
LibreCat: https://research-explorer.ista.ac.at/record/5379
DOI: 10.15479/AT:IST-2011-0009

Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p.
LibreCat: https://research-explorer.ista.ac.at/record/5381
DOI: 10.15479/AT:IST-2011-0007

Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.
LibreCat: https://research-explorer.ista.ac.at/record/5380
DOI: 10.15479/AT:IST-2011-0008

Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity games, IST Austria, 18p.
LibreCat: https://research-explorer.ista.ac.at/record/5382
DOI: 10.15479/AT:IST-2011-0006

Chatterjee K. 2011. Bounded rationality in concurrent parity games. arXiv, 1–51, .
LibreCat: https://research-explorer.ista.ac.at/record/3338
arXiv: 1107.2146

Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.
LibreCat: https://research-explorer.ista.ac.at/record/3356
DOI: 10.1109/LICS.2011.33

Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.
LibreCat: https://research-explorer.ista.ac.at/record/5385
DOI: 10.15479/AT:IST-2011-0003

Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.
LibreCat: https://research-explorer.ista.ac.at/record/5384
DOI: 10.15479/AT:IST-2011-0004

Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.
LibreCat: https://research-explorer.ista.ac.at/record/3366
DOI: 10.1007/978-3-642-22110-1_20

Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907, 206–218.
LibreCat: https://research-explorer.ista.ac.at/record/3345
DOI: 10.1007/978-3-642-22993-0_21
arXiv: 1104.2909

Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov decision processes, IST Austria, 20p.
LibreCat: https://research-explorer.ista.ac.at/record/5387
DOI: 10.15479/AT:IST-2011-0001

Chatterjee K, Doyen L. 2010. The complexity of partial-observation parity games. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 1–14.
LibreCat: https://research-explorer.ista.ac.at/record/3858
DOI: 10.1007/978-3-642-16242-8_1

Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.
LibreCat: https://research-explorer.ista.ac.at/record/3856
DOI: 10.1007/978-3-642-15155-2_23

Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p.
LibreCat: https://research-explorer.ista.ac.at/record/3859
DOI: 10.1007/978-3-642-15297-9

Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174, 410–424.
LibreCat: https://research-explorer.ista.ac.at/record/3866
DOI: 10.1007/978-3-642-14295-6_36

Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2010. Algorithms for game metrics. Logical Methods in Computer Science. 6(3), 1–27.
LibreCat: https://research-explorer.ista.ac.at/record/3868
DOI: 10.2168/LMCS-6(3:13)2010

Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.
LibreCat: https://research-explorer.ista.ac.at/record/3853
DOI: 10.1007/978-3-642-15375-4_19

Chatterjee K, Horn F, Löding C. 2010. Obliging games. CONCUR: Concurrency Theory, LNCS, vol. 6269, 284–296.
LibreCat: https://research-explorer.ista.ac.at/record/3854
DOI: 10.1007/978-3-642-15375-4_20

Chatterjee K, Doyen L. 2010. Energy parity games.  ICALP: Automata, Languages and Programming, 37th International Colloquium, LNCS, vol. 6199, 599–610.
LibreCat: https://research-explorer.ista.ac.at/record/3851
DOI: 10.1007/978-3-642-14162-1_50
arXiv: 1001.5183

Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 505–516.
LibreCat: https://research-explorer.ista.ac.at/record/3860
DOI: 10.4230/LIPIcs.FSTTCS.2010.505

Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174, 380–395.
LibreCat: https://research-explorer.ista.ac.at/record/3864
DOI: 10.1007/978-3-642-14295-6_34

Chatterjee K, De Alfaro L, Raman V, Sánchez C. 2010. Analyzing the impact of change in multi-threaded programs. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 293–307.
LibreCat: https://research-explorer.ista.ac.at/record/3865
DOI: 10.1007/978-3-642-12029-9_21

Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy construction for parity games with imperfect information. Information and Computation. 208(10), 1206–1220.
LibreCat: https://research-explorer.ista.ac.at/record/3863
DOI: 10.1016/j.ic.2009.09.006

Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.
LibreCat: https://research-explorer.ista.ac.at/record/3861
DOI: 10.1016/j.ic.2009.07.004

Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.
LibreCat: https://research-explorer.ista.ac.at/record/3867
DOI: 10.2168/LMCS-6(3:10)2010

Cristau J, David C, Horn F. 2010. How do we remember the past in randomised strategies? . Proceedings of GandALF 2010. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 30–39.
LibreCat: https://research-explorer.ista.ac.at/record/489
DOI: 10.4204/EPTCS.25.7

Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.
LibreCat: https://research-explorer.ista.ac.at/record/5388
DOI: 10.15479/AT:IST-2010-0004

Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.
LibreCat: https://research-explorer.ista.ac.at/record/4388
DOI: 10.1007/978-3-642-14295-6_57
arXiv: 1004.2367

Chatterjee K, Fijalkow N. 2010. Topological, automata-theoretic and logical characterization of finitary languages, IST Austria, 21p.
LibreCat: https://research-explorer.ista.ac.at/record/5390
DOI: 10.15479/AT:IST-2010-0002

Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words: decidability and undecidability results. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6252, 1–16.
LibreCat: https://research-explorer.ista.ac.at/record/3857
DOI: 10.1007/978-3-642-15643-4_1

Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 258–269.
LibreCat: https://research-explorer.ista.ac.at/record/3855
DOI: 10.1007/978-3-642-15155-2_24

Chatterjee K, Majumdar R. 2010. Discounting in games across time scales. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 22–29.
LibreCat: https://research-explorer.ista.ac.at/record/3852
DOI: 10.4204/EPTCS.25.6
arXiv: 1006.1403

Chatterjee K, Doyen L, Henzinger TA. 2009. Probabilistic weighted automata. CONCUR: Concurrency Theory, LNCS, vol. 5710, 244–258.
LibreCat: https://research-explorer.ista.ac.at/record/3871
DOI: 10.1007/978-3-642-04081-8_17

Chatterjee K, Henzinger TA, Horn F. 2009. Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). 11(1), 1.
LibreCat: https://research-explorer.ista.ac.at/record/3870
DOI: 10.1145/1614431.1614432

Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata. FCT: Fundamentals of Computation Theory, LNCS, vol. 5699, 3–13.
LibreCat: https://research-explorer.ista.ac.at/record/4542
DOI: 10.1007/978-3-642-03409-1_2

Chatterjee K, Doyen L, Henzinger TA. 2009. A survey of stochastic games with limsup and liminf objectives. ICALP: Automata, Languages and Programming, LNCS, vol. 5556, 1–15.
LibreCat: https://research-explorer.ista.ac.at/record/4545
DOI: 10.1007/978-3-642-02930-1_1

Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734, 34–54.
LibreCat: https://research-explorer.ista.ac.at/record/4543
DOI: 10.1007/978-3-642-03816-7_4

Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. 2009. Better quality in synthesis through quantitative objectives. CAV: Computer Aided Verification, LNCS, vol. 5643, 140–156.
LibreCat: https://research-explorer.ista.ac.at/record/4569
DOI: 10.1007/978-3-642-02658-4_14
arXiv: 0904.2638

Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver for probabilistic games, IST Austria, 12p.
LibreCat: https://research-explorer.ista.ac.at/record/5393
DOI: 10.15479/AT:IST-2009-0003

Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.
LibreCat: https://research-explorer.ista.ac.at/record/5394
DOI: 10.15479/AT:IST-2009-0002

Chatterjee K. 2009. Probabilistic automata on infinite words: Decidability and undecidability results, IST Austria, 17p.
LibreCat: https://research-explorer.ista.ac.at/record/5392
DOI: 10.15479/AT:IST-2009-0004

Chatterjee K, Doyen L, Henzinger TA. 2009. Qualitative analysis of partially-observable Markov decision processes, IST Austria, 20p.
LibreCat: https://research-explorer.ista.ac.at/record/5395
DOI: 10.15479/AT:IST-2009-0001