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.

7136 Publications


2017 | Published | Journal Article | IST-REx-ID: 910 | OA
S. Novak and N. H. Barton, “When does frequency-independent selection maintain genetic variation?,” Genetics, vol. 207, no. 2. Genetics Society of America, pp. 653–668, 2017.
[Submitted Version] View | Files available | DOI | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1336 | OA
T. Paixao, J. Pérez Heredia, D. Sudholt, and B. Trubenova, “Towards a runtime comparison of natural and artificial evolution,” Algorithmica, vol. 78, no. 2. Springer, pp. 681–713, 2017.
[Published Version] View | Files available | DOI | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1198 | OA
T. Moser and R. Seiringer, “Triviality of a model of particles with point interactions in the thermodynamic limit,” Letters in Mathematical Physics, vol. 107, no. 3. Springer, pp. 533–552, 2017.
[Published Version] View | Files available | DOI | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 605 | OA
J. Brody, S. Dziembowski, S. Faust, and K. Z. Pietrzak, “Position based cryptography and multiparty communication complexity,” presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States, 2017, vol. 10677, pp. 56–81.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Thesis | IST-REx-ID: 838 | OA
M. Rybar, “(The exact security of) Message authentication codes,” Institute of Science and Technology Austria, 2017.
[Published Version] View | Files available | DOI
 

2017 | Published | Journal Article | IST-REx-ID: 6196 | OA
P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact security of PMAC,” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2. Ruhr University Bochum, pp. 145–161, 2017.
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 635 | OA
J. F. Alwen, B. Chen, K. Z. Pietrzak, L. Reyzin, and S. Tessaro, “Scrypt is maximally memory hard,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 33–62.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 640 | OA
J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Depth-robust graphs and their cumulative memory complexity,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 3–32.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 6526 | OA
M. Skórski, “On the complexity of estimating Rènyi divergences,” in 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 637 | OA
Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K. Z. Pietrzak, and D. Wichs, “Be adaptive avoid overcommitting,” presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States, 2017, vol. 10401, pp. 133–163.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 559 | OA
H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L. Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2017 | Published | Journal Article | IST-REx-ID: 1187 | OA
E. Kiltz, K. Z. Pietrzak, D. Venturi, D. Cash, and A. Jain, “Efficient authentication from hard learning problems,” Journal of Cryptology, vol. 30, no. 4. Springer, pp. 1238–1275, 2017.
[Submitted Version] View | Files available | DOI | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1433 | OA
U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “Phat - Persistent homology algorithms toolbox,” Journal of Symbolic Computation, vol. 78. Academic Press, pp. 76–90, 2017.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1072 | OA
U. Bauer and H. Edelsbrunner, “The Morse theory of Čech and delaunay complexes,” Transactions of the American Mathematical Society, vol. 369, no. 5. American Mathematical Society, pp. 3741–3762, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 6519 | OA
K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 6527 | OA
J. F. Alwen, J. Blocki, and B. Harsha, “Practical graphs for optimal side-channel resistant memory-hard functions,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA, 2017, pp. 1001–1017.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Technical Report | IST-REx-ID: 5456 | OA
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.
[Published Version] View | Files available | DOI
 

2017 | Published | Book Chapter | IST-REx-ID: 545 | OA
E. Mazur and J. Friml, “Vascular tissue development and regeneration in the model plant arabidopsis,” in Plant Engineering, S. Jurić, Ed. IntechOpen, 2017, pp. 113–140.
[Published Version] View | Files available | DOI
 

2017 | Published | Journal Article | IST-REx-ID: 534 | OA
B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-Manifolds,” Discrete & Computational Geometry, vol. 58, no. 4. Springer, pp. 871–888, 2017.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 1011 | OA
K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 

Filters and Search Terms

oa=1

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed