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.
10552 Publications
2017 | Published | Journal Article | IST-REx-ID: 1162 | 
J. Spałek, M. Zegrodnik, and J. Kaczmarczyk, “Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment,” Physical Review B - Condensed Matter and Materials Physics, vol. 95, no. 2. American Physical Society, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Submitted | Preprint | IST-REx-ID: 11633 |
L. A. Bugnet, R. A. Garcia, G. R. Davies, S. Mathur, and E. Corsaro, “FliPer: Checking the reliability of global seismic parameters from automatic pipelines,” arXiv. .
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Published | Conference Paper | IST-REx-ID: 11651 |
D. Wang, K. Fountoulakis, M. Henzinger, M. W. Mahoney, and Satish Rao , “Capacity releasing diffusion for speed and locality,” in Proceedings of the 34th International Conference on Machine Learning, Sydney, Australia, 2017, vol. 70, pp. 3598–3607.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 11665 |
M. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks,” ACM Transactions on Algorithms, vol. 13, no. 4. Association for Computing Machinery, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 11676 |
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 |
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: 1173 |
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
2017 | Published | Conference Paper | IST-REx-ID: 1174 |
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 |
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
2017 | Published | Conference Paper | IST-REx-ID: 1176 |
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: 1178 |
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 | Conference Paper | IST-REx-ID: 11829 |
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 |
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 |
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 |
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 |
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 |
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 |
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