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.
4193 Publications
2012 | Journal Article | IST-REx-ID: 506 | 
M. K. Sixt, “Cell migration: Fibroblasts find a new way to get ahead,” Journal of Cell Biology, vol. 197, no. 3. Rockefeller University Press, pp. 347–349, 2012.
[Published Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 497 |
K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.
[Published Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 3165 |
K. Chatterjee and M. H. Henzinger, “An O(n2) time algorithm for alternating Büchi games,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japan, 2012, pp. 1386–1399.
View
| Files available
| DOI
| Download None (ext.)
| arXiv
2012 | Technical Report | IST-REx-ID: 5377 |
K. Chatterjee and Y. Velner, Mean-payoff pushdown games. IST Austria, 2012.
[Published Version]
View
| Files available
| DOI
2012 | Technical Report | IST-REx-ID: 5378 |
K. Chatterjee, S. Chaubal, and P. Kamath, Faster algorithms for alternating refinement relations. IST Austria, 2012.
[Published Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 2955 |
K. Chatterjee and L. Doyen, “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, 2012.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 3341 |
K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 2957 |
K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata on infinite words,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 3124 |
F. Korc, V. Kolmogorov, and C. Lampert, “Approximating marginals using discrete energy minimization,” presented at the ICML: International Conference on Machine Learning, Edinburgh, Scotland, 2012.
[Submitted Version]
View
| Files available
2012 | Technical Report | IST-REx-ID: 5396 |
F. Korc, V. Kolmogorov, and C. Lampert, Approximating marginals using discrete energy minimization. IST Austria, 2012.
[Published Version]
View
| Files available
| DOI
2012 | Report | IST-REx-ID: 5398 |
J. Porsche, Actual state of research data @ ISTAustria. IST Austria, 2012.
[Published Version]
View
| Files available
2012 | Journal Article | IST-REx-ID: 3242 |
M. Konrad et al., “Social transfer of pathogenic fungus promotes active immunisation in ant colonies,” PLoS Biology, vol. 10, no. 4. Public Library of Science, 2012.
[Published Version]
View
| Files available
| DOI
2012 | Research Data Reference | IST-REx-ID: 9755 |
M. Konrad et al., “Data from: Social transfer of pathogenic fungus promotes active immunisation in ant colonies.” Dryad, 2012.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2012 | Research Data Reference | IST-REx-ID: 9758 |
S. Aeschbacher, A. Futschik, and M. Beaumont, “Data from: Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates.” Dryad, 2012.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2012 | Research Data Reference | IST-REx-ID: 9757 |
S. Tragust, B. Mitteregger, V. Barone, M. Konrad, L. V. Ugelvig, and S. Cremer, “Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their poison.” Dryad, 2012.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2012 | Journal Article | IST-REx-ID: 2968 |
K. Lohse, N. H. Barton, G. Melika, and G. Stone, “A likelihood based comparison of population histories in a parasitoid guild,” Molecular Ecology, vol. 21, no. 18. Wiley-Blackwell, pp. 4605–4617, 2012.
[Submitted Version]
View
| Files available
| DOI
2012 | Research Data Reference | IST-REx-ID: 13075 |
K. Lohse, N. H. Barton, G. Stone, and G. Melika, “Data from: A likelihood-based comparison of population histories in a parasitoid guild.” Dryad, 2012.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2012 | Conference Paper | IST-REx-ID: 10905 |
K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” in Algorithms – ESA 2012, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 10906 |
S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko, “HSF(C): A software verifier based on Horn clauses,” in Tools and Algorithms for the Construction and Analysis of Systems, Tallinn, Estonia, 2012, vol. 7214, pp. 549–551.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2012 | Book Chapter | IST-REx-ID: 5745 |
A. Gupta, “Improved Single Pass Algorithms for Resolution Proof Reduction,” in Automated Technology for Verification and Analysis, vol. 7561, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 107–121.
View
| Files available
| DOI