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.
321 Publications
2015 |Published| Conference Paper | IST-REx-ID: 1672 | 
J. F. Alwen, R. Ostrovsky, H. Zhou, and V. Zikas, “Incoercible multi-party computation and universally composable receipt-free voting,” in Advances in Cryptology - CRYPTO 2015, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 763–780.
[Submitted Version]
View
| Files available
| DOI
2015 |Published| Technical Report | IST-REx-ID: 5444 |
J. Reiter et al., Reconstructing robust phylogenies of metastatic cancers. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 11790
L. Cigler, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Limiting price discrimination when selling products with positive network externalities,” in 10th International Conference of Web and Internet Economics, Beijing, China, 2014, vol. 8877, pp. 44–57.
View
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 11870 |
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs,” in 46th Annual ACM Symposium on Theory of Computing, New York, NY, United States, 2014.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 11875 |
S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” in 26th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2014, pp. 785–804.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Journal Article | IST-REx-ID: 2056 |
A. Ganguly, T. Petrov, and H. Koeppl, “Markov chain aggregation and its applications to combinatorial reaction networks,” Journal of Mathematical Biology, vol. 69, no. 3. Springer, pp. 767–797, 2014.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 |Published| Journal Article | IST-REx-ID: 2154 |
J. Matoušek and U. Wagner, “On Gromov’s method of selecting heavily covered points,” Discrete & Computational Geometry, vol. 52, no. 1. Springer, pp. 1–33, 2014.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 |Published| Journal Article | IST-REx-ID: 2252
S. Phadke, T. Paixao, T. Pham, S. Pham, and R. Zufall, “Genetic background alters dominance relationships between mat alleles in the ciliate Tetrahymena Thermophila,” Journal of Heredity, vol. 105, no. 1. Oxford University Press, pp. 130–135, 2014.
View
| DOI
2014 |Published| Journal Article | IST-REx-ID: 2852
M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners for hash functions,” Journal of Cryptology, vol. 27, no. 3. Springer, pp. 397–428, 2014.
View
| Files available
| DOI
2014 |Published| Journal Article | IST-REx-ID: 8023 |
C. Tomm, M. Avermann, C. Petersen, W. Gerstner, and T. P. Vogels, “Connection-type-specific biases make uniform random network models consistent with cortical recordings,” Journal of Neurophysiology, vol. 112, no. 8. American Physiological Society, pp. 1801–1814, 2014.
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2014 |Published| Journal Article | IST-REx-ID: 535 |
K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” Algorithmica, vol. 70, no. 3. Springer, pp. 457–492, 2014.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Journal Article | IST-REx-ID: 1913 |
I. Milenković, T. Petrov, and G. Kovács, “Patterns of hippocampal tau pathology differentiate neurodegenerative dementias,” Dementia and Geriatric Cognitive Disorders, vol. 38, no. 5–6. Karger Publishers, pp. 375–388, 2014.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
2013 |Published| Conference Paper | IST-REx-ID: 11856 |
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization,” in 54th Annual Symposium on Foundations of Computer Science, Berkeley, CA, United States, 2013, pp. 538–547.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 |Published| Conference Paper | IST-REx-ID: 2181 |
T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 317–328.
[Submitted Version]
View
| Files available
| DOI
2013 |Published| Conference Paper | IST-REx-ID: 2276 |
I. Gridchyn and V. Kolmogorov, “Potts model, parametric maxflow and k-submodular functions,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 2320–2327.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 |Published| Journal Article | IST-REx-ID: 2289 |
T. A. Henzinger, “Quantitative reactive modeling and verification,” Computer Science Research and Development, vol. 28, no. 4. Springer, pp. 331–344, 2013.
[Published Version]
View
| Files available
| DOI
2013 |Published| Conference Paper | IST-REx-ID: 2319 |
R. Frank, C. Hainzl, R. Seiringer, and J. Solovej, “ Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction,” presented at the OTAMP: Operator Theory, Analysis and Mathematical Physics, 2013, pp. 57–88.
View
| DOI
| Download (ext.)