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.
542 Publications
2017 | Journal Article | IST-REx-ID: 484 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 683–738, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Journal Article | IST-REx-ID: 534 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 | Conference Paper | IST-REx-ID: 551 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 552 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, M. H. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 553 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2017 | Journal Article | IST-REx-ID: 568 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
P. Franek and M. Krcál, “Persistence of zero sets,” Homology, Homotopy and Applications, vol. 19, no. 2. International Press, pp. 313–342, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 630 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
S. Sauermann et al., “Biosignals standards and FHIR: The way to go,” presented at the eHealth: Health Informatics Meets eHealth, Vienna, Austria, 2017, vol. 236, pp. 356–362.
[Published Version]
View
| Files available
| DOI
2017 | Journal Article | IST-REx-ID: 632 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Lewin, P. Nam, and N. Rougerie, “A note on 2D focusing many boson systems,” Proceedings of the American Mathematical Society, vol. 145, no. 6. American Mathematical Society, pp. 2441–2454, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 635 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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: 640 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 | Conference Paper | IST-REx-ID: 648 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Skórski, “On the complexity of breaking pseudoentropy,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 600–613.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 663 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, and T. A. Henzinger, “Safety verification of nonlinear hybrid systems based on invariant clusters,” in Proceedings of the 20th International Conference on Hybrid Systems, Pittsburgh, PA, United States, 2017, pp. 163–172.
[Submitted Version]
View
| Files available
| DOI
2017 | Journal Article | IST-REx-ID: 6730 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
S. Kudekar, S. Kumar, M. Mondelli, H. D. Pfister, E. Sasoglu, and R. L. Urbanke, “Reed–Muller codes achieve capacity on erasure channels,” IEEE Transactions on Information Theory, vol. 63, no. 7. IEEE, pp. 4298–4316, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Journal Article | IST-REx-ID: 684 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,” Journal of Symbolic Logic, vol. 82, no. 2. Cambridge University Press, pp. 420–452, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 637 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 | Conference Paper | IST-REx-ID: 1174 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Skórski, “Lower bounds on key derivation for square-friendly applications,” presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 2017, vol. 66.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Conference Paper | IST-REx-ID: 1176 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
J. F. Alwen and J. Blocki, “Towards practical attacks on Argon2i and balloon hashing,” presented at the EuroS&P: European Symposium on Security and Privacy, Paris, France, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS