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.
5779 Publications
2012 | Submitted | Preprint | IST-REx-ID: 2928 | 
Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” ArXiv, 1205.6352, doi:10.48550/arXiv.1205.6352.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 2947 |
Chatterjee, Krishnendu, et al. Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games. Vol. 7561, Springer, 2012, pp. 385–99, doi:10.1007/978-3-642-33386-6_30.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 2937 |
Almeida, José, et al. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500, doi:10.1145/2382196.2382249.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2012 | Published | Conference Paper | IST-REx-ID: 3165 |
Chatterjee, Krishnendu, and Monika Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–99, doi:10.1137/1.9781611973099.109.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Journal Article | IST-REx-ID: 2972 |
Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” Theoretical Computer Science, vol. 458, Elsevier, 2012, pp. 49–60, doi:10.1016/j.tcs.2012.07.038.
[Published Version]
View
| Files available
| DOI
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 496 |
Rabinovich, Alexander, and Sasha Rubin. Interpretations in Trees with Countably Many Branches. 6280474, IEEE, 2012, doi:10.1109/LICS.2012.65.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 10907
Artner, Nicole M., et al. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” Graph-Based Representations in Pattern Recognition, edited by Xiaoyi Jiang et al., vol. 6658, Springer, 2011, pp. 215–24, doi:10.1007/978-3-642-20844-7_22.
View
| DOI
2011 | Published | Journal Article | IST-REx-ID: 469 |
Vyleta, Nicholas, and Stephen Smith. “Spontaneous Glutamate Release Is Independent of Calcium Influx and Tonically Activated by the Calcium-Sensing Receptor.” European Journal of Neuroscience, vol. 31, no. 12, Wiley-Blackwell, 2011, pp. 4593–606, doi:10.1523/JNEUROSCI.6398-10.2011.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Published | Journal Article | IST-REx-ID: 490 |
Schlögl, Alois, et al. “BioSig: The Free and Open Source Software Library for Biomedical Signal Processing.” Computational Intelligence and Neuroscience, vol. 2011, 935364, Hindawi Publishing Corporation, 2011, doi:10.1155/2011/935364.
[Published Version]
View
| Files available
| DOI
2011 | Published | Journal Article | IST-REx-ID: 491
Eichner, Alexander, and Michael K. Sixt. “Setting the Clock for Recirculating Lymphocytes.” Science Signaling, vol. 4, no. 198, pe43, American Association for the Advancement of Science, 2011, doi:10.1126/scisignal.2002617.
View
| DOI
2011 | Published | Journal Article | IST-REx-ID: 518 |
Schraivogel, Daniel, et al. “CAMTA1 Is a Novel Tumour Suppressor Regulated by MiR-9/9 * in Glioblastoma Stem Cells.” EMBO Journal, vol. 30, no. 20, Wiley-Blackwell, 2011, pp. 4309–22, doi:10.1038/emboj.2011.301.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2011 | Published | Journal Article | IST-REx-ID: 531 |
Guerraoui, Rachid, et al. “Verification of STM on Relaxed Memory Models.” Formal Methods in System Design, vol. 39, no. 3, Springer, 2011, pp. 297–331, doi:10.1007/s10703-011-0131-3.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Published | Technical Report | IST-REx-ID: 5383 |
Wies, Thomas, et al. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011, doi:10.15479/AT:IST-2011-0005.
[Published Version]
View
| Files available
| DOI
2011 | Published | Technical Report | IST-REx-ID: 5386 |
Chen, Chao, et al. Enforcing Topological Constraints in Random Field Image Segmentation. IST Austria, 2011, doi:10.15479/AT:IST-2011-0002.
[Published Version]
View
| Files available
| DOI
2011 | Published | Journal Article | IST-REx-ID: 6496 |
Park, Heungwon, et al. “Noise Underlies Switching Behavior of the Bacterial Flagellum.” Biophysical Journal, vol. 101, no. 10, Elsevier, 2011, pp. 2336–40, doi:10.1016/j.bpj.2011.09.040.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
2011 | Published | Conference Paper | IST-REx-ID: 3266
Ion, Adrian, et al. “Probabilistic Joint Image Segmentation and Labeling.” NIPS Proceedings, vol. 24, Neural Information Processing Systems Foundation, 2011, pp. 1827–35.
View
2011 | Published | Journal Article | IST-REx-ID: 3267
Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.” Discrete & Computational Geometry, vol. 45, no. 3, Springer, 2011, pp. 425–48, doi:10.1007/s00454-010-9322-8.
View
| Files available
| DOI
2011 | Published | Journal Article | IST-REx-ID: 3269 |
Sheng, Yu, et al. “Perceptual Global Illumination Cancellation in Complex Projection Environments.” Computer Graphics Forum, vol. 30, no. 4, Wiley-Blackwell, 2011, pp. 1261–68, doi:10.1111/j.1467-8659.2011.01985.x.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3270
Chen, Chao, and Michael Kerber. Persistent Homology Computation with a Twist. TU Dortmund, 2011, pp. 197–200.
View
2011 | Published | Book Chapter | IST-REx-ID: 3271
Wagner, Hubert, et al. “Efficient Computation of Persistent Homology for Cubical Data.” Topological Methods in Data Analysis and Visualization II, edited by Ronald Peikert et al., Springer, 2011, pp. 91–106, doi:10.1007/978-3-642-23175-9_7.
View
| DOI