Czumaj, Artur, and Peter Davies. “Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks.”10.1145/3446383__Journal of the ACM, vol. 68, no. 2, 13, Association for Computing Machinery, 2021, doi:10.1145/3446383.
LibreCat: https://research-explorer.ista.ac.at/record/15267
DOI: 10.1145/3446383
arXiv: 1703.01859

Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.”10.1145/3339471__Journal of the ACM, vol. 66, no. 5, 32, ACM, 2019, doi:10.1145/3339471.
LibreCat: https://research-explorer.ista.ac.at/record/6972
DOI: 10.1145/3339471
WoS: 000496514100001
arXiv: 1705.06173

Ferrere, Thomas, et al. “From Real-Time Logic to Timed Automata.”10.1145/3286976__Journal of the ACM, vol. 66, no. 3, 19, ACM, 2019, doi:10.1145/3286976.
LibreCat: https://research-explorer.ista.ac.at/record/7109
DOI: 10.1145/3286976
WoS: 000495406300005

Goaoc, Xavier, et al. “Shellability Is NP-Complete.”10.1145/3314024__Journal of the ACM, vol. 66, no. 3, 21, ACM, 2019, doi:10.1145/3314024.
LibreCat: https://research-explorer.ista.ac.at/record/7108
DOI: 10.1145/3314024
WoS: 000495406300007
arXiv: 1711.08436

Henzinger, Monika H., et al. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.”10.1145/3218657__Journal of the ACM, vol. 65, no. 6, Association for Computing Machinery, 2018, pp. 1–40, doi:10.1145/3218657.
LibreCat: https://research-explorer.ista.ac.at/record/11768
DOI: 10.1145/3218657
arXiv: 1512.08148

Alur, Rajeev, et al. “Alternating-Time Temporal Logic.”10.1145/585265.585270__Journal of the ACM, vol. 49, no. 5, ACM, 2002, pp. 672–713, doi:10.1145/585265.585270.
LibreCat: https://research-explorer.ista.ac.at/record/4595
DOI: 10.1145/585265.585270

Cheng, Siu, et al. “Sliver Exudation.”10.1145/355483.355487__Journal of the ACM, vol. 47, no. 5, ACM, 2000, pp. 883–904, doi:10.1145/355483.355487.
LibreCat: https://research-explorer.ista.ac.at/record/4010
DOI: 10.1145/355483.355487

Henzinger, Monika H., and Valerie King. “Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation.”10.1145/320211.320215__Journal of the ACM, vol. 46, no. 4, Association for Computing Machinery, 1999, pp. 502–16, doi:10.1145/320211.320215.
LibreCat: https://research-explorer.ista.ac.at/record/11769
DOI: 10.1145/320211.320215

Alur, Rajeev, et al. “Alternating-Time Temporal Logic.”10.1145/585265.585270__Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Association for Computing Machinery (ACM), 1997, pp. 100–09, doi:10.1145/585265.585270.
LibreCat: https://research-explorer.ista.ac.at/record/4609
DOI: 10.1145/585265.585270

Alur, Rajeev, et al. “The Benefits of Relaxing Punctuality.”10.1145/227595.227602__Journal of the ACM, vol. 43, no. 1, ACM, 1996, pp. 116–46, doi:10.1145/227595.227602.
LibreCat: https://research-explorer.ista.ac.at/record/4610
DOI: 10.1145/227595.227602

Alur, Rajeev, and Thomas A. Henzinger. “A Really Temporal Logic.”10.1145/174644.174651__Journal of the ACM, vol. 41, no. 1, ACM, 1994, pp. 181–204, doi:10.1145/174644.174651.
LibreCat: https://research-explorer.ista.ac.at/record/4591
DOI: 10.1145/174644.174651

Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting Line Segments in the Plane.”10.1145/147508.147511__Journal of the ACM, vol. 39, no. 1, ACM, 1992, pp. 1–54, doi:10.1145/147508.147511.
LibreCat: https://research-explorer.ista.ac.at/record/4046
DOI: 10.1145/147508.147511