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 | 
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: 7108 |
Goaoc, X., Patak, P., Patakova, Z., Tancer, M., & Wagner, U. (2019). Shellability is NP-complete. Journal of the ACM. ACM. https://doi.org/10.1145/3314024
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 6972 |
Lenzen, C., & Rybicki, J. (2019). Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. ACM. https://doi.org/10.1145/3339471
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 7109
Ferrere, T., Maler, O., Ničković, D., & Pnueli, A. (2019). From real-time logic to timed automata. Journal of the ACM. ACM. https://doi.org/10.1145/3286976
View
| DOI
| WoS
2019 | Published | Journal Article | IST-REx-ID: 6752 |
Avni, Guy, Infinite-duration bidding games. Journal of the ACM 66 (4). 2019
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 11768 |
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
2017 | Published | Journal Article | IST-REx-ID: 716 |
Chatterjee, Krishnendu, The complexity of mean-payoff pushdown games. Journal of the ACM 64 (5). 2017
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2002 | Published | Journal Article | IST-REx-ID: 4595
Alur, R., Henzinger, T. A., & Kupferman, O. (2002). Alternating-time temporal logic. Journal of the ACM. ACM. https://doi.org/10.1145/585265.585270
View
| DOI
2000 | Published | Journal Article | IST-REx-ID: 4010
Cheng, S., Dey, T., Edelsbrunner, H., Facello, M., & Teng, S. (2000). Sliver exudation. Journal of the ACM. ACM. https://doi.org/10.1145/355483.355487
View
| DOI
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
1997 | Published | Conference Paper | IST-REx-ID: 4609
Alur, R., Henzinger, T. A., & Kupferman, O. (1997). Alternating-time temporal logic. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (pp. 100–109). Washington, DC, United States: Association for Computing Machinery (ACM). https://doi.org/10.1145/585265.585270
View
| DOI
1996 | Published | Journal Article | IST-REx-ID: 4610
Alur, R., Feder, T., & Henzinger, T. A. (1996). The benefits of relaxing punctuality. Journal of the ACM. ACM. https://doi.org/10.1145/227595.227602
View
| DOI
| Download None (ext.)
1994 | Published | Journal Article | IST-REx-ID: 4591
Alur, R., & Henzinger, T. A. (1994). A really temporal logic. Journal of the ACM. ACM. https://doi.org/10.1145/174644.174651
View
| DOI
| Download None (ext.)
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.)