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 | OA
Towards practical attacks on Argon2i and balloon hashing
J.F. Alwen, J. Blocki, in:, IEEE, 2017.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 11772
The state of the art in dynamic graph algorithms
M. Henzinger, in:, 44th International Conference on Current Trends in Theory and Practice of Computer Science, Springer Nature, 2017, pp. 40–44.
View | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 1178 | OA
Simulating auxiliary inputs, revisited
M. Skórski, in:, Springer, 2017, pp. 159–179.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1180 | OA
Algebraic vertices of non-convex polyhedra
A. Akopyan, I. Bárány, S. Robins, Advances in Mathematics 308 (2017) 627–644.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 11829 | OA
Conditional hardness for sensitivity problems
M. Henzinger, A. Lincoln, S. Neumann, V. Vassilevska Williams, in:, 8th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 11831 | OA
Improved guarantees for vertex sparsification in planar graphs
G. Goranci, M. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 11832 | OA
Dynamic clustering to minimize the sum of radii
M. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 11833 | OA
The power of vertex sparsifiers in dynamic graph algorithms
G. Goranci, M. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 1187 | OA
Efficient authentication from hard learning problems
E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275.
[Submitted Version] View | Files available | DOI | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 11873 | OA
Local flow partitioning for faster edge connectivity
M. Henzinger, S. Rao, D. Wang, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 1919–1938.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 11874 | OA
Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time
S. Bhattacharya, M. Henzinger, D. Nanongkai, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 470–489.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 11903 | OA
Welfare maximization with friends-of-friends network externalities
S. Bhattacharya, W. Dvořák, M. Henzinger, M. Starnberger, Theory of Computing Systems 61 (2017) 948–986.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2017 | Published | Journal Article | IST-REx-ID: 1191 | OA
Existence of traveling waves for the generalized F–KPP equation
R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.
[Preprint] View | DOI | Download Preprint (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 1192 | OA
Even delta-matroids and the complexity of planar Boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 1194 | OA
Stochastic invariants for probabilistic termination
K. Chatterjee, P. Novotný, D. Zikelic, in:, ACM, 2017, pp. 145–160.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1196
Model measuring for discrete and hybrid systems
T.A. Henzinger, J. Otop, Nonlinear Analysis: Hybrid Systems 23 (2017) 166–190.
View | DOI | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 11961
The Hitchhiker’s Guide to flow chemistry
M.B. Plutschack, B. Pieber, K. Gilmore, P.H. Seeberger, Chemical Reviews 117 (2017) 11796–11893.
View | DOI | PubMed | Europe PMC
 

2017 | Published | Journal Article | IST-REx-ID: 11976 | OA
Integrated flow processing - challenges in continuous multistep synthesis
B. Pieber, K. Gilmore, P.H. Seeberger, Journal of Flow Chemistry 7 (2017) 129–136.
[Published Version] View | DOI | Download Published Version (ext.)
 

2017 | Published | Journal Article | IST-REx-ID: 1199 | OA
How does epistasis influence the response to selection?
N.H. Barton, Heredity 118 (2017) 96–109.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 169 | OA
Twisted Linnik implies optimal covering exponent for S3
T.D. Browning, V. Kumaraswamy, R. Steiner, International Mathematics Research Notices (2017).
View | DOI | Download None (ext.) | arXiv
 

Filters and Search Terms

year=2017

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed