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.
548 Publications
2018 |Submitted| Preprint | IST-REx-ID: 6183 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Alt, J., Erdös, L., & Krüger, T. H. (n.d.). The Dyson equation with linear self-energy: Spectral bands, edges and cusps. arXiv.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2018 | Research Data | IST-REx-ID: 5584 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Deny, S., Marre, O., Botella-Soler, V., Martius, G. S., & Tkačik, G. (2018). Nonlinear decoding of a complex movie from the mammalian retina. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:98
[Published Version]
View
| Files available
| DOI
2018 |Published| Thesis | IST-REx-ID: 149 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Alt, J. (2018). Dyson equation and eigenvalue statistics of random matrices. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1040
[Published Version]
View
| Files available
| DOI
2018 |Published| Conference Paper | IST-REx-ID: 6665 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Fazeli, A., Hassani, H., Mondelli, M., & Vardy, A. (2018). Binary linear codes with optimal scaling: Polar codes with large kernels. In 2018 IEEE Information Theory Workshop (pp. 1–5). Guangzhou, China: IEEE. https://doi.org/10.1109/itw.2018.8613428
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2018 |Published| Journal Article | IST-REx-ID: 15232 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Rosa AD et al. 2018. Accretion in strong field gravity with eXTP. Science China Physics, Mechanics & Astronomy. 62(2), 29504.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 |Published| Journal Article | IST-REx-ID: 10175 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Anza Hafsa, O., Clozeau, N., & Mandallena, J.-P. (2017). Homogenization of nonconvex unbounded singular integrals. Annales Mathématiques Blaise Pascal. Université Clermont Auvergne. https://doi.org/10.5802/ambp.367
[Published Version]
View
| Files available
| DOI
2017 |Published| Journal Article | IST-REx-ID: 484 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Nam, P., & Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a4
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Journal Article | IST-REx-ID: 534 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Burton, B., de Mesmay, A. N., & Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-017-9900-0
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2017 |Published| Conference Paper | IST-REx-ID: 551 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.61
[Published Version]
View
| Files available
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 552 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, K., Henzinger, M. H., & Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.39
[Published Version]
View
| Files available
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 553 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.55
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2017 |Published| Journal Article | IST-REx-ID: 568 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Franek, P., & Krcál, M. (2017). Persistence of zero sets. Homology, Homotopy and Applications. International Press. https://doi.org/10.4310/HHA.2017.v19.n2.a16
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Book Chapter | IST-REx-ID: 5803
Biswas, R., & Bhowmick, P. (2017). Construction of persistent Voronoi diagram on 3D digital plane. In Combinatorial image analysis (Vol. 10256, pp. 93–104). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-59108-7_8
View
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 630 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Sauermann, S., David, V., Schlögl, A., Egelkraut, R., Frohner, M., Pohn, B., … Mense, A. (2017). Biosignals standards and FHIR: The way to go (Vol. 236, pp. 356–362). Presented at the eHealth: Health Informatics Meets eHealth, Vienna, Austria: IOS Press. https://doi.org/10.3233/978-1-61499-759-7-356
[Published Version]
View
| Files available
| DOI
2017 |Published| Journal Article | IST-REx-ID: 632 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Lewin, M., Nam, P., & Rougerie, N. (2017). A note on 2D focusing many boson systems. Proceedings of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/13468
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 635 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Alwen, J. F., Chen, B., Pietrzak, K. Z., Reyzin, L., & Tessaro, S. (2017). Scrypt is maximally memory hard. In J.-S. Coron & J. Buus Nielsen (Eds.) (Vol. 10212, pp. 33–62). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_2
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 640 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2017). Depth-robust graphs and their cumulative memory complexity. In J.-S. Coron & J. Buus Nielsen (Eds.) (Vol. 10212, pp. 3–32). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_1
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 648 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Skórski, M. (2017). On the complexity of breaking pseudoentropy. In G. Jäger & S. Steila (Eds.) (Vol. 10185, pp. 600–613). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_43
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 663 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kong, H., Bogomolov, S., Schilling, C., Jiang, Y., & Henzinger, T. A. (2017). Safety verification of nonlinear hybrid systems based on invariant clusters. In Proceedings of the 20th International Conference on Hybrid Systems (pp. 163–172). Pittsburgh, PA, United States: ACM. https://doi.org/10.1145/3049797.3049814
[Submitted Version]
View
| Files available
| DOI
2017 |Published| Journal Article | IST-REx-ID: 6730 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kudekar, S., Kumar, S., Mondelli, M., Pfister, H. D., Sasoglu, E., & Urbanke, R. L. (2017). Reed–Muller codes achieve capacity on erasure channels. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/tit.2017.2673829
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv