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


2021 | Published | Journal Article | IST-REx-ID: 15267 | OA
Czumaj, A., & Davies, P. (2021). Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. Journal of the ACM. Association for Computing Machinery. https://doi.org/10.1145/3446383
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2019 | Published | Journal Article | IST-REx-ID: 6752 | OA
Avni, G., Henzinger, T. A., & Chonev, V. K. (2019). Infinite-duration bidding games. Journal of the ACM. ACM. https://doi.org/10.1145/3340295
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Journal Article | IST-REx-ID: 11768 | OA
Henzinger, M., Krinninger, S., & Nanongkai, D. (2018). Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. Association for Computing Machinery. https://doi.org/10.1145/3218657
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

1999 | Published | Journal Article | IST-REx-ID: 11769
Henzinger, M., & King, V. (1999). Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM. Association for Computing Machinery. https://doi.org/10.1145/320211.320215
View | DOI
 

1992 | Published | Journal Article | IST-REx-ID: 4046
Chazelle, B., & Edelsbrunner, H. (1992). An optimal algorithm for intersecting line segments in the plane. Journal of the ACM. ACM. https://doi.org/10.1145/147508.147511
View | DOI | Download None (ext.)
 

Filters and Search Terms

eissn=1557-735X

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed