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.
451 Publications
2015 |Published| Conference Paper | IST-REx-ID: 1657
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.
View
| Files available
| DOI
2015 |Published| Conference Paper | IST-REx-ID: 1656
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.
View
| Files available
| DOI
| arXiv
2015 |Published| Technical Report | IST-REx-ID: 5429 |
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
2015 |Published| Technical Report | IST-REx-ID: 5435 |
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
2015 |Published| Technical Report | IST-REx-ID: 5436 |
K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |Published| Conference Paper | IST-REx-ID: 1659 |
U. Boker, T. A. Henzinger, and J. Otop, “The target discounted-sum problem,” in LICS, Kyoto, Japan, 2015, pp. 750–761.
[Submitted Version]
View
| Files available
| DOI
2015 |Published| Conference Paper | IST-REx-ID: 1610 |
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in 42nd International Colloquium, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.
View
| Files available
| DOI
| Download None (ext.)
| arXiv
2015 |Published| Technical Report | IST-REx-ID: 5437 |
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |Published| Technical Report | IST-REx-ID: 5430 |
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |Published| Technical Report | IST-REx-ID: 5439 |
U. Boker, T. A. Henzinger, and J. Otop, The target discounted-sum problem. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |Published| Technical Report | IST-REx-ID: 5438 |
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
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
2015 |Published| Technical Report | IST-REx-ID: 5432 |
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. 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 |Published| Technical Report | IST-REx-ID: 5443 |
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| Conference Paper | IST-REx-ID: 1511 |
X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 476–490.
[Published Version]
View
| Files available
| DOI