Please note that IST Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

344 Publications


2016 | Conference Paper | IST-REx-ID: 1327   OA
Stochastic shortest path with energy constraints in POMDPs
T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, P. Novotny, in:, Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–1466.
View | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1389   OA
On recurrent reachability for continuous linear dynamical systems
V.K. Chonev, J. Ouaknine, J. Worrell, in:, LICS ’16, IEEE, 2016, pp. 515–524.
View | DOI | Download (ext.)
 

2016 | Technical Report | IST-REx-ID: 5449
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.
View | Files available | DOI
 

2016 | Journal Article | IST-REx-ID: 1529   OA
Optimal cost almost-sure reachability in POMDPs
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Artificial Intelligence 234 (2016) 26–48.
View | Files available | DOI | Download (ext.) | arXiv
 

2016 | Journal Article | IST-REx-ID: 1380   OA
On the complexity of the orbit problem
V.K. Chonev, J. Ouaknine, J. Worrell, Journal of the ACM 63 (2016).
View | DOI | Download (ext.)
 

2016 | Thesis | IST-REx-ID: 1397
Algorithms for partially observable markov decision processes
M. Chmelik, Algorithms for Partially Observable Markov Decision Processes, IST Austria, 2016.
View
 

2016 | Journal Article | IST-REx-ID: 1518   OA
Efficient strategies for calculating blockwise likelihoods under the coalescent
K. Lohse, M. Chmelik, S. Martin, N.H. Barton, Genetics 202 (2016) 775–786.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1068   OA
Conditionally optimal algorithms for generalized Büchi Games
K. Chatterjee, W. Dvorák, M. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1070   OA
Computation tree logic for synchronization properties
K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1138   OA
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.
View | DOI | Download (ext.) | arXiv
 

2016 | Conference Paper | IST-REx-ID: 1140   OA
Model and objective separation with conditional lower bounds disjunction is harder than conjunction
K. Chatterjee, W. Dvoák, M. Henzinger, V. Loitzenbauer, in:, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206.
View | DOI | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1335   OA
Quantitative monitor automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Springer, 2016, pp. 23–38.
View | DOI | Download (ext.)
 

2016 | Technical Report | IST-REx-ID: 5445
Quantitative interprocedural analysis
K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis, IST Austria, 2016.
View | Files available | DOI
 

2016 | Technical Report | IST-REx-ID: 5452   OA
Arbitrarily strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1069   OA
On the skolem problem for continuous linear dynamical systems
V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1090   OA
Nested weighted limit-average automata of bounded width
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1324
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.
View | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1386   OA
Termination analysis of probabilistic programs through Positivstellensatz's
K. Chatterjee, H. Fu, A. Goharshady, in:, Springer, 2016, pp. 3–22.
View | DOI | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1071
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.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1437
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747.
View | Files available | DOI | Download (ext.) | arXiv
 

2016 | Technical Report | IST-REx-ID: 5453
Arbitrarily strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong Amplifiers of Natural Selection, IST Austria, 2016.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5430
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1609   OA
The complexity of synthesis from probabilistic components
K. Chatterjee, L. Doyen, M. Vardi, 9135 (2015) 108–120.
View | DOI | Download (ext.)
 

2015 | Journal Article | IST-REx-ID: 1673   OA
Amplifiers of selection
B. Adlam, K. Chatterjee, M. Nowak, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471 (2015).
View | Files available | DOI
 

2015 | Journal Article | IST-REx-ID: 1856   OA
Measuring and synthesizing systems in probabilistic environments
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, Journal of the ACM 62 (2015).
View | Files available | DOI | Download (ext.)
 

2015 | Conference Paper | IST-REx-ID: 1882   OA
Compositionality for quantitative specifications
U. Fahrenberg, J. Kretinsky, A. Legay, L. Traonouez, in:, Springer, 2015, pp. 306–324.
View | DOI | Download (ext.)
 

2015 | Journal Article | IST-REx-ID: 1731   OA
Randomness for free
K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 3–16.
View | Files available | DOI | Download (ext.)
 

2015 | Conference Paper | IST-REx-ID: 1661
Improved algorithms for one-pair and k-pair Streett objectives
K. Chatterjee, M. Henzinger, V. Loitzenbauer, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015.
View | Files available | DOI | Download (ext.)
 

2015 | Technical Report | IST-REx-ID: 5435
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
View | Files available | DOI
 

2015 | Journal Article | IST-REx-ID: 523   OA
Looking at mean-payoff and total-payoff through windows
K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation 242 (2015) 25–52.
View | Files available | DOI | Download (ext.)
 

2015 | Journal Article | IST-REx-ID: 1604
Quantitative interprocedural analysis
K. Chatterjee, A. Pavlogiannis, Y. Velner, Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT 50 (2015) 539–551.
View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1820
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.
View | Files available | Download (ext.) | arXiv
 

2015 | Journal Article | IST-REx-ID: 1851   OA
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.
View | Files available | DOI
 

2015 | Journal Article | IST-REx-ID: 1559   OA
Computational complexity of ecological and evolutionary spatial dynamics
R. Ibsen-Jensen, K. Chatterjee, M. Nowak, PNAS 112 (2015) 15636–15641.
View | DOI | Download (ext.) | PubMed | Europe PMC
 

2015 | Conference Paper | IST-REx-ID: 1667   OA
Optimizing performance of continuous-time stochastic systems using timeout synthesis
T. Brázdil, L. Korenčiak, J. Krčál, P. Novotny, V. Řehák, 9259 (2015) 141–159.
View | DOI | Download (ext.)
 

2015 | Journal Article | IST-REx-ID: 524
Qualitative analysis of concurrent mean payoff games
K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.
View | Files available | DOI | Download (ext.) | arXiv
 

2015 | Technical Report | IST-REx-ID: 5431   OA
The patience of concurrent stochastic games with safety and reachability objectives
K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5443
A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs
K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.
View | Files available | DOI
 

2015 | Journal Article | IST-REx-ID: 1624   OA
Cellular cooperation with shift updating and repulsion
A. Pavlogiannis, K. Chatterjee, B. Adlam, M. Nowak, Scientific Reports 5 (2015).
View | Files available | DOI
 

2015 | Journal Article | IST-REx-ID: 1681   OA
Evolution of decisions in population games with sequentially searching individuals
T. Priklopil, K. Chatterjee, Games 6 (2015) 413–437.
View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1732   OA
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330.
View | Files available | DOI | Download (ext.) | arXiv
 

2015 | Journal Article | IST-REx-ID: 1698   OA
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.
View | DOI | Download (ext.)
 

2015 | Conference Paper | IST-REx-ID: 1838   OA
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.
View | DOI | Download (ext.)
 

2015 | Technical Report | IST-REx-ID: 5429
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5436
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015.
View | Files available | DOI
 

2015 | Research Data | IST-REx-ID: 5549   OA
Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes
A. Fellner, Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5444   OA
Reconstructing robust phylogenies of metastatic cancers
J. Reiter, A. Makohon-Moore, J. Gerold, I. Bozic, K. Chatterjee, C. Iacobuzio-Donahue, B. Vogelstein, M. Nowak, Reconstructing Robust Phylogenies of Metastatic Cancers, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5432
The complexity of evolutionary games on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
View | Files available | DOI
 

2015 | Technical Report | IST-REx-ID: 5437
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
View | Files available | DOI
 

2015 | Conference Paper | IST-REx-ID: 1839   OA
Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives
T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, 9035 (2015) 181–187.
View | DOI | Download (ext.)
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed