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.
5 Publications
2022 | Journal Article | IST-REx-ID: 11662
Henzinger, M. H., & Peng, P. (2022). Constant-time Dynamic (Δ +1)-Coloring. ACM Transactions on Algorithms. Association for Computing Machinery (ACM). https://doi.org/10.1145/3501403
View
| DOI
2021 | Journal Article | IST-REx-ID: 11663 |
Bernstein, A., Forster, S., & Henzinger, M. H. (2021). A deamortization approach for dynamic spanner and dynamic maximal matching. ACM Transactions on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3469833
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 9541 |
Czumaj, A., Davies, P., & Parter, M. (2021). Graph sparsification for derandomizing massively parallel computation with low space. ACM Transactions on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3451992
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2018 | Journal Article | IST-REx-ID: 11664 |
Goranci, G., Henzinger, M. H., & Thorup, M. (2018). Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3174803
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Journal Article | IST-REx-ID: 11665 |
Henzinger, M. H., 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