Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).

Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).

Amplification on undirected population structures: Comets beat stars
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017).

Optimal Dyck reachability for data-dependence and Alias analysis
K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 2 (2017).

Optimal Dyck reachability for data-dependence and alias analysis
K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for Data-Dependence and Alias Analysis, IST Austria, 2017.

Data-centric dynamic partial order reduction
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings of the ACM on Programming Languages 2 (2017).

Data-centric dynamic partial order reduction
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.

Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Faster algorithms for mean-payoff parity games
K. Chatterjee, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Strategy complexity of concurrent safety games
K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

The cost of exactness in quantitative reachability
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381.

Automated recurrence analysis for almost linear expected runtime bounds
K. Chatterjee, H. Fu, A. Murhekar, in:, R. Majumdar, V. Kundak (Eds.), Springer, 2017, pp. 118–139.

Value iteration for long run average reward in markov decision processes
P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kundak (Eds.), Springer, 2017, pp. 201–221.

Improved set-based symbolic algorithms for parity games
K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017.

Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer
A. Makohon Moore, M. Zhang, J. Reiter, I. Boei, B. Allen, D. Kundu, K. Chatterjee, F. Wong, Y. Jiao, Z. Kohutek, J. Hong, M. Attiyeh, B. Javier, L. Wood, R. Hruban, M. Nowak, N. Papadopoulos, K. Kinzler, B. Vogelstein, C. Iacobuzio Donahue, Nature Genetics 49 (2017) 358–366.

Memory-n strategies of direct reciprocity
C. Hilbe, V. Martinez, K. Chatterjee, M. Nowak, PNAS 114 (2017) 4715–4720.

Doomsday equilibria for omega-regular games
K. Chatterjee, L. Doyen, E. Filiot, J. Raskin, Information and Computation 254 (2017) 296–315.

Obligation blackwell games and p-automata
K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452.

The red queen and king in finite populations
C. Veller, L. Hayward, M. Nowak, C. Hilbe, PNAS 114 (2017) 96–05.

Bidirectional nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

The complexity of mean-payoff pushdown games
K. Chatterjee, Y. Velner, Journal of the ACM 64 (2017) 34.

Hyperplane separation technique for multidimensional mean-payoff games
K. Chatterjee, Y. Velner, Journal of Computer and System Sciences 88 (2017) 236–259.

Special issue: Synthesis and SYNT 2014
K. Chatterjee, R. Ehlers, Acta Informatica 54 (2017) 543–544.

Index appearance record for transforming Rabin automata into parity automata
J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, in:, Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2017, pp. 443–460.

Infinite-duration bidding games
G. Avni, T.A. Henzinger, V.K. Chonev, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Algorithmic advances in program analysis and their applications
A. Pavlogiannis, Algorithmic Advances in Program Analysis and Their Applications, Institute of Science and Technology Austria, 2017.

Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
M. Svoreová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cbrná, C. Belta, Nonlinear Analysis: Hybrid Systems 23 (2017) 230–253.

Trading performance for stability in Markov decision processes
T. Brázdil, K. Chatterjee, V. Forejt, A. Kudera, Journal of Computer and System Sciences 84 (2017) 144–170.

Reconstructing metastatic seeding patterns of human cancers
J. Reiter, A. Makohon Moore, J. Gerold, I. Boei, K. Chatterjee, C. Iacobuzio Donahue, B. Vogelstein, M. Nowak, Nature Communications 8 (2017).

Pushdown reachability with constant treewidth
K. Chatterjee, G.F. Osang, Information Processing Letters 122 (2017) 25–29.

Quantitative fair simulation games
K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Information and Computation 254 (2017) 143–166.

Faster algorithms for weighted recursive state machines
K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.), Springer, 2017, pp. 287–313.

Optimizing expectation with guarantees in POMDPs
K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, D. Zikelic, in:, Proceedings of the 31st AAAI Conference on Artificial Intelligence, AAAI Press, 2017, pp. 3725–3732.

Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma
T. Priklopil, K. Chatterjee, M. Nowak,  Journal of Theoretical Biology 433 (2017) 64–72.

Stochastic invariants for probabilistic termination
K. Chatterjee, P. Novotný, D. Zikelic, in:, ACM, 2017, pp. 145–160.

Strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak , (2017).

Non-polynomial worst case analysis of recursive programs
K. Chatterjee, H. Fu, A.K. Goharshady, in:, R. Majumdar, V. Kundak (Eds.), Springer, 2017, pp. 41–63.

JTDec: A tool for tree decompositions in soot
K. Chatterjee, A.K. Goharshady, A. Pavlogiannis, in:, D. D’Souza (Ed.), Springer, 2017, pp. 59–66.

Conditionally optimal algorithms for generalized Büchi Games
K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.

On the skolem problem for continuous linear dynamical systems
V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.

Computation tree logic for synchronization properties
K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.

Nested weighted limit-average automata of bounded width
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.

Quantitative automata under probabilistic semantics
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings of the 31st Annual ACM/IEEE Symposium, IEEE, 2016, pp. 76–85.

Model and objective separation with conditional lower bounds: disjunction is harder than conjunction
K. Chatterjee, W. Dvoák, M.H. Henzinger, V. Loitzenbauer, in:, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206.

Robust draws in balanced knockout tournaments
K. Chatterjee, R. Ibsen-Jensen, J. Tkadlec, in:, AAAI Press, 2016, pp. 172–179.

Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on cEvolutionary game theory using agent-based methodsd by C. Adami, J. Schossau and A. Hintze
C. Hilbe, A. Traulsen, Physics of Life Reviews 19 (2016) 29–31.

Game-theoretic models identify useful principles for peer collaboration in online learning platforms
V. Pandey, K. Chatterjee, in:, Proceedings of the ACM Conference on Computer Supported Cooperative Work, ACM, 2016, pp. 365–368.

Stability in graphs and games
T. Brázdil, V. Forejt, A. Kudera, P. Novotný, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.

Indefinite-horizon reachability in Goal-DEC-POMDPs
K. Chatterjee, M. Chmelik, in:, Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, AAAI Press, 2016, pp. 88–96.

Stochastic shortest path with energy constraints in POMDPs
T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, P. Novotný, in:, Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–1466.

Optimizing the expected mean payoff in Energy Markov Decision Processes
T. Brázdil, A. Kudera, P. Novotný, in:, Springer, 2016, pp. 32–49.

Humans choose representatives who enforce cooperation in social dilemmas through extortion
M. Milinski, C. Hilbe, D. Semmann, R. Sommerfeld, J. Marotzke, Nature Communications 7 (2016).

Quantitative monitor automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Springer, 2016, pp. 23–38.

The big match in small space
K. Hansen, R. Ibsen-Jensen, M. Koucký, in:, Springer, 2016, pp. 64–76.

On the complexity of the orbit problem
V.K. Chonev, J. Ouaknine, J. Worrell, Journal of the ACM 63 (2016).

On recurrent reachability for continuous linear dynamical systems
V.K. Chonev, J. Ouaknine, J. Worrell, in:, LICS ’16, IEEE, 2016, pp. 515–524.

Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites
M. Chakra, C. Hilbe, A. Traulsen, Royal Society Open Science 3 (2016).

Comparing reactive and memory-one strategies of direct reciprocity
S. Baek, H. Jeong, C. Hilbe, M. Nowak, Scientific Reports 6 (2016).

Efficient strategies for calculating blockwise likelihoods under the coalescent
K. Lohse, M. Chmelik, S. Martin, N.H. Barton, Genetics 202 (2016) 775–786.

The complexity of deciding legality of a single step of magic: The gathering
K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.

Perfect-information stochastic games with generalized mean-payoff objectives
K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 247–256.

What is decidable about partially observable Markov decision processes with <9-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, Journal of Computer and System Sciences 82 (2016) 878–911.

Optimal cost almost-sure reachability in POMDPs
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Artificial Intelligence 234 (2016) 26–48.

Quantitative interprocedural analysis
K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis, IST Austria, 2016.

A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps
K. Chatterjee, M. Chmelik, J. Davies, in:, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI Press, 2016, pp. 3225–3232.

Amplification on undirected population structures: Comets beat stars
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected Population Structures: Comets Beat Stars, IST Austria, 2016.

Arbitrarily strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.

Strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of Natural Selection, IST Austria, 2016.

Experimental game instructions
C. Hilbe, K. Hagel, M. Milinski, (2016).

Asymmetric power boosts extortion in an economic experiment
C. Hilbe, K. Hagel, M. Milinski, PLoS One 11 (2016).

Experimental data
C. Hilbe, K. Hagel, M. Milinski, (2016).

Algorithms for partially observable markov decision processes
M. Chmelik, Algorithms for Partially Observable Markov Decision Processes, Institute of Science and Technology Austria, 2016.

Linear distances between Markov chains
P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.

Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.

Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, in:, ACM, 2016, pp. 327–342.

Arbitrarily strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.

Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747.

Termination analysis of probabilistic programs through Positivstellensatz's
K. Chatterjee, H. Fu, A.K. Goharshady, in:, Springer, 2016, pp. 3–22.

The value 1 problem under finite-memory strategies for concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, in:, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2015, pp. 1018–1029.

Polynomial time decidability of weighted synchronization under partial observability
J. Kretinsky, K. Larsen, S. Laursen, J. Srba, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–154.

Computational complexity of ecological and evolutionary spatial dynamics
R. Ibsen-Jensen, K. Chatterjee, M. Nowak, PNAS 112 (2015) 15636–15641.

Controller synthesis for MDPs and frequency LTL\'47U
V. Forejt, J. Krdál, J. Kretinsky, in:, Springer, 2015, pp. 162–177.

The Hanoi omega-automata format
T. Babiak, F. Blahoudek, A. Duret Lutz, J. Klein, J. Kretinsky, D. Mueller, D. Parker, J. Strejdek, in:, Springer, 2015, pp. 479–486.

The complexity of synthesis from probabilistic components
K. Chatterjee, L. Doyen, M. Vardi, in:, 42nd International Colloquium, Springer Nature, 2015, pp. 108–120.

Cellular cooperation with shift updating and repulsion
A. Pavlogiannis, K. Chatterjee, B. Adlam, M. Nowak, Scientific Reports 5 (2015).

Long-run average behaviour of probabilistic vector addition systems
T. Brázdil, S. Kiefer, A. Kudera, P. Novotný, in:, IEEE, 2015, pp. 44–55.

Mutations driving CLL and their evolution in progression and relapse
D. Landau, E. Tausch, A. Taylor Weiner, C. Stewart, J. Reiter, J. Bahlo, S. Kluth, I. Boei, M. Lawrence, S. Böttcher, S. Carter, K. Cibulskis, D. Mertens, C. Sougnez, M. Rosenberg, J. Hess, J. Edelmann, S. Kless, M. Kneba, M. Ritgen, A. Fink, K. Fischer, S. Gabriel, E. Lander, M. Nowak, H. Döhner, M. Hallek, D. Neuberg, G. Getz, S. Stilgenbauer, C. Wu, Nature 526 (2015) 525–530.

Optimizing performance of continuous-time stochastic systems using timeout synthesis
T. Brázdil, L. Korendiak, J. Krdál, P. Novotný, V. ehák, 9259 (2015) 141–159.

Amplifiers of selection
B. Adlam, K. Chatterjee, M. Nowak, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471 (2015).

Temporal logic motion planning using POMDPs with parity objectives: Case study paper
M. Svoreová, M. Chmelik, K. Leahy, H. Eniser, K. Chatterjee, I. Cbrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 233–238.

Quantitative temporal simulation and refinement distances for timed systems
K. Chatterjee, V. Prabhu, IEEE Transactions on Automatic Control 60 (2015) 2291–2306.

The complexity of multi-mean-payoff and multi-energy games
Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A. Rabinovich, J. Raskin, Information and Computation 241 (2015) 177–196.

Optimal cost almost-sure reachability in POMDPs
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , AAAI Press, 2015, pp. 3496–3502.

Assume-guarantee synthesis for concurrent reactive programs with partial information
R. Bloem, K. Chatterjee, S. Jacobs, R. Könighofer, in:, Springer, 2015, pp. 517–532.

Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives
T. Brázdil, K. Chatterjee, V. Forejt, A. Kudera, 9035 (2015) 181–187.

Refinement checking on parametric modal transition systems
N. Benes, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, J. Srba, Acta Informatica 52 (2015) 269–297.

Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating
T. Priklopil, E. Kisdi, M. Gyllenberg, Evolution 69 (2015) 1015–1026.

POMDPs under probabilistic semantics
K. Chatterjee, M. Chmelik, Artificial Intelligence 221 (2015) 46–72.

Compositionality for quantitative specifications
U. Fahrenberg, J. Kretinsky, A. Legay, L. Traonouez, in:, Springer, 2015, pp. 306–324.

Probabilistic opacity for Markov decision processes
B. Bérard, K. Chatterjee, N. Sznajder,  Information Processing Letters 115 (2015) 52–59.