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.

14 Publications


2021 | Published | Journal Article | IST-REx-ID: 15267 | OA
A. Czumaj and P. Davies, “Exploiting spontaneous transmissions for broadcasting and leader election in radio networks,” Journal of the ACM, vol. 68, no. 2. Association for Computing Machinery, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2019 | Published | Journal Article | IST-REx-ID: 6972 | OA
C. Lenzen and J. Rybicki, “Self-stabilising Byzantine clock synchronisation is almost as easy as consensus,” Journal of the ACM, vol. 66, no. 5. ACM, 2019.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2019 | Published | Journal Article | IST-REx-ID: 7109
T. Ferrere, O. Maler, D. Ničković, and A. Pnueli, “From real-time logic to timed automata,” Journal of the ACM, vol. 66, no. 3. ACM, 2019.
View | DOI | WoS
 

2019 | Published | Journal Article | IST-REx-ID: 7108 | OA
X. Goaoc, P. Patak, Z. Patakova, M. Tancer, and U. Wagner, “Shellability is NP-complete,” Journal of the ACM, vol. 66, no. 3. ACM, 2019.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Published | Journal Article | IST-REx-ID: 6752 | OA
G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” Journal of the ACM, vol. 66, no. 4. ACM, 2019.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Journal Article | IST-REx-ID: 11768 | OA
M. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” Journal of the ACM, vol. 65, no. 6. Association for Computing Machinery, pp. 1–40, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 716 | OA
K. Chatterjee and Y. Velner, “The complexity of mean-payoff pushdown games,” Journal of the ACM, vol. 64, no. 5. ACM, p. 34, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2002 | Published | Journal Article | IST-REx-ID: 4595
R. Alur, T. A. Henzinger, and O. Kupferman, “Alternating-time temporal logic,” Journal of the ACM, vol. 49, no. 5. ACM, pp. 672–713, 2002.
View | DOI
 

2000 | Published | Journal Article | IST-REx-ID: 4010
S. Cheng, T. Dey, H. Edelsbrunner, M. Facello, and S. Teng, “Sliver exudation,” Journal of the ACM, vol. 47, no. 5. ACM, pp. 883–904, 2000.
View | DOI
 

1999 | Published | Journal Article | IST-REx-ID: 11769
M. Henzinger and V. King, “Randomized fully dynamic graph algorithms with polylogarithmic time per operation,” Journal of the ACM, vol. 46, no. 4. Association for Computing Machinery, pp. 502–516, 1999.
View | DOI
 

1997 | Published | Conference Paper | IST-REx-ID: 4609
R. Alur, T. A. Henzinger, and O. Kupferman, “Alternating-time temporal logic,” in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Washington, DC, United States, 1997, pp. 100–109.
View | DOI
 

1996 | Published | Journal Article | IST-REx-ID: 4610
R. Alur, T. Feder, and T. A. Henzinger, “The benefits of relaxing punctuality,” Journal of the ACM, vol. 43, no. 1. ACM, pp. 116–146, 1996.
View | DOI | Download None (ext.)
 

1994 | Published | Journal Article | IST-REx-ID: 4591
R. Alur and T. A. Henzinger, “A really temporal logic,” Journal of the ACM, vol. 41, no. 1. ACM, pp. 181–204, 1994.
View | DOI | Download None (ext.)
 

1992 | Published | Journal Article | IST-REx-ID: 4046
B. Chazelle and H. Edelsbrunner, “An optimal algorithm for intersecting line segments in the plane,” Journal of the ACM, vol. 39, no. 1. ACM, pp. 1–54, 1992.
View | DOI | Download None (ext.)
 

Filters and Search Terms

issn=0004-5411

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed