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.
640 Publications
2017 | Published | Conference Paper | IST-REx-ID: 1176 | 
Alwen JF, Blocki J. Towards practical attacks on Argon2i and balloon hashing. In: IEEE; 2017. doi:10.1109/EuroSP.2017.47
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Published | Conference Paper | IST-REx-ID: 11772
Henzinger M. The state of the art in dynamic graph algorithms. In: 44th International Conference on Current Trends in Theory and Practice of Computer Science. Vol 10706. Springer Nature; 2017:40–44. doi:10.1007/978-3-319-73117-9_3
View
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 1178 |
Skórski M. Simulating auxiliary inputs, revisited. In: Vol 9985. Springer; 2017:159-179. doi:10.1007/978-3-662-53641-4_7
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Published | Journal Article | IST-REx-ID: 1180 |
Akopyan A, Bárány I, Robins S. Algebraic vertices of non-convex polyhedra. Advances in Mathematics. 2017;308:627-644. doi:10.1016/j.aim.2016.12.026
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Published | Conference Paper | IST-REx-ID: 11829 |
Henzinger M, Lincoln A, Neumann S, Vassilevska Williams V. Conditional hardness for sensitivity problems. In: 8th Innovations in Theoretical Computer Science Conference. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ITCS.2017.26
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 11831 |
Goranci G, Henzinger M, Peng P. Improved guarantees for vertex sparsification in planar graphs. In: 25th Annual European Symposium on Algorithms. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.44
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 11832 |
Henzinger M, Leniowski D, Mathieu C. Dynamic clustering to minimize the sum of radii. In: 25th Annual European Symposium on Algorithms. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.48
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 11833 |
Goranci G, Henzinger M, Peng P. The power of vertex sparsifiers in dynamic graph algorithms. In: 25th Annual European Symposium on Algorithms. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.45
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 1187 |
Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. Efficient authentication from hard learning problems. Journal of Cryptology. 2017;30(4):1238-1275. doi:10.1007/s00145-016-9247-3
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Published | Conference Paper | IST-REx-ID: 11873 |
Henzinger M, Rao S, Wang D. Local flow partitioning for faster edge connectivity. In: 28th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2017:1919-1938. doi:10.1137/1.9781611974782.125
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 11874 |
Bhattacharya S, Henzinger M, Nanongkai D. Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. In: 28th Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 0. Society for Industrial and Applied Mathematics; 2017:470-489. doi:10.1137/1.9781611974782.30
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 11903 |
Bhattacharya S, Dvořák W, Henzinger M, Starnberger M. Welfare maximization with friends-of-friends network externalities. Theory of Computing Systems. 2017;61(4):948-986. doi:10.1007/s00224-017-9759-8
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2017 | Published | Journal Article | IST-REx-ID: 1191 |
Kollár R, Novak S. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 2017;79(3):525-559. doi:10.1007/s11538-016-0244-3
[Preprint]
View
| DOI
| Download Preprint (ext.)
2017 | Published | Conference Paper | IST-REx-ID: 1192 |
Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar Boolean CSPs. In: SIAM; 2017:307-326. doi:10.1137/1.9781611974782.20
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Published | Conference Paper | IST-REx-ID: 1194 |
Chatterjee K, Novotný P, Zikelic D. Stochastic invariants for probabilistic termination. In: Vol 52. ACM; 2017:145-160. doi:10.1145/3009837.3009873
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Published | Journal Article | IST-REx-ID: 1196
Henzinger TA, Otop J. Model measuring for discrete and hybrid systems. Nonlinear Analysis: Hybrid Systems. 2017;23:166-190. doi:10.1016/j.nahs.2016.09.001
View
| DOI
| WoS
2017 | Published | Journal Article | IST-REx-ID: 11961
Plutschack MB, Pieber B, Gilmore K, Seeberger PH. The Hitchhiker’s Guide to flow chemistry. Chemical Reviews. 2017;117(18):11796-11893. doi:10.1021/acs.chemrev.7b00183
View
| DOI
| PubMed | Europe PMC
2017 | Published | Journal Article | IST-REx-ID: 11976 |
Pieber B, Gilmore K, Seeberger PH. Integrated flow processing - challenges in continuous multistep synthesis. Journal of Flow Chemistry. 2017;7(3-4):129-136. doi:10.1556/1846.2017.00016
[Published Version]
View
| DOI
| Download Published Version (ext.)
2017 | Published | Journal Article | IST-REx-ID: 1199 |
Barton NH. How does epistasis influence the response to selection? Heredity. 2017;118:96-109. doi:10.1038/hdy.2016.109
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Published | Journal Article | IST-REx-ID: 169 |
Browning TD, Kumaraswamy V, Steiner R. Twisted Linnik implies optimal covering exponent for S3. International Mathematics Research Notices. 2017. doi:10.1093/imrn/rnx116
View
| DOI
| Download None (ext.)
| arXiv