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.
543 Publications
2012 |Published| Conference Paper | IST-REx-ID: 2891 | 
U. Boker and T. A. Henzinger, “Approximate determinization of quantitative automata,” in Leibniz International Proceedings in Informatics, Hyderabad, India, 2012, vol. 18, pp. 362–373.
[Published Version]
View
| Files available
| DOI
2012 |Published| Journal Article | IST-REx-ID: 3131 |
D. Weissman and N. H. Barton, “Limits to the rate of adaptive substitution in sexual populations,” PLoS Genetics, vol. 8, no. 6. Public Library of Science, 2012.
[Published Version]
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 3133 |
H. Edelsbrunner and M. Kerber, “Alexander duality for functions: The persistent behavior of land and water and shore,” in Proceedings of the twenty-eighth annual symposium on Computational geometry , Chapel Hill, NC, USA, 2012, pp. 249–258.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 |Published| Conference Paper | IST-REx-ID: 3284 |
V. Kolmogorov and S. Živný, “The complexity of conservative valued CSPs,” presented at the SODA: Symposium on Discrete Algorithms, 2012, pp. 750–759.
View
| Download (ext.)
2011 |Published| Book Chapter | IST-REx-ID: 2116 |
J. Maas and J. Van Neerven, “Gradient estimates and domain identification for analytic Ornstein-Uhlenbeck operators,” in Parabolic Problems, vol. 80, Birkhäuser, 2011, pp. 463–477.
View
| DOI
| Download (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 2975
J. Camenisch, S. Krenn, and V. Shoup, “A Framework for Practical Universally Composable Zero-Knowledge Protocols,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, 2011, vol. 7073, pp. 449–467.
View
| DOI
| Download (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3367
C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” presented at the SoCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 207–216.
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3326 |
S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata ,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.
[Submitted Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3346 |
T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Two views on multiple mean payoff objectives in Markov Decision Processes,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Technical Report | IST-REx-ID: 5384 |
K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.
[Published Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3345 |
K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland, 2011, vol. 6907, pp. 206–218.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2011 |Published| Technical Report | IST-REx-ID: 5387 |
K. Chatterjee and L. Doyen, Energy and mean-payoff parity Markov decision processes. IST Austria, 2011.
[Published Version]
View
| Files available
| DOI