Alternating-time temporal logic
R. Alur, T.A. Henzinger, O. Kupferman, Journal of the ACM 49 (2002) 672–713.
LibreCat: https://research-explorer.ista.ac.at/record/4595
DOI: 10.1145/585265.585270

Sliver exudation
S. Cheng, T. Dey, H. Edelsbrunner, M. Facello, S. Teng, Journal of the ACM 47 (2000) 883–904.
LibreCat: https://research-explorer.ista.ac.at/record/4010
DOI: 10.1145/355483.355487

Randomized fully dynamic graph algorithms with polylogarithmic time per operation
M.H. Henzinger, V. King, Journal of the ACM 46 (1999) 502–516.
LibreCat: https://research-explorer.ista.ac.at/record/11769
DOI: 10.1145/320211.320215

Alternating-time temporal logic
R. Alur, T.A. Henzinger, O. Kupferman, in:, Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Association for Computing Machinery (ACM), 1997, pp. 100–109.
LibreCat: https://research-explorer.ista.ac.at/record/4609
DOI: 10.1145/585265.585270

The benefits of relaxing punctuality
R. Alur, T. Feder, T.A. Henzinger, Journal of the ACM 43 (1996) 116–146.
LibreCat: https://research-explorer.ista.ac.at/record/4610
DOI: 10.1145/227595.227602

A really temporal logic
R. Alur, T.A. Henzinger, Journal of the ACM 41 (1994) 181–204.
LibreCat: https://research-explorer.ista.ac.at/record/4591
DOI: 10.1145/174644.174651

An optimal algorithm for intersecting line segments in the plane
B. Chazelle, H. Edelsbrunner, Journal of the ACM 39 (1992) 1–54.
LibreCat: https://research-explorer.ista.ac.at/record/4046
DOI: 10.1145/147508.147511