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.
1752 Publications
2017 | Published | Conference Paper | IST-REx-ID: 637 | 
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 | Published | Conference Paper | IST-REx-ID: 640 |
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 | Published | Conference Paper | IST-REx-ID: 641
V. Trajkovska, P. Swoboda, F. Åström, and S. Petra, “Graphical model parameter learning by inverse linear programming,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 323–334.
View
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 645 |
P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Published | Conference Paper | IST-REx-ID: 648 |
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 | Published | Conference Paper | IST-REx-ID: 650 |
M. Skórski, “A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 586–599.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Published | Conference Paper | IST-REx-ID: 6519 |
K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 6527 |
J. F. Alwen, J. Blocki, and B. Harsha, “Practical graphs for optimal side-channel resistant memory-hard functions,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA, 2017, pp. 1001–1017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Published | Journal Article | IST-REx-ID: 659 |
F. Kage et al., “FMNL formins boost lamellipodial force generation,” Nature Communications, vol. 8. Nature Publishing Group, 2017.
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 663 |
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 | Published | Conference Paper | IST-REx-ID: 6729 |
M. Mondelli, S. H. Hassani, and R. Urbanke, “Construction of polar codes with sublinear complexity,” in 2017 IEEE International Symposium on Information Theory , Aachen, Germany, 2017, pp. 1853–1857.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 695
F. Etl, A. Franschitz, A. Aguiar, J. Schönenberger, and S. Dötterl, “A perfume collecting male oil bee? Evidences of a novel pollination system involving Anthurium acutifolium Araceae and Paratetrapedia chocoensis Apidae Tapinotaspidini,” Flora: Morphology, Distribution, Functional Ecology of Plants, vol. 232. Elsevier, pp. 7–15, 2017.
View
| DOI
2017 | Published | Journal Article | IST-REx-ID: 701 |
J. Kynčl and Z. Patakova, “On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4,” The Electronic Journal of Combinatorics, vol. 24, no. 3. International Press, pp. 1–44, 2017.
[Submitted Version]
View
| Files available
2017 | Published | Journal Article | IST-REx-ID: 716 |
K. Chatterjee and Y. Velner, “The complexity of mean-payoff pushdown games,” Journal of the ACM, vol. 64, no. 5. ACM, p. 34, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 717 |
K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” Journal of Computer and System Sciences, vol. 88. Academic Press, pp. 236–259, 2017.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2017 | Published | Journal Article | IST-REx-ID: 720 |
J. Humplik and G. Tkačik, “Probabilistic models for neural populations that naturally capture global coupling and criticality,” PLoS Computational Biology, vol. 13, no. 9. Public Library of Science, 2017.
[Published Version]
View
| Files available
| DOI
2017 | Published | Journal Article | IST-REx-ID: 721 |
O. H. Ajanki, T. H. Krüger, and L. Erdös, “Singularities of solutions to quadratic vector equations on the complex upper half plane,” Communications on Pure and Applied Mathematics, vol. 70, no. 9. Wiley-Blackwell, pp. 1672–1705, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)