M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/5456
DOI: 10.15479/AT:IST-2017-872-v1-1

T. A. Henzinger, B. Kragl, and S. Qadeer, Synchronizing the asynchronous. IST Austria, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/6426
DOI: 10.15479/AT:IST-2018-853-v2-2

K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural analysis. IST Austria, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/5445
DOI: 10.15479/AT:IST-2016-523-v1-1

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification on undirected population structures: Comets beat stars. IST Austria, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/5449
DOI: 10.15479/AT:IST-2016-648-v1-1

1 Anonymous, 2 Anonymous, and 3 Anonymous, Termination and worst-case analysis of recursive programs. IST Austria, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/5446

1 Anonymous, 2 Anonymous, and 3 Anonymous, Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds. IST Austria, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/5447

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/5453
DOI: 10.15479/AT:IST-2017-749-v3-1

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Strong amplifiers of natural selection. IST Austria, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/5451
DOI: 10.15479/AT:IST-2016-728-v1-1

1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, Data-centric dynamic partial order reduction. IST Austria, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/5448
arXiv: 1610.01188

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/5452
DOI: 10.15479/AT:IST-2017-728-v2-1

K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, The patience of concurrent stochastic games with safety and reachability objectives. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5431
DOI: 10.15479/AT:IST-2015-322-v1-1

1 Anonymous and 2 Anonymous, Optimal cost indefinite-horizon reachability in goal DEC-POMDPs. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5434

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

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

K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5436
DOI: 10.15479/AT:IST-2015-170-v2-2

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5437
DOI: 10.15479/AT:IST-2015-330-v2-1

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5430
DOI: 10.15479/AT:IST-2015-319-v1-1

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

K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance for pushdown automata. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5438
DOI: 10.15479/AT:IST-2015-334-v1-1

K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5440
DOI: 10.15479/AT:IST-2015-323-v2-2

K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5432
DOI: 10.15479/AT:IST-2015-323-v1-1

J. Reiter et al., Reconstructing robust phylogenies of metastatic cancers. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5444
DOI: 10.15479/AT:IST-2015-399-v1-1

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

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

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

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

K. Chatterjee, P. Daca, and 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

K. Chatterjee, P. Daca, and 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

K. Chatterjee, P. Daca, and 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

K. Chatterjee, R. Ibsen-Jensen, and 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

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

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

K. Chatterjee and 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

K. Chatterjee and 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

K. Chatterjee, M. Chmelik, R. Gupta, and 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

K. Chatterjee, M. Chmelik, R. Gupta, and 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

K. Chatterjee, A. Kössler, A. Pavlogiannis, and 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

K. Chatterjee, R. Ibsen-Jensen, and 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

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

K. Chatterjee, T. A. Henzinger, and 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

K. Chatterjee, R. Ibsen-Jensen, and 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

K. Chatterjee, T. A. Henzinger, J. Otop, and 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

J. Reiter, I. Bozic, K. Chatterjee, and 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

K. Chatterjee and 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

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

K. Chatterjee, M. Chmelik, and 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

K. Chatterjee and 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

K. Chatterjee, L. Doyen, H. Gimbert, and 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

K. Chatterjee, R. Ibsen-Jensen, and 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

K. Chatterjee, T. A. Henzinger, J. Otop, and 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

K. Chatterjee, L. Doyen, S. Nain, and 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

U. Ahmed, K. Chatterjee, and 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

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

K. Chatterjee and 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

K. Chatterjee, S. Chaubal, and 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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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