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.
1850 Publications
2018 |Published| Journal Article | IST-REx-ID: 692 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
A. Akopyan, “3-Webs generated by confocal conics and circles,” Geometriae Dedicata, vol. 194, no. 1. Springer, pp. 55–64, 2018.
[Published Version]
View
| Files available
| DOI
| WoS
2018 |Published| Journal Article | IST-REx-ID: 77 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
H. Watzinger et al., “A germanium hole spin qubit,” Nature Communications, vol. 9, no. 3902. Nature Publishing Group, 2018.
[Published Version]
View
| Files available
| DOI
| WoS
2018 |Published| Journal Article | IST-REx-ID: 410 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M. A. Jösch, and D. Cox, “A micro-CT-based method for quantitative brain lesion characterization and electrode localization,” Scientific Reports, vol. 8, no. 1. Nature Publishing Group, 2018.
[Published Version]
View
| Files available
| DOI
| WoS
2018 |Published| Conference Paper | IST-REx-ID: 299 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, and D. Ulus, “AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10806, pp. 303–319.
[Published Version]
View
| Files available
| DOI
| WoS
2018 |Published| Conference Paper | IST-REx-ID: 5791 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
R. Fulek and C. D. Tóth, “Crossing minimization in perturbed drawings,” presented at the Graph Drawing and Network Visualization, Barcelona, Spain, 2018, vol. 11282, pp. 229–241.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |Published| Journal Article | IST-REx-ID: 58 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
A. Akopyan and E. Segal Halevi, “Counting blanks in polygonal arrangements,” SIAM Journal on Discrete Mathematics, vol. 32, no. 3. Society for Industrial and Applied Mathematics , pp. 2242–2257, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |Published| Journal Article | IST-REx-ID: 425 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3-Sphere is decidable,” Journal of the ACM, vol. 65, no. 1. ACM, 2018.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |Published| Journal Article | IST-REx-ID: 62 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
A. Shabazi et al., “Flexible learning-free segmentation and reconstruction of neural volumes,” Scientific Reports, vol. 8, no. 1. Nature Publishing Group, 2018.
[Published Version]
View
| Files available
| DOI
| WoS
2018 |Published| Journal Article | IST-REx-ID: 5672 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
A. Reversat and M. K. Sixt, “IgM’s exit route,” Journal of Experimental Medicine, vol. 215, no. 12. Rockefeller University Press, pp. 2959–2961, 2018.
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Conference Paper | IST-REx-ID: 5788 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |Published| Conference Paper | IST-REx-ID: 160 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
B. Kragl and S. Qadeer, “Layered Concurrent Programs,” presented at the CAV: Computer Aided Verification, Oxford, UK, 2018, vol. 10981, pp. 79–102.
[Published Version]
View
| Files available
| DOI
| WoS
2018 |Published| Conference Paper | IST-REx-ID: 81 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
A. Elgyütt, T. Ferrere, and T. A. Henzinger, “Monitoring temporal logic with clock variables,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China, 2018, vol. 11022, pp. 53–70.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 |Published| Journal Article | IST-REx-ID: 76 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing squads,” Distributed Computing. Springer, 2018.
[Published Version]
View
| Files available
| DOI
| WoS
2018 |Published| Journal Article | IST-REx-ID: 530 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
H. Edelsbrunner and M. Iglesias Ham, “Multiple covers with balls I: Inclusion–exclusion,” Computational Geometry: Theory and Applications, vol. 68. Elsevier, pp. 119–133, 2018.
[Preprint]
View
| Files available
| DOI
| WoS
2018 | Conference Paper | IST-REx-ID: 5679 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Huang, H. Fu, and K. Chatterjee, “New approaches for almost-sure termination of probabilistic programs,” presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand, 2018, vol. 11275, pp. 181–201.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv