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.

7296 Publications


2017 | Published | Journal Article | IST-REx-ID: 11665 | OA
Henzinger, M., Krinninger, S., & Nanongkai, D. (2017). Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. ACM Transactions on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3146550
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 11676 | OA
Dvořák, W., Henzinger, M., & Williamson, D. P. (2017). Maximizing a submodular function with viability constraints. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-015-0066-y
[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. Springer. https://doi.org/10.1007/s10260-016-0375-6
[Submitted Version] View | Files available | DOI | WoS
 

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

2017 | Published | Conference Paper | IST-REx-ID: 1178 | OA
Skórski, M. (2017). Simulating auxiliary inputs, revisited (Vol. 9985, pp. 159–179). Presented at the TCC: Theory of Cryptography Conference, Springer. https://doi.org/10.1007/978-3-662-53641-4_7
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 11829 | OA
Henzinger, M., Lincoln, A., Neumann, S., & Vassilevska Williams, V. (2017). Conditional hardness for sensitivity problems. In 8th Innovations in Theoretical Computer Science Conference (Vol. 67). Berkley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2017.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. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2017.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. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2017.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. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2017.45
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 11873 | OA
Henzinger, M., Rao, S., & Wang, D. (2017). Local flow partitioning for faster edge connectivity. In 28th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1919–1938). Barcelona, Spain: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782.125
[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. In 28th Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 0, pp. 470–489). Barcelona, Spain: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782.30
[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. Springer Nature. https://doi.org/10.1007/s00224-017-9759-8
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2017 | Published | Journal Article | IST-REx-ID: 11976 | OA
Pieber, B., Gilmore, K., & Seeberger, P. H. (2017). Integrated flow processing - challenges in continuous multistep synthesis. Journal of Flow Chemistry. AKJournals. https://doi.org/10.1556/1846.2017.00016
[Published Version] View | DOI | Download Published Version (ext.)
 

2017 | Published | Journal Article | IST-REx-ID: 169 | OA
Browning, T. D., Kumaraswamy, V., & Steiner, R. (2017). Twisted Linnik implies optimal covering exponent for S3. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnx116
View | DOI | Download None (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 172 | OA
Browning, T. D., & Schindler, D. (2017). Strong approximation and a conjecture of Harpaz and Wittenberg. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnx252
View | DOI | Download None (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 17616 | OA
D’Orazio, D. J., & Haiman, Z. (2017). Lighthouse in the dust: infrared echoes of periodic emission from massive black hole binaries★. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stx1269
[Published Version] View | DOI | Download Published Version (ext.)
 

2017 | Published | Journal Article | IST-REx-ID: 17630 | OA
Penoyre, Z., & Haiman, Z. (2017). A drop in the pond: The effect of rapid mass-loss on the dynamics and interaction rate of collisionless particles. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stx2469
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 17632 | OA
Leigh, N. W. C., Geller, A. M., McKernan, B., Ford, K. E. S., Mac Low, M.-M., Bellovary, J., … Endlich, S. (2017). On the rate of black hole binary mergers in galactic nuclei due to dynamical hardening. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stx3134
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 17633 | OA
Ryu, T., Perna, R., Haiman, Z., Ostriker, J. P., & Stone, N. C. (2017). Interactions between multiple supermassive black holes in galactic nuclei: A solution to the final parsec problem. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stx2524
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 17667 | OA
Regan, J. A., Visbal, E., Wise, J. H., Haiman, Z., Johansson, P. H., & Bryan, G. L. (2017). Rapid formation of massive black holes in close proximity to embryonic protogalaxies. Nature Astronomy. Springer Science and Business Media LLC. https://doi.org/10.1038/s41550-017-0075
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

oa=1

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed