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.

4188 Publications


2017 | Journal Article | IST-REx-ID: 626 | OA
Barton, Nicholas H., et al. “The Infinitesimal Model: Definition Derivation and Implications.” Theoretical Population Biology, vol. 118, Academic Press, 2017, pp. 50–73, doi:10.1016/j.tpb.2017.06.001.
[Published Version] View | Files available | DOI
 

2017 | Book Chapter | IST-REx-ID: 625 | OA
Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.” Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.
[Submitted Version] View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 624 | OA
Nikolic, Nela, et al. “MazF Activation Promotes Translational Heterogeneity of the GrcA MRNA in Escherichia Coli Populations.” PeerJ, vol. 2017, no. 9, 3830, PeerJ, 2017, doi:10.7717/peerj.3830.
[Published Version] View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 628 | OA
Chatterjee, Krishnendu, et al. Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 118–39, doi:10.1007/978-3-319-63387-9_6.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Conference Paper | IST-REx-ID: 630 | OA
Sauermann, Stefan, et al. Biosignals Standards and FHIR: The Way to Go. Vol. 236, IOS Press, 2017, pp. 356–62, doi:10.3233/978-1-61499-759-7-356.
[Published Version] View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 632 | OA
Lewin, Mathieu, et al. “A Note on 2D Focusing Many Boson Systems.” Proceedings of the American Mathematical Society, vol. 145, no. 6, American Mathematical Society, 2017, pp. 2441–54, doi:10.1090/proc/13468.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Conference Paper | IST-REx-ID: 635 | OA
Alwen, Joel F., et al. Scrypt Is Maximally Memory Hard. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 33–62, doi:10.1007/978-3-319-56617-7_2.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Conference Paper | IST-REx-ID: 636 | OA
Bakhirkin, Alexey, et al. On the Quantitative Semantics of Regular Expressions over Real-Valued Signals. Edited by Alessandro Abate and Gilles Geeraerts, vol. 10419, Springer, 2017, pp. 189–206, doi:10.1007/978-3-319-65765-3_11.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Conference Paper | IST-REx-ID: 640 | OA
Alwen, Joel F., et al. Depth-Robust Graphs and Their Cumulative Memory Complexity. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 3–32, doi:10.1007/978-3-319-56617-7_1.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Technical Report | IST-REx-ID: 6426 | OA
Henzinger, Thomas A., et al. Synchronizing the Asynchronous. IST Austria, 2017, doi:10.15479/AT:IST-2018-853-v2-2.
[Published Version] View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 642 | OA
Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” Mathematics of Computation, vol. 86, no. 307, American Mathematical Society, 2017, pp. 2373–97, doi:10.1090/mcom/3201.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Conference Paper | IST-REx-ID: 645 | OA
Ashok, Pranav, et al. Value Iteration for Long Run Average Reward in Markov Decision Processes. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 201–21, doi:10.1007/978-3-319-63387-9_10.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Journal Article | IST-REx-ID: 644 | OA
Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2017 | Conference Paper | IST-REx-ID: 646 | OA
Kuske, Jan, et al. A Novel Convex Relaxation for Non Binary Discrete Tomography. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:10.1007/978-3-319-58771-4_19.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Conference Paper | IST-REx-ID: 648 | OA
Skórski, Maciej. On the Complexity of Breaking Pseudoentropy. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 600–13, doi:10.1007/978-3-319-55911-7_43.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Conference Paper | IST-REx-ID: 650 | OA
Skórski, Maciej. A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 586–99, doi:10.1007/978-3-319-55911-7_42.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Conference Paper | IST-REx-ID: 6519 | OA
Chatterjee, Krishnendu, et al. Improved Set-Based Symbolic Algorithms for Parity Games. Vol. 82, 18, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017, doi:10.4230/LIPICS.CSL.2017.18.
[Published Version] View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 6517 | OA
Fulek, Radoslav. Embedding Graphs into Embedded Graphs. Vol. 92, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ISAAC.2017.34.
[Published Version] View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 653 | OA
Makohon Moore, Alvin, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics, vol. 49, no. 3, Nature Publishing Group, 2017, pp. 358–66, doi:10.1038/ng.3764.
[Submitted Version] View | Files available | DOI | PubMed | Europe PMC
 

2017 | Conference Paper | IST-REx-ID: 6527 | OA
Alwen, Joel F., et al. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–17, doi:10.1145/3133956.3134031.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

Filters and Search Terms

oa=1

extern<>1

Search

Filter Publications