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

Novel putative driver gene mutations in chronic lymphocytic leukemia (CLL): results from a combined analysis of whole exome sequencing of 262 primary CLL aamples
D. Landau, C. Stewart, J. Reiter, M. Lawrence, C. Sougnez, J. Brown, A. Lopez Guillermo, S. Gabriel, E. Lander, D. Neuberg, C. López Otín, E. Campo, G. Getz, C. Wu, Blood 124 (2014) 1952–1952.
LibreCat: https://research-explorer.ista.ac.at/record/1884

Verification of markov decision processes using learning algorithms
T. Brázdil, K. Chatterjee, M. Chmelik, V. Forejt, J. Kretinsky, M. Kwiatkowska, D. Parker, M. Ujma, in:, F. Cassez, J.-F. Raskin (Eds.),  Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Society of Industrial and Applied Mathematics, 2014, pp. 98–114.
LibreCat: https://research-explorer.ista.ac.at/record/2027
DOI: 10.1007/978-3-319-11936-6_8

Probabilistic bisimulation: Naturally on distributions
H. Hermanns, J. Krdál, J. Kretinsky, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–265.
LibreCat: https://research-explorer.ista.ac.at/record/2053
DOI: 10.1007/978-3-662-44584-6_18

Parameterized model checking of rendezvous systems
B. Aminof, T. Kotek, S. Rubin, F. Spegni, H. Veith, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 109–124.
LibreCat: https://research-explorer.ista.ac.at/record/2052
DOI: 10.1007/978-3-662-44584-6_9

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

From LTL to deterministic automata: A safraless compositional approach
J. Esparza, J. Kretinsky, in:, Springer, 2014, pp. 192–208.
LibreCat: https://research-explorer.ista.ac.at/record/2190
DOI: 10.1007/978-3-319-08867-9_13

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

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

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

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

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

Qualitative concurrent parity games: Bounded rationality
K. Chatterjee, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–559.
LibreCat: https://research-explorer.ista.ac.at/record/2054
DOI: 10.1007/978-3-662-44584-6_37

First cycle games
B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.
LibreCat: https://research-explorer.ista.ac.at/record/475
DOI: 10.4204/EPTCS.146.11

Partial-observation stochastic reachability and parity games
K. Chatterjee, in:, Springer, 2014, pp. 1–4.
LibreCat: https://research-explorer.ista.ac.at/record/1903
DOI: 10.1007/978-3-662-44522-8_1

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

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

The complexity of ergodic mean payoff games
K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.
LibreCat: https://research-explorer.ista.ac.at/record/2162
DOI: 10.1007/978-3-662-43951-7_11
arXiv: 1404.5734

The complexity of partial-observation stochastic parity games with finite-memory strategies
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, in:, Springer, 2014, pp. 242–257.
LibreCat: https://research-explorer.ista.ac.at/record/2213
DOI: 10.1007/978-3-642-54830-7_16
arXiv: 1401.3289

Perfect-information stochastic mean-payoff parity games
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, in:, Springer, 2014, pp. 210–225.
LibreCat: https://research-explorer.ista.ac.at/record/2212
DOI: 10.1007/978-3-642-54830-7_14

Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312.
LibreCat: https://research-explorer.ista.ac.at/record/2216
DOI: 10.1145/2562059.2562141

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

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

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

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

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

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

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

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

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

A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks
K. Chatterjee, A. Kössler, A. Pavlogiannis, U. Schmid, A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks, IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5423
DOI: 10.15479/AT:IST-2014-300-v1-1

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

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

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

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

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

Detailed proofs for cThe time scale of evolutionary innovationd
K. Chatterjee, A. Pavlogiannis, B. Adlam, M. Novak, (2014).
LibreCat: https://research-explorer.ista.ac.at/record/9739
DOI: 10.1371/journal.pcbi.1003818.s001

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

CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, M. Chmelik, P. Daca, in:, Springer, 2014, pp. 473–490.
LibreCat: https://research-explorer.ista.ac.at/record/2063
DOI: 10.1007/978-3-319-08867-9_31

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

Infinite-state games with finitary conditions
K. Chatterjee, N. Fijalkow, in:, 22nd EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–196.
LibreCat: https://research-explorer.ista.ac.at/record/1374
DOI: 10.4230/LIPIcs.CSL.2013.181

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

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

Synthesis of AMBA AHB from formal specification: A case study
Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601.
LibreCat: https://research-explorer.ista.ac.at/record/2299
DOI: 10.1007/s10009-011-0207-9

Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis
K. Chatterjee, A. Gaiser, J. Kretinsky, 8044 (2013) 559–575.
LibreCat: https://research-explorer.ista.ac.at/record/2446
DOI: 10.1007/978-3-642-39799-8_37
arXiv: 1304.5281

Faster algorithms for Markov decision processes with low treewidth
K. Chatterjee, J. aCki, 8044 (2013) 543–558.
LibreCat: https://research-explorer.ista.ac.at/record/2444
DOI: 10.1007/978-3-642-39799-8_36
arXiv: 1304.0084

The complexity of coverage
K. Chatterjee, L. Alfaro, R. Majumdar, International Journal of Foundations of Computer Science 24 (2013) 165–185.
LibreCat: https://research-explorer.ista.ac.at/record/2814
DOI: 10.1142/S0129054113400066
arXiv: 0804.4525

Density games
S. Novak, K. Chatterjee, M. Nowak, Journal of Theoretical Biology 334 (2013) 26–34.
LibreCat: https://research-explorer.ista.ac.at/record/2817
DOI: 10.1016/j.jtbi.2013.05.029

Quantitative timed simulation functions and refinement metrics for real-time systems
K. Chatterjee, V. Prabhu, in:, Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, Springer, 2013, pp. 273–282.
LibreCat: https://research-explorer.ista.ac.at/record/2819
DOI: 10.1145/2461328.2461370

Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems
K. Chatterjee, V. Prabhu, Information and Computation 228–229 (2013) 83–119.
LibreCat: https://research-explorer.ista.ac.at/record/2824
DOI: 10.1016/j.ic.2013.04.003

Assume-guarantee synthesis for digital contract signing
K. Chatterjee, V. Raman, Formal Aspects of Computing 26 (2013) 825–859.
LibreCat: https://research-explorer.ista.ac.at/record/2836
DOI: 10.1007/s00165-013-0283-6
arXiv: 1004.2697

Strategy improvement for concurrent reachability and turn based stochastic safety games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, Journal of Computer and System Sciences 79 (2013) 640–657.
LibreCat: https://research-explorer.ista.ac.at/record/2854
DOI: 10.1016/j.jcss.2012.12.001

Controllable-choice message sequence graphs
M. Chmelik, V. ehák, 7721 (2013) 118–130.
LibreCat: https://research-explorer.ista.ac.at/record/2886
DOI: 10.1007/978-3-642-36046-6_12

Code aware resource management
K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, V. Raman, Formal Methods in System Design 42 (2013) 142–174.
LibreCat: https://research-explorer.ista.ac.at/record/3116
DOI: 10.1007/s10703-012-0170-4

Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
K. Chatterjee, M.H. Henzinger, M. Joglekar, N. Shah, Formal Methods in System Design 42 (2013) 301–327.
LibreCat: https://research-explorer.ista.ac.at/record/2831
DOI: 10.1007/s10703-012-0180-2
arXiv: 1104.3348

Looking at mean-payoff and total-payoff through windows
K. Chatterjee, L. Doyen, M. Randour, J. Raskin, 8172 (2013) 118–132.
LibreCat: https://research-explorer.ista.ac.at/record/2279
DOI: 10.1007/978-3-319-02444-8_10

TTP: Tool for Tumor Progression
J. Reiter, I. Bozic, K. Chatterjee, M. Nowak, TTP: Tool for Tumor Progression, IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5399
DOI: 10.15479/AT:IST-2013-104-v1-1

What is decidable about partially observable Markov decision processes with omega-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, 23 (2013) 165–180.
LibreCat: https://research-explorer.ista.ac.at/record/2295
DOI: 10.4230/LIPIcs.CSL.2013.165

Qualitative analysis of concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff Games, IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5403
DOI: 10.15479/AT:IST-2013-126-v1-1

What is decidable about partially observable Markov decision processes with <9-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, What Is Decidable about Partially Observable Markov Decision Processes with <9-Regular Objectives, IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5400
DOI: 10.15479/AT:IST-2013-109-v1-1

The complexity of ergodic games
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5404
DOI: 10.15479/AT:IST-2013-127-v1-1

Perfect-information stochastic mean-payoff parity games
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic Mean-Payoff Parity Games, IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5405
DOI: 10.15479/AT:IST-2013-128-v1-1

Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata, IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5409
DOI: 10.15479/AT:IST-2013-144-v1-1

Distributed synthesis for LTL fragments
K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, in:, 13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25.
LibreCat: https://research-explorer.ista.ac.at/record/1376
DOI: 10.1109/FMCAD.2013.6679386

Distributed synthesis for LTL Fragments
K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis for LTL Fragments, IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5406
DOI: 10.15479/AT:IST-2013-130-v1-1

The complexity of partial-observation stochastic parity games with finite-memory strategies
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5408
DOI: 10.15479/AT:IST-2013-141-v1-1

Automatic generation of alternative starting positions for traditional board games
U. Ahmed, K. Chatterjee, S. Gulwani, Automatic Generation of Alternative Starting Positions for Traditional Board Games, IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5410
DOI: 10.15479/AT:IST-2013-146-v1-1

Hyperplane separation technique for multidimensional mean-payoff games
K. Chatterjee, Y. Velner, 8052 (2013) 500–515.
LibreCat: https://research-explorer.ista.ac.at/record/2329
DOI: 10.1007/978-3-642-40184-8_35
arXiv: 1210.3141

Forgiver triumphs in alternating prisoner's dilemma 
B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, (2013).
LibreCat: https://research-explorer.ista.ac.at/record/9749
DOI: 10.1371/journal.pone.0080814.s001

How to travel between languages
K. Chatterjee, S. Chaubal, S. Rubin, in:, 7th International Conference on Language and Automata Theory and Applications, Springer Nature, Berlin, Heidelberg, 2013, pp. 214–225.
LibreCat: https://research-explorer.ista.ac.at/record/10902
DOI: 10.1007/978-3-642-37064-9_20

Forgiver triumphs in alternating prisoner's dilemma 
B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, PLoS One 8 (2013).
LibreCat: https://research-explorer.ista.ac.at/record/2247
DOI: 10.1371/journal.pone.0080814

The effect of one additional driver mutation on tumor progression
J. Reiter, I. Boei, B. Allen, K. Chatterjee, M. Nowak, Evolutionary Applications 6 (2013) 34–45.
LibreCat: https://research-explorer.ista.ac.at/record/2858
DOI: 10.1111/eva.12020

Evolutionary dynamics of cancer in response to targeted combination therapy
I. Boei, J. Reiter, B. Allen, T. Antal, K. Chatterjee, P. Shah, Y. Moon, A. Yaqubie, N. Kelly, D. Le, E. Lipson, P. Chapman, L. Diaz, B. Vogelstein, M. Nowak, ELife 2 (2013).
LibreCat: https://research-explorer.ista.ac.at/record/2816
DOI: 10.7554/eLife.00747

TTP: Tool for tumor progression
J. Reiter, I. Boei, K. Chatterjee, M. Nowak, in:, Proceedings of 25th Int. Conf. on Computer Aided Verification, Springer, 2013, pp. 101–106.
LibreCat: https://research-explorer.ista.ac.at/record/2000
DOI: 10.1007/978-3-642-39799-8_6
arXiv: 1303.5251

Trading performance for stability in Markov decision processes
T. Brázdil, K. Chatterjee, V. Forejt, A. Kudera, in:, 28th Annual ACM/IEEE Symposium, IEEE, 2013, pp. 331–340.
LibreCat: https://research-explorer.ista.ac.at/record/2305
DOI: 10.1109/LICS.2013.39
arXiv: 1305.4103

Automated analysis of real-time scheduling using graph games
K. Chatterjee, A. Kößler, U. Schmid, in:, Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, ACM, 2013, pp. 163–172.
LibreCat: https://research-explorer.ista.ac.at/record/2820
DOI: 10.1145/2461328.2461356

Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
K. Chatterjee, M. Joglekar, N. Shah, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 461–473.
LibreCat: https://research-explorer.ista.ac.at/record/2715
DOI: 10.4230/LIPIcs.FSTTCS.2012.461

Strategy synthesis for multi-dimensional quantitative objectives
K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131.
LibreCat: https://research-explorer.ista.ac.at/record/10904
DOI: 10.1007/978-3-642-32940-1_10
arXiv: 1201.5073

Evolutionary game dynamics in populations with different learners
K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301 (2012) 161–173.
LibreCat: https://research-explorer.ista.ac.at/record/2848
DOI: 10.1016/j.jtbi.2012.02.021
PMID: 22394652

Interface Simulation Distances
P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.
LibreCat: https://research-explorer.ista.ac.at/record/2916
DOI: 10.4204/EPTCS.96.3
arXiv: 1210.2450

Finite automata with time delay blocks
K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52.
LibreCat: https://research-explorer.ista.ac.at/record/2936
DOI: 10.1145/2380356.2380370

Equivalence of games with probabilistic uncertainty and partial observation games
K. Chatterjee, M. Chmelik, R. Majumdar, in:, Springer, 2012, pp. 385–399.
LibreCat: https://research-explorer.ista.ac.at/record/2947
DOI: 10.1007/978-3-642-33386-6_30

Efficient controller synthesis for consumption games with multiple resource types
B. Brázdil, K. Chatterjee, A. Kudera, P. Novotný, in:, Springer, 2012, pp. 23–38.
LibreCat: https://research-explorer.ista.ac.at/record/3135
DOI: 10.1007/978-3-642-31424-7_8

Synthesizing protocols for digital contract signing
K. Chatterjee, V. Raman, in:, Springer, 2012, pp. 152–168.
LibreCat: https://research-explorer.ista.ac.at/record/3252
DOI: 10.1007/978-3-642-27940-9_11

Games and Markov decision processes with mean payoff parity and energy parity objectives
K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46.
LibreCat: https://research-explorer.ista.ac.at/record/3255
DOI: 10.1007/978-3-642-25929-6_3

The complexity of stochastic Müller games
K. Chatterjee, Information and Computation 211 (2012) 29–48.
LibreCat: https://research-explorer.ista.ac.at/record/3254
DOI: 10.1016/j.ic.2011.11.004

Discounting and averaging in games across time scales
K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer Science 23 (2012) 609–625.
LibreCat: https://research-explorer.ista.ac.at/record/3314
DOI: 10.1142/S0129054112400308

A survey of stochastic <9 regular games
K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413.
LibreCat: https://research-explorer.ista.ac.at/record/3846
DOI: 10.1016/j.jcss.2011.05.002

A survey of partial-observation stochastic parity games
K. Chatterjee, L. Doyen, T.A. Henzinger, Formal Methods in System Design 43 (2012) 268–284.
LibreCat: https://research-explorer.ista.ac.at/record/3128
DOI: 10.1007/s10703-012-0164-2

Energy parity games
K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60.
LibreCat: https://research-explorer.ista.ac.at/record/2972
DOI: 10.1016/j.tcs.2012.07.038
arXiv: 1001.5183

A Myhill Nerode theorem for automata with advice
A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.
LibreCat: https://research-explorer.ista.ac.at/record/495
DOI: 10.4204/EPTCS.96.18

Interpretations in trees with countably many branches
A. Rabinovich, S. Rubin, in:, IEEE, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/496
DOI: 10.1109/LICS.2012.65

Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182.
LibreCat: https://research-explorer.ista.ac.at/record/497
DOI: 10.4230/LIPIcs.CSL.2012.167

An O(n2) time algorithm for alternating Büchi games
K. Chatterjee, M.H. Henzinger, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–1399.
LibreCat: https://research-explorer.ista.ac.at/record/3165
DOI: 10.1137/1.9781611973099.109
arXiv: 1109.5018

Mean payoff pushdown games
K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2956
DOI: 10.1109/LICS.2012.30

Mean-payoff pushdown games
K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/5377
DOI: 10.15479/AT:IST-2012-0002

Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/5378
DOI: 10.15479/AT:IST-2012-0001

Partial-observation stochastic games: How to win when belief fails
K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2955
DOI: 10.1109/LICS.2012.28
arXiv: 1107.2141

Robustness of structurally equivalent concurrent parity games
K. Chatterjee, in:, Springer, 2012, pp. 270–285.
LibreCat: https://research-explorer.ista.ac.at/record/3341
DOI: 10.1007/978-3-642-28729-9_18
arXiv: 1107.2009

Decidable problems for probabilistic automata on infinite words
K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2957
DOI: 10.1109/LICS.2012.29
arXiv: 1107.2091