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.

4854 Publications


2012 | Research Data Reference | IST-REx-ID: 9757 | OA
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 | Research Data Reference | IST-REx-ID: 9758 | OA
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 | Published | Book Chapter | IST-REx-ID: 10896
S. zur Nedden, A. S. Doney, and B. G. Frenguelli, “The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance the books,” in Adenosine, 1st ed., S. Masino and D. Boison, Eds. New York: Springer, 2012, pp. 109–129.
View | DOI
 

2012 | Published | Conference Paper | IST-REx-ID: 10903
A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Accurate invariant checking for programs manipulating lists and arrays with infinite data,” in Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 167–182.
View | DOI
 

2012 | Published | Conference Paper | IST-REx-ID: 10904
K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” in CONCUR 2012 - Concurrency Theory, Newcastle upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.
[Preprint] View | Files available | DOI | arXiv
 

2012 | Published | Conference Paper | IST-REx-ID: 10905 | OA
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 | Published | Conference Paper | IST-REx-ID: 10906 | OA
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 | Published | Journal Article | IST-REx-ID: 3131 | OA
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 | Journal Article | IST-REx-ID: 2968 | OA
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 | OA
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 | Published | Journal Article | IST-REx-ID: 3166 | OA
H. de Vladar, “Amino acid fermentation at the origin of the genetic code,” Biology Direct, vol. 7. BioMed Central, 2012.
[Published Version] View | Files available | DOI
 

2012 | Published | Conference Paper | IST-REx-ID: 3165 | OA
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
 

2011 | Published | Conference Paper | IST-REx-ID: 3163
C. Lampert, “Maximum margin multi-label structured prediction,” presented at the NIPS: Neural Information Processing Systems, Granada, Spain, 2011.
View | Files available
 

2011 | Published | Conference Paper | IST-REx-ID: 3264
A. Gupta, C. Popeea, and A. Rybalchenko, “Solving recursion-free Horn clauses over LI+UIF,” presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan, 2011, vol. 7078, pp. 188–203.
View | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3266
A. Ion, J. Carreira, and C. Sminchisescu, “Probabilistic joint image segmentation and labeling,” in NIPS Proceedings, Granada, Spain, 2011, vol. 24, pp. 1827–1835.
View
 

2011 | Published | Journal Article | IST-REx-ID: 3267
C. Chen and D. Freedman, “Hardness results for homology localization,” Discrete & Computational Geometry, vol. 45, no. 3. Springer, pp. 425–448, 2011.
View | Files available | DOI
 

2011 | Published | Journal Article | IST-REx-ID: 3269 | OA
Y. Sheng, B. Cutler, C. Chen, and J. Nasman, “Perceptual global illumination cancellation in complex projection environments,” Computer Graphics Forum, vol. 30, no. 4. Wiley-Blackwell, pp. 1261–1268, 2011.
[Published Version] View | DOI | Download Published Version (ext.)
 

2011 | Published | Conference Paper | IST-REx-ID: 3270
C. Chen and M. Kerber, “Persistent homology computation with a twist,” presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland, 2011, pp. 197–200.
View
 

2011 | Published | Book Chapter | IST-REx-ID: 3271
H. Wagner, C. Chen, and E. Vuçini, “Efficient computation of persistent homology for cubical data,” in Topological Methods in Data Analysis and Visualization II, R. Peikert, H. Hauser, H. Carr, and R. Fuchs, Eds. Springer, 2011, pp. 91–106.
View | DOI
 

2011 | Published | Thesis | IST-REx-ID: 3273
J.-L. Maître, “Mechanics of adhesion and de‐adhesion in zebrafish germ layer progenitors,” Institute of Science and Technology Austria, 2011.
View
 

Filters and Search Terms

extern<>1

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed