Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria.https://doi.org/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. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria.https://doi.org/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

Boker, U., Henzinger, T. A., &; Otop, J. (2015). The target discounted-sum problem. IST Austria.https://doi.org/10.15479/AT:IST-2015-335-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5439
DOI: 10.15479/AT:IST-2015-335-v1-1

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &; Otop, J. (2015). Edit distance for pushdown automata. IST Austria.https://doi.org/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. (2015). The complexity of evolutionary games on graphs. IST Austria.https://doi.org/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. (2015). The complexity of evolutionary games on graphs. IST Austria.https://doi.org/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

Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue, C.,https://doi.org/10.15479/AT:IST-2015-399-v1-1__Nowak, M. (2015). Reconstructing robust phylogenies of metastatic cancers. IST Austria.https://doi.org/10.15479/AT:IST-2015-399-v1-1 
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.https://doi.org/10.15479/AT:IST-2015-325-v2-1 
LibreCat: https://research-explorer.ista.ac.at/record/5443
DOI: 10.15479/AT:IST-2015-325-v2-1

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

Anonymous, 1, Anonymous, 2, Anonymous, 3, &; Anonymous, 4. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria.
LibreCat: https://research-explorer.ista.ac.at/record/5442

Daca, P., Henzinger, T. A., Krenn, W., &; Nickovic, D. (2014). Compositional specifications for IOCO testing. IST Austria.https://doi.org/10.15479/AT:IST-2014-148-v2-1 
LibreCat: https://research-explorer.ista.ac.at/record/5411
DOI: 10.15479/AT:IST-2014-148-v2-1

Chatterjee, K., Daca, P., &; Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria.https://doi.org/10.15479/AT:IST-2014-153-v2-2 
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.https://doi.org/10.15479/AT:IST-2014-153-v3-1 
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.https://doi.org/10.15479/AT:IST-2014-153-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5412
DOI: 10.15479/AT:IST-2014-153-v1-1

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

Henzinger, T. A., &; Otop, J. (2014). From model checking to model measuring. IST Austria.https://doi.org/10.15479/AT:IST-2014-172-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5417
DOI: 10.15479/AT:IST-2014-172-v1-1

Henzinger, T. A., &; Otop, J. (2014). Model measuring for hybrid systems. IST Austria.https://doi.org/10.15479/AT:IST-2014-171-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5416
DOI: 10.15479/AT:IST-2014-171-v1-1

Chatterjee, K., &; Doyen, L. (2014). Games with a weak adversary. IST Austria.https://doi.org/10.15479/AT:IST-2014-176-v1-1 
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.https://doi.org/10.15479/AT:IST-2014-191-v1-1 
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.https://doi.org/10.15479/AT:IST-2014-305-v1-1 
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.https://doi.org/10.15479/AT:IST-2014-305-v2-1 
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.https://doi.org/10.15479/AT:IST-2014-300-v1-1 
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.https://doi.org/10.15479/AT:IST-2014-314-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5427
DOI: 10.15479/AT:IST-2014-314-v1-1

Anonymous, 1, Anonymous, 2, Anonymous, 3, &; Anonymous, 4. (2014). Optimal cost almost-sure reachability in POMDPs. IST Austria.
LibreCat: https://research-explorer.ista.ac.at/record/5425

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2014). Nested weighted automata. IST Austria.https://doi.org/10.15479/AT:IST-2014-170-v1-1 
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.https://doi.org/10.15479/AT:IST-2014-190-v2-2 
LibreCat: https://research-explorer.ista.ac.at/record/5421
DOI: 10.15479/AT:IST-2014-190-v2-2

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

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

Chatterjee, K., &; Ibsen-Jensen, R. (2013). Qualitative analysis of concurrent mean-payoff games. IST Austria.https://doi.org/10.15479/AT:IST-2013-126-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5403
DOI: 10.15479/AT:IST-2013-126-v1-1

Henzinger, T. A., &; Sezgin, A. (2013). How free is your linearizable concurrent data structure? IST Austria.https://doi.org/10.15479/AT:IST-2013-123-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5402
DOI: 10.15479/AT:IST-2013-123-v1-1

Chatterjee, K., Chmelik, M., &; Tracol, M. (2013). What is decidable about partially observable Markov decision processes with <9-regular objectives. IST Austria.https://doi.org/10.15479/AT:IST-2013-109-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5400
DOI: 10.15479/AT:IST-2013-109-v1-1

Chatterjee, K., &; Ibsen-Jensen, R. (2013). The complexity of ergodic games. IST Austria.https://doi.org/10.15479/AT:IST-2013-127-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5404
DOI: 10.15479/AT:IST-2013-127-v1-1

Chatterjee, K., Doyen, L., Gimbert, H., &; Oualhadj, Y. (2013). Perfect-information stochastic mean-payoff parity games. IST Austria.https://doi.org/10.15479/AT:IST-2013-128-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5405
DOI: 10.15479/AT:IST-2013-128-v1-1

Chatterjee, K., Ibsen-Jensen, R., &; Majumdar, R. (2013). Edit distance for timed automata. IST Austria.https://doi.org/10.15479/AT:IST-2013-144-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5409
DOI: 10.15479/AT:IST-2013-144-v1-1

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

Chatterjee, K., Doyen, L., Nain, S., &; Vardi, M. (2013). The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria.https://doi.org/10.15479/AT:IST-2013-141-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5408
DOI: 10.15479/AT:IST-2013-141-v1-1

Ahmed, U., Chatterjee, K., &; Gulwani, S. (2013). Automatic generation of alternative starting positions for traditional board games. IST Austria.https://doi.org/10.15479/AT:IST-2013-146-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5410
DOI: 10.15479/AT:IST-2013-146-v1-1

Henzinger, T. A., Payer, H., &; Sezgin, A. (2013). Replacing competition with cooperation to achieve scalable lock-free FIFO queues . IST Austria.https://doi.org/10.15479/AT:IST-2013-124-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/6440
DOI: 10.15479/AT:IST-2013-124-v1-1

Chatterjee, K., &; Velner, Y. (2012). Mean-payoff pushdown games. IST Austria.https://doi.org/10.15479/AT:IST-2012-0002 
LibreCat: https://research-explorer.ista.ac.at/record/5377
DOI: 10.15479/AT:IST-2012-0002

Chatterjee, K., Chaubal, S., &; Kamath, P. (2012). Faster algorithms for alternating refinement relations. IST Austria.https://doi.org/10.15479/AT:IST-2012-0001 
LibreCat: https://research-explorer.ista.ac.at/record/5378
DOI: 10.15479/AT:IST-2012-0001

Korc, F., Kolmogorov, V., &; Lampert, C. (2012). Approximating marginals using discrete energy minimization. IST Austria.https://doi.org/10.15479/AT:IST-2012-0003 
LibreCat: https://research-explorer.ista.ac.at/record/5396
DOI: 10.15479/AT:IST-2012-0003

Chatterjee, K., &; Henzinger, M. H. (2011). An O(n2) time algorithm for alternating Büchi games. IST Austria.https://doi.org/10.15479/AT:IST-2011-0009 
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.https://doi.org/10.15479/AT:IST-2011-0007 
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.https://doi.org/10.15479/AT:IST-2011-0008 
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.https://doi.org/10.15479/AT:IST-2011-0006 
LibreCat: https://research-explorer.ista.ac.at/record/5382
DOI: 10.15479/AT:IST-2011-0006

Boker, U., Chatterjee, K., Henzinger, T. A., &; Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria.https://doi.org/10.15479/AT:IST-2011-0003 
LibreCat: https://research-explorer.ista.ac.at/record/5385
DOI: 10.15479/AT:IST-2011-0003

Chen, C., Freedman, D., &; Lampert, C. (2011). Enforcing topological constraints in random field image segmentation. IST Austria.https://doi.org/10.15479/AT:IST-2011-0002 
LibreCat: https://research-explorer.ista.ac.at/record/5386
DOI: 10.15479/AT:IST-2011-0002

Wies, T., Muñiz, M., &; Kuncak, V. (2011). On an efficient decision procedure for imperative tree data structures. IST Austria.https://doi.org/10.15479/AT:IST-2011-0005 
LibreCat: https://research-explorer.ista.ac.at/record/5383
DOI: 10.15479/AT:IST-2011-0005

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

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

Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., &; Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria.https://doi.org/10.15479/AT:IST-2010-0004 
LibreCat: https://research-explorer.ista.ac.at/record/5388
DOI: 10.15479/AT:IST-2010-0004

Cerny, P., Henzinger, T. A., &; Radhakrishna, A. (2010). Simulation distances. IST Austria.https://doi.org/10.15479/AT:IST-2010-0003 
LibreCat: https://research-explorer.ista.ac.at/record/5389
DOI: 10.15479/AT:IST-2010-0003

Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., &; Alur, R. (2010). Model checking of linearizability of concurrent list implementations. IST Austria.https://doi.org/10.15479/AT:IST-2010-0001 
LibreCat: https://research-explorer.ista.ac.at/record/5391
DOI: 10.15479/AT:IST-2010-0001

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

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Radhakrishna, A. (2009). Gist: A solver for probabilistic games. IST Austria.https://doi.org/10.15479/AT:IST-2009-0003 
LibreCat: https://research-explorer.ista.ac.at/record/5393
DOI: 10.15479/AT:IST-2009-0003

Chatterjee, K., Henzinger, T. A., &; Horn, F. (2009). Improved lower bounds for request-response and finitary Streett games. IST Austria.https://doi.org/10.15479/AT:IST-2009-0002 
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.https://doi.org/10.15479/AT:IST-2009-0004 
LibreCat: https://research-explorer.ista.ac.at/record/5392
DOI: 10.15479/AT:IST-2009-0004

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). Qualitative analysis of partially-observable Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2009-0001 
LibreCat: https://research-explorer.ista.ac.at/record/5395
DOI: 10.15479/AT:IST-2009-0001