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
W. Dvořák, M. Henzinger, and D. P. Williamson, “Maximizing a submodular function with viability constraints,” Algorithmica, vol. 77, no. 1. Springer Nature, pp. 152–172, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

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

2017 | Published | Journal Article | IST-REx-ID: 1169 | OA
S. Novak and R. Kollár, “Spatial gene frequency waves under genotype dependent dispersal,” Genetics, vol. 205, no. 1. Genetics Society of America, pp. 367–374, 2017.
[Submitted Version] View | Files available | DOI | WoS
 

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

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

2017 | Published | Conference Paper | IST-REx-ID: 1175 | OA
J. F. Alwen, S. De Rezende, J. Nordstrom, and M. Vinyals, “Cumulative space in black-white pebbling and resolution,” presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States, 2017, vol. 67, p. 38:1-38-21.
[Published Version] View | Files available | DOI | WoS
 

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

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

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

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

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

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

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

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

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

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

2017 | Published | Conference Paper | IST-REx-ID: 11874 | OA
S. Bhattacharya, M. Henzinger, and D. Nanongkai, “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, Barcelona, Spain, 2017, vol. 0, pp. 470–489.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

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

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

2017 | Published | Conference Paper | IST-REx-ID: 1192 | OA
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 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: IEEE

Export / Embed