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 

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 

Ferrere, T., Maler, O., Nidkovi, D., &; Pnueli, A. (2019). From real-time logic to timed automata. Journal of the ACM. ACM.https://doi.org/10.1145/3286976 

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 

Henzinger, M. H., 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 

Alur, R., Henzinger, T. A., &; Kupferman, O. (2002). Alternating-time temporal logic. Journal of the ACM. ACM.https://doi.org/10.1145/585265.585270 

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 

Henzinger, M. H., &; 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 

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 

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 

Alur, R., &; Henzinger, T. A. (1994). A really temporal logic. Journal of the ACM. ACM.https://doi.org/10.1145/174644.174651 

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