Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
5270 Publications
2012 |Published| Journal Article | IST-REx-ID: 2263 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
H. Liang, S. Hippenmeyer, and H. Ghashghaei, “A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors,” Biology open, vol. 1, no. 12. The Company of Biologists, pp. 1200–1203, 2012.
[Published Version]
View
| Files available
| DOI
2012 |Published| Journal Article | IST-REx-ID: 2302
T. A. Henzinger and M. Mateescu, “The propagation approach for computing biochemical reaction networks,” IEEE ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. 2. IEEE, pp. 310–322, 2012.
View
| DOI
| PubMed | Europe PMC
2012 |Published| Journal Article | IST-REx-ID: 2318 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
R. Seiringer, “Absence of bound states implies non-negativity of the scattering length,” Journal of Spectral Theory, vol. 2, no. 3. European Mathematical Society, pp. 321–328, 2012.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 |Published| Journal Article | IST-REx-ID: 2411 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
I. Ebersberger et al., “A consistent phylogenetic backbone for the fungi,” Molecular Biology and Evolution, vol. 29, no. 5. Oxford University Press, pp. 1319–1334, 2012.
[Published Version]
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 2715 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 2012, vol. 18, pp. 461–473.
[Published Version]
View
| Files available
| 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: 2825
C. Lampert, “Dynamic pruning of factor graphs for maximum marginal prediction,” presented at the NIPS: Neural Information Processing Systems, Lake Tahoe, NV, United States, 2012, vol. 1, pp. 82–90.
View
2012 |Published| Journal Article | IST-REx-ID: 2848 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations with different learners,” Journal of Theoretical Biology, vol. 301. Elsevier, pp. 161–173, 2012.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2012 |Published| Journal Article | IST-REx-ID: 2849 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
H. Edelsbrunner and N. Strelkova, “On the configuration space of Steiner minimal trees,” Russian Mathematical Surveys, vol. 67, no. 6. IOP Publishing Ltd., pp. 1167–1168, 2012.
[Submitted Version]
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 2891 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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| Conference Paper | IST-REx-ID: 2903 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
H. Edelsbrunner and O. Symonova, “The adaptive topology of a digital image,” presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA , 2012, pp. 41–48.
[Submitted Version]
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 2916 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in Electronic Proceedings in Theoretical Computer Science, Napoli, Italy, 2012, vol. 96, pp. 29–42.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 2930 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,” presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece, 2012, vol. 7422, pp. 451–462.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 |Published| Preprint | IST-REx-ID: 2928 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted message passing,” arXiv. ArXiv, 2012.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 2937 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, and S. Béguelin, “Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols,” in Proceedings of the 2012 ACM conference on Computer and communications security, Raleigh, NC, USA, 2012, pp. 488–500.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2012 |Published| Conference Paper | IST-REx-ID: 2936 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in roceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 43–52.
[Preprint]
View
| DOI
| Download Preprint (ext.)