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.
6 Publications
2021 |
Published |
Journal Article |
IST-REx-ID: 15267 |
Exploiting spontaneous transmissions for broadcasting and leader election in radio networks
A. Czumaj, P. Davies, Journal of the ACM 68 (2021).
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
A. Czumaj, P. Davies, Journal of the ACM 68 (2021).
2019 |
Published |
Journal Article |
IST-REx-ID: 6752 |
Infinite-duration bidding games
G. Avni, T.A. Henzinger, V.K. Chonev, Journal of the ACM 66 (2019).
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
G. Avni, T.A. Henzinger, V.K. Chonev, Journal of the ACM 66 (2019).
2018 |
Published |
Journal Article |
IST-REx-ID: 11768 |
Decremental single-source shortest paths on undirected graphs in near-linear total update time
M. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018) 1–40.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
M. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018) 1–40.
2006 |
Published |
Journal Article |
IST-REx-ID: 3979
Interface surfaces for protein-protein complexes
Y. Ban, H. Edelsbrunner, J. Rudolph, Journal of the ACM 53 (2006) 361–378.
View
| DOI
Y. Ban, H. Edelsbrunner, J. Rudolph, Journal of the ACM 53 (2006) 361–378.
1999 |
Published |
Journal Article |
IST-REx-ID: 11769
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
M. Henzinger, V. King, Journal of the ACM 46 (1999) 502–516.
View
| DOI
M. Henzinger, V. King, Journal of the ACM 46 (1999) 502–516.
1992 |
Published |
Journal Article |
IST-REx-ID: 4046
An optimal algorithm for intersecting line segments in the plane
B. Chazelle, H. Edelsbrunner, Journal of the ACM 39 (1992) 1–54.
View
| DOI
| Download None (ext.)
B. Chazelle, H. Edelsbrunner, Journal of the ACM 39 (1992) 1–54.