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.
9087 Publications
2012 | Journal Article | IST-REx-ID: 498 | 
Pickup, M., Field, D., Rowell, D., & Young, A. (2012). Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. Evolutionary Applications. Wiley-Blackwell. https://doi.org/10.1111/j.1752-4571.2012.00284.x
[Published Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 496 |
Rabinovich, A., & Rubin, S. (2012). Interpretations in trees with countably many branches. Presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.65
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Journal Article | IST-REx-ID: 494
Boker, U., & Kupferman, O. (2012). Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2362355.2362357
View
| DOI
2012 | Journal Article | IST-REx-ID: 506 |
Sixt, M. K. (2012). Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.201204039
[Published Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 497 |
Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2012.167
[Published Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 3165 |
Chatterjee, K., & Henzinger, M. H. (2012). An O(n2) time algorithm for alternating Büchi games. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1386–1399). Kyoto, Japan: SIAM. https://doi.org/10.1137/1.9781611973099.109
View
| Files available
| DOI
| Download None (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 2956
Chatterjee, K., & Velner, Y. (2012). Mean payoff pushdown games. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.30
View
| Files available
| DOI
2012 | Technical Report | IST-REx-ID: 5377 |
Chatterjee, K., & Velner, Y. (2012). Mean-payoff pushdown games. IST Austria. https://doi.org/10.15479/AT:IST-2012-0002
[Published Version]
View
| Files available
| DOI
2012 | Technical Report | IST-REx-ID: 5378 |
Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations. IST Austria. https://doi.org/10.15479/AT:IST-2012-0001
[Published Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 2955 |
Chatterjee, K., & Doyen, L. (2012). Partial-observation stochastic games: How to win when belief fails. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.28
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv