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.
LibreCat: https://research-explorer.ista.ac.at/record/15267
DOI: 10.1145/3446383
arXiv: 1703.01859

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.
LibreCat: https://research-explorer.ista.ac.at/record/6972
DOI: 10.1145/3339471
WoS: 000496514100001
arXiv: 1705.06173

T. Ferrere, O. Maler, D. Nidkovi, and A. Pnueli, “From real-time logic to timed automata,” Journal of the ACM, vol. 66, no. 3. ACM, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/7109
DOI: 10.1145/3286976
WoS: 000495406300005

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.
LibreCat: https://research-explorer.ista.ac.at/record/7108
DOI: 10.1145/3314024
WoS: 000495406300007
arXiv: 1711.08436

M. H. 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.
LibreCat: https://research-explorer.ista.ac.at/record/11768
DOI: 10.1145/3218657
arXiv: 1512.08148

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.
LibreCat: https://research-explorer.ista.ac.at/record/4595
DOI: 10.1145/585265.585270

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.
LibreCat: https://research-explorer.ista.ac.at/record/4010
DOI: 10.1145/355483.355487

M. H. 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.
LibreCat: https://research-explorer.ista.ac.at/record/11769
DOI: 10.1145/320211.320215

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.
LibreCat: https://research-explorer.ista.ac.at/record/4609
DOI: 10.1145/585265.585270

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.
LibreCat: https://research-explorer.ista.ac.at/record/4610
DOI: 10.1145/227595.227602

R. Alur and T. A. Henzinger, “A really temporal logic,” Journal of the ACM, vol. 41, no. 1. ACM, pp. 181–204, 1994.
LibreCat: https://research-explorer.ista.ac.at/record/4591
DOI: 10.1145/174644.174651

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.
LibreCat: https://research-explorer.ista.ac.at/record/4046
DOI: 10.1145/147508.147511