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.
4268 Publications
2017 |Published| Journal Article | IST-REx-ID: 626 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Barton NH, Etheridge A, Véber A. 2017. The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. 118, 50–73.
[Published Version]
View
| Files available
| DOI
2017 |Published| Book Chapter | IST-REx-ID: 625 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Doyen L, Henzinger TA. 2017.The cost of exactness in quantitative reachability. In: Models, Algorithms, Logics and Tools. LNCS, vol. 10460, 367–381.
[Submitted Version]
View
| Files available
| DOI
2017 |Published| Journal Article | IST-REx-ID: 624 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Nikolic N, Didara Z, Moll I. 2017. MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. 2017(9), 3830.
[Published Version]
View
| Files available
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 628 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Fu H, Murhekar A. 2017. Automated recurrence analysis for almost linear expected runtime bounds. CAV: Computer Aided Verification, LNCS, vol. 10426, 118–139.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
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, Urbauer P, Mense A. 2017. Biosignals standards and FHIR: The way to go. eHealth: Health Informatics Meets eHealth, Studies in Health Technology and Informatics, vol. 236, 356–362.
[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. 145(6), 2441–2454.
[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 JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. 2017. Scrypt is maximally memory hard. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 33–62.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 636 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Bakhirkin A, Ferrere T, Maler O, Ulus D. 2017. On the quantitative semantics of regular expressions over real-valued signals. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 189–206.
[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 JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 3–32.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Technical Report | IST-REx-ID: 6426 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST Austria, 28p.
[Published Version]
View
| Files available
| DOI
2017 |Published| Journal Article | IST-REx-ID: 642 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Gerencser M, Gyöngy I. 2017. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 86(307), 2373–2397.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 645 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Journal Article | IST-REx-ID: 644 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 646 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 235–246.
[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. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 600–613.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 650 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Skórski M. 2017. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 586–599.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 6519 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82, 18.
[Published Version]
View
| Files available
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 6517 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International Symposium on Algorithms and Computation vol. 92, 34.
[Published Version]
View
| Files available
| DOI
2017 |Published| Journal Article | IST-REx-ID: 653 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Makohon Moore A, Zhang M, Reiter J, Božić I, Allen B, Kundu D, Chatterjee K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 49(3), 358–366.
[Submitted Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2017 |Published| Conference Paper | IST-REx-ID: 6527 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Alwen JF, Blocki J, Harsha B. 2017. Practical graphs for optimal side-channel resistant memory-hard functions. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 1001–1017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)