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.
6561 Publications
2017 | Published | Journal Article | IST-REx-ID: 11676 |
Maximizing a submodular function with viability constraints
W. Dvořák, M. Henzinger, D.P. Williamson, Algorithmica 77 (2017) 152–172.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
W. Dvořák, M. Henzinger, D.P. Williamson, Algorithmica 77 (2017) 152–172.
2017 | Published | Journal Article | IST-REx-ID: 1168 |
D inf s optimality in copula models
E. Perrone, A. Rappold, W. Müller, Statistical Methods and Applications 26 (2017) 403–418.
[Submitted Version]
View
| Files available
| DOI
| WoS
E. Perrone, A. Rappold, W. Müller, Statistical Methods and Applications 26 (2017) 403–418.
2017 | Published | Journal Article | IST-REx-ID: 1169 |
Spatial gene frequency waves under genotype dependent dispersal
S. Novak, R. Kollár, Genetics 205 (2017) 367–374.
[Submitted Version]
View
| Files available
| DOI
| WoS
S. Novak, R. Kollár, Genetics 205 (2017) 367–374.
2017 | Published | Journal Article | IST-REx-ID: 1173 |
The Voronoi functional is maximized by the Delaunay triangulation in the plane
H. Edelsbrunner, A. Glazyrin, O. Musin, A. Nikitenko, Combinatorica 37 (2017) 887–910.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
H. Edelsbrunner, A. Glazyrin, O. Musin, A. Nikitenko, Combinatorica 37 (2017) 887–910.
2017 | Published | Conference Paper | IST-REx-ID: 1174 |
Lower bounds on key derivation for square-friendly applications
M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
2017 | Published | Conference Paper | IST-REx-ID: 1175 |
Cumulative space in black-white pebbling and resolution
J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.
[Published Version]
View
| Files available
| DOI
J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.
2017 | Published | Conference Paper | IST-REx-ID: 1176 |
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
J.F. Alwen, J. Blocki, in:, IEEE, 2017.
2017 | Published | Conference Paper | IST-REx-ID: 1178 |
Simulating auxiliary inputs, revisited
M. Skórski, in:, Springer, 2017, pp. 159–179.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
M. Skórski, in:, Springer, 2017, pp. 159–179.
2017 | Published | Journal Article | IST-REx-ID: 1180 |
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
A. Akopyan, I. Bárány, S. Robins, Advances in Mathematics 308 (2017) 627–644.
2017 | Published | Conference Paper | IST-REx-ID: 11829 |
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
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.
2017 | Published | Conference Paper | IST-REx-ID: 11831 |
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
G. Goranci, M. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
2017 | Published | Conference Paper | IST-REx-ID: 11832 |
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
M. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
2017 | Published | Conference Paper | IST-REx-ID: 11833 |
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
G. Goranci, M. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
2017 | Published | Journal Article | IST-REx-ID: 1187 |
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
E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275.
2017 | Published | Conference Paper | IST-REx-ID: 11873 |
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
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.
2017 | Published | Conference Paper | IST-REx-ID: 11874 |
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
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.
2017 | Published | Journal Article | IST-REx-ID: 11903 |
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.)
S. Bhattacharya, W. Dvořák, M. Henzinger, M. Starnberger, Theory of Computing Systems 61 (2017) 948–986.
2017 | Published | Journal Article | IST-REx-ID: 1191 |
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.)
R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.
2017 | Published | Conference Paper | IST-REx-ID: 1192 |
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
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
2017 | Published | Conference Paper | IST-REx-ID: 1194 |
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
K. Chatterjee, P. Novotný, D. Zikelic, in:, ACM, 2017, pp. 145–160.