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.
498 Publications
2016 | Published | Technical Report | IST-REx-ID: 5453 |

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-749-v3-1
[Published Version]
View
| Files available
| DOI
2016 | Published | Technical Report | IST-REx-ID: 5452 |

Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-728-v2-1
[Published Version]
View
| Files available
| DOI
2016 | Published | Journal Article | IST-REx-ID: 1477 |

Chatterjee, K., Chmelik, M., & Tracol, M. (2016). What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2016.02.009
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Technical Report | IST-REx-ID: 5445 |

Chatterjee, K., Pavlogiannis, A., & Velner, Y. (2016). Quantitative interprocedural analysis. IST Austria. https://doi.org/10.15479/AT:IST-2016-523-v1-1
[Published Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1138 |

Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Quantitative automata under probabilistic semantics. In Proceedings of the 31st Annual ACM/IEEE Symposium (pp. 76–85). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2933588
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 1140 |

Chatterjee, K., Dvoák, W., Henzinger, M., & Loitzenbauer, V. (2016). Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 197–206). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2935304
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 1093 |

Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2016). Linear distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2016.20
[Published Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1438 |

Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837639
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Journal Article | IST-REx-ID: 1529 |

Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2016.01.007
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 1182 |

Chatterjee, K., Ibsen-Jensen, R., & Tkadlec, J. (2016). Robust draws in balanced knockout tournaments (Vol. 2016–January, pp. 172–179). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA: AAAI Press.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 1324 |

Chatterjee, K., & Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (Vol. 2016, pp. 88–96). London, United Kingdom: AAAI Press. https://doi.org/10.1609/icaps.v26i1.13737
View
| DOI
| Download None (ext.)
2016 | Published | Conference Paper | IST-REx-ID: 1070 |

Chatterjee, K., & Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.98
[Published Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1069 |

Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On the skolem problem for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.100
[Published Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1071 |

Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs (Vol. 57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2016.28
[Published Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1335 |

Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Quantitative monitor automata (Vol. 9837, pp. 23–38). Presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-53413-7_2
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 1340 |

Hansen, K., Ibsen-Jensen, R., & Koucký, M. (2016). The big match in small space (Vol. 9928, pp. 64–76). Presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-53354-3_6
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 480 |

Chatterjee, K., & Doyen, L. (2016). Perfect-information stochastic games with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934513
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 1327 |

Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., & Novotný, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 1465–1466). Singapore: ACM.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 1326 |

Brázdil, T., Kučera, A., & Novotný, P. (2016). Optimizing the expected mean payoff in Energy Markov Decision Processes (Vol. 9938, pp. 32–49). Presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan: Springer. https://doi.org/10.1007/978-3-319-46520-3_3
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 1389 |

Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On recurrent reachability for continuous linear dynamical systems. In LICS ’16 (pp. 515–524). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934548
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv