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.
1790 Publications
2017 |Published| Conference Paper | IST-REx-ID: 633
Bak S, Bogomolov S, Henzinger TA, Kumar A. Challenges and tool implementation of hybrid rapidly exploring random trees. In: Abate A, Bodo S, eds. Vol 10381. Springer; 2017:83-89. doi:10.1007/978-3-319-63501-9_6
View
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 635 | 
Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. Scrypt is maximally memory hard. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:33-62. doi: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 A, Ferrere T, Maler O, Ulus D. On the quantitative semantics of regular expressions over real-valued signals. In: Abate A, Geeraerts G, eds. Vol 10419. Springer; 2017:189-206. doi: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 S, Martel M, Prabhakar P, eds. Numerical Software Verification. Vol 10152. Springer; 2017. doi:10.1007/978-3-319-54292-8
View
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 640 |
Alwen JF, Blocki J, Pietrzak KZ. Depth-robust graphs and their cumulative memory complexity. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:3-32. doi: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 V, Swoboda P, Åström F, Petra S. Graphical model parameter learning by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:323-334. doi:10.1007/978-3-319-58771-4_26
View
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 645 |
Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. Value iteration for long run average reward in markov decision processes. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:201-221. doi: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 J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi: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 M. On the complexity of breaking pseudoentropy. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:600-613. doi: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 J. Entropic Ricci curvature for discrete spaces. In: Najman L, Romon P, eds. Modern Approaches to Discrete Curvature. Vol 2184. Lecture Notes in Mathematics. Springer; 2017:159-174. doi:10.1007/978-3-319-58002-9_5
View
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 650 |
Skórski M. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:586-599. doi: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 K, Dvorák W, Henzinger MH, Loitzenbauer V. Improved set-based symbolic algorithms for parity games. In: Vol 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik; 2017. doi:10.4230/LIPICS.CSL.2017.18
[Published Version]
View
| Files available
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 6527 |
Alwen JF, Blocki J, Harsha B. Practical graphs for optimal side-channel resistant memory-hard functions. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM Press; 2017:1001-1017. doi:10.1145/3133956.3134031
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Journal Article | IST-REx-ID: 659 |
Kage F, Winterhoff M, Dimchev V, et al. FMNL formins boost lamellipodial force generation. Nature Communications. 2017;8. doi:10.1038/ncomms14832
[Published Version]
View
| Files available
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 663 |
Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. Safety verification of nonlinear hybrid systems based on invariant clusters. In: Proceedings of the 20th International Conference on Hybrid Systems. ACM; 2017:163-172. doi:10.1145/3049797.3049814
[Submitted Version]
View
| Files available
| DOI
2017 |Published| Journal Article | IST-REx-ID: 669 |
Synek L, Vukašinović N, Kulich I, et al. EXO70C2 is a key regulatory factor for optimal tip growth of pollen. Plant Physiology. 2017;174(1):223-240. doi:10.1104/pp.16.01282
[Submitted Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2017 |Published| Conference Paper | IST-REx-ID: 6729 |
Mondelli M, Hassani SH, Urbanke R. Construction of polar codes with sublinear complexity. In: 2017 IEEE International Symposium on Information Theory . IEEE; 2017:1853-1857. doi:10.1109/isit.2017.8006850
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2017 |Published| Journal Article | IST-REx-ID: 695
Etl F, Franschitz A, Aguiar A, Schönenberger J, Dötterl S. 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. 2017;232:7-15. doi:10.1016/j.flora.2017.02.020
View
| DOI
2017 |Published| Journal Article | IST-REx-ID: 701 |
Kynčl J, Patakova Z. On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4. The Electronic Journal of Combinatorics. 2017;24(3):1-44.
[Submitted Version]
View
| Files available
2017 |Published| Journal Article | IST-REx-ID: 716 |
Chatterjee K, Velner Y. The complexity of mean-payoff pushdown games. Journal of the ACM. 2017;64(5):34. doi:10.1145/3121408
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv