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.

4950 Publications


2017 | Conference Paper | IST-REx-ID: 633
S. Bak, S. Bogomolov, T. A. Henzinger, and A. Kumar, “Challenges and tool implementation of hybrid rapidly exploring random trees,” presented at the NSV: Numerical Software Verification, Heidelberg, Germany, 2017, vol. 10381, pp. 83–89.
View | DOI
 

2017 | 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 | Conference Paper | IST-REx-ID: 636 | OA
A. Bakhirkin, T. Ferrere, O. Maler, and D. Ulus, “On the quantitative semantics of regular expressions over real-valued signals,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 189–206.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Conference (Editor) | IST-REx-ID: 638
S. Bogomolov, M. Martel, and P. Prabhakar, Eds., Numerical Software Verification, vol. 10152. Springer, 2017.
View | DOI
 

2017 | 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.)
 

Filters and Search Terms

extern<>1

Search

Filter Publications