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.
1624 Publications
2017 |Published| Conference Paper | IST-REx-ID: 635 | 
Alwen, Joel F, Binchi Chen, Krzysztof Z Pietrzak, Leonid Reyzin, and Stefano Tessaro. “Scrypt Is Maximally Memory Hard.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:33–62. Springer, 2017. 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: 636 |
Bakhirkin, Alexey, Thomas Ferrere, Oded Maler, and Dogan Ulus. “On the Quantitative Semantics of Regular Expressions over Real-Valued Signals.” edited by Alessandro Abate and Gilles Geeraerts, 10419:189–206. Springer, 2017. https://doi.org/10.1007/978-3-319-65765-3_11.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference (Editor) | IST-REx-ID: 638
Bogomolov, Sergiy, Matthieu Martel, and Pavithra Prabhakar, eds. Numerical Software Verification. Vol. 10152. LNCS. Springer, 2017. https://doi.org/10.1007/978-3-319-54292-8.
View
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 640 |
Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Depth-Robust Graphs and Their Cumulative Memory Complexity.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:3–32. Springer, 2017. 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: 641
Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical Model Parameter Learning by Inverse Linear Programming.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_26.
View
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 645 |
Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_10.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 646 |
Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation for Non Binary Discrete Tomography.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:235–46. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_19.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 648 |
Skórski, Maciej. “On the Complexity of Breaking Pseudoentropy.” edited by Gerhard Jäger and Silvia Steila, 10185:600–613. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_43.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Book Chapter | IST-REx-ID: 649
Maas, Jan. “Entropic Ricci Curvature for Discrete Spaces.” In Modern Approaches to Discrete Curvature, edited by Laurent Najman and Pascal Romon, 2184:159–74. Lecture Notes in Mathematics. Springer, 2017. https://doi.org/10.1007/978-3-319-58002-9_5.
View
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 650 |
Skórski, Maciej. “A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds.” edited by Gerhard Jäger and Silvia Steila, 10185:586–99. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_42.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 6519 |
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. https://doi.org/10.4230/LIPICS.CSL.2017.18.
[Published Version]
View
| Files available
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 6527 |
Alwen, Joel F, Jeremiah Blocki, and Ben Harsha. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 1001–17. ACM Press, 2017. https://doi.org/10.1145/3133956.3134031.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Journal Article | IST-REx-ID: 659 |
Kage, Frieda, Moritz Winterhoff, Vanessa Dimchev, Jan Müller, Tobias Thalheim, Anika Freise, Stefan Brühmann, et al. “FMNL Formins Boost Lamellipodial Force Generation.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms14832.
[Published Version]
View
| Files available
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 663 |
Kong, Hui, Sergiy Bogomolov, Christian Schilling, Yu Jiang, and Thomas A Henzinger. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.” In Proceedings of the 20th International Conference on Hybrid Systems, 163–72. ACM, 2017. https://doi.org/10.1145/3049797.3049814.
[Submitted Version]
View
| Files available
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 6729 |
Mondelli, Marco, S. Hamed Hassani, and Rudiger Urbanke. “Construction of Polar Codes with Sublinear Complexity.” In 2017 IEEE International Symposium on Information Theory , 1853–57. IEEE, 2017. https://doi.org/10.1109/isit.2017.8006850.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2017 |Published| Journal Article | IST-REx-ID: 695
Etl, Florian, Anna Franschitz, Antonio Aguiar, Jürg Schönenberger, and Stefan 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. Elsevier, 2017. https://doi.org/10.1016/j.flora.2017.02.020.
View
| DOI
2017 |Published| Journal Article | IST-REx-ID: 701 |
Kynčl, Jan, and Zuzana Patakova. “On the Nonexistence of k Reptile Simplices in ℝ^3 and ℝ^4.” The Electronic Journal of Combinatorics. International Press, 2017.
[Submitted Version]
View
| Files available
2017 |Published| Journal Article | IST-REx-ID: 716 |
Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.” Journal of the ACM. ACM, 2017. https://doi.org/10.1145/3121408.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 |Published| Journal Article | IST-REx-ID: 717 |
Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Journal of Computer and System Sciences. Academic Press, 2017. https://doi.org/10.1016/j.jcss.2017.04.005.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2017 |Published| Journal Article | IST-REx-ID: 720 |
Humplik, Jan, and Gašper Tkačik. “Probabilistic Models for Neural Populations That Naturally Capture Global Coupling and Criticality.” PLoS Computational Biology. Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005763.
[Published Version]
View
| Files available
| DOI