ISTA Research Explorer

Please note that ISTA 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.

527 Publications

2015 | Published | Technical Report | IST-REx-ID: 5440 |

K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.

[Published Version] View | Files available | DOI

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.

[Published Version] View | Files available | DOI

K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria, 2015.

[Published Version] View | Files available | DOI

2015 | Published | Technical Report | IST-REx-ID: 5444 |

J. Reiter et al., Reconstructing robust phylogenies of metastatic cancers. IST Austria, 2015.

[Published Version] View | Files available | DOI

2015 | Research Data | IST-REx-ID: 5549 |

A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015.

[Published Version] View | Files available | DOI

2015 | Published | Conference Paper | IST-REx-ID: 10796 |

K. Chatterjee and R. Ibsen-Jensen, “The value 1 problem under finite-memory strategies for concurrent mean-payoff games,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2015, vol. 2015, no. 1, pp. 1018–1029.

[Preprint] View | DOI | Download Preprint (ext.) | arXiv

2015 | Published | Journal Article | IST-REx-ID: 1731 |

K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” Information and Computation, vol. 245, no. 12. Elsevier, pp. 3–16, 2015.

2015 | Published | Conference Paper | IST-REx-ID: 1732 |

K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis of POMDPs with temporal logic specifications for robotics applications,” presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States, 2015, pp. 325–330.

[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv

2015 | Published | Conference Paper | IST-REx-ID: 1838 |

R. Bloem, K. Chatterjee, S. Jacobs, and R. Könighofer, “Assume-guarantee synthesis for concurrent reactive programs with partial information,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom, 2015, vol. 9035, pp. 517–532.

[Preprint] View | DOI | Download Preprint (ext.) | arXiv

2015 | Published | Conference Paper | IST-REx-ID: 1839 |

T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives,” vol. 9035. Springer, pp. 181–187, 2015.

[Preprint] View | DOI | Download Preprint (ext.) | arXiv

K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in 42nd International Colloquium on Automata, Languages, and Programming, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.

K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.

[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS

K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.

[Published Version] View | Files available | DOI

K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.

[Published Version] View | Files available | DOI

K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance for pushdown automata. IST Austria, 2015.

[Published Version] View | Files available | DOI

K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.

[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS

2015 | Published | Journal Article | IST-REx-ID: 2034 |

B. Bérard, K. Chatterjee, and N. Sznajder, “Probabilistic opacity for Markov decision processes,” Information Processing Letters, vol. 115, no. 1. Elsevier, pp. 52–59, 2015.

[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv

K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.

K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2015.

[Published Version] View | Files available | DOI

2015 | Published | Journal Article | IST-REx-ID: 1709 |

J. Reiter, A. Kanodia, R. Gupta, M. Nowak, and K. Chatterjee, “Biological auctions with multiple rewards,” Proceedings of the Royal Society of London Series B Biological Sciences, vol. 282, no. 1812. Royal Society, 2015.

ISTA Research Explorer

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

527 Publications

Filters and Search Terms

Search

Filter Publications

Display / Sort

Export / Embed

ISTA Research Explorer

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

527 Publications

Filters and Search Terms

Search

Filter Publications

Research Group

Display / Sort

Export / Embed

Export Options