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.

646 Publications


2017 | Published | Journal Article | IST-REx-ID: 11676 | OA
Dvořák W, Henzinger M, Williamson DP. 2017. Maximizing a submodular function with viability constraints. Algorithmica. 77(1), 152–172.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 1168 | OA
Perrone E, Rappold A, Müller W. 2017. D inf s optimality in copula models. Statistical Methods and Applications. 26(3), 403–418.
[Submitted Version] View | Files available | DOI | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1169 | OA
Novak S, Kollár R. 2017. Spatial gene frequency waves under genotype dependent dispersal. Genetics. 205(1), 367–374.
[Submitted Version] View | Files available | DOI | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1173 | OA
Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. 2017. The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica. 37(5), 887–910.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 1174 | OA
Skórski M. 2017. Lower bounds on key derivation for square-friendly applications. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 66, 57.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 1175 | OA
Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67, 38:1-38-21.
[Published Version] View | Files available | DOI | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 1176 | OA
Alwen JF, Blocki J. 2017. Towards practical attacks on Argon2i and balloon hashing. EuroS&P: European Symposium on Security and Privacy, 7961977.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

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

2017 | Published | Conference Paper | IST-REx-ID: 1178 | OA
Skórski M. 2017. Simulating auxiliary inputs, revisited. TCC: Theory of Cryptography Conference, LNCS, vol. 9985, 159–179.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

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

2017 | Published | Conference Paper | IST-REx-ID: 11829 | OA
Henzinger M, Lincoln A, Neumann S, Vassilevska Williams V. 2017. Conditional hardness for sensitivity problems. 8th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science Conference, LIPIcs, vol. 67, 26.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 11831 | OA
Goranci G, Henzinger M, Peng P. 2017. Improved guarantees for vertex sparsification in planar graphs. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 44.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 11832 | OA
Henzinger M, Leniowski D, Mathieu C. 2017. Dynamic clustering to minimize the sum of radii. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 48.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 11833 | OA
Goranci G, Henzinger M, Peng P. 2017. The power of vertex sparsifiers in dynamic graph algorithms. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 45.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

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

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

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

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

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

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

Filters and Search Terms

year=2017

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed