Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
C. Lenzen, J. Rybicki, Journal of the ACM 66 (2019).

Shellability is NP-complete
X. Goaoc, P. Patak, Z. Patakova, M. Tancer, U. Wagner, Journal of the ACM 66 (2019).

From real-time logic to timed automata
T. Ferrere, O. Maler, D. Nidkovi, A. Pnueli, Journal of the ACM 66 (2019).

Decremental single-source shortest paths on undirected graphs in near-linear total update time
M.H. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018) 1–40.

Alternating-time temporal logic
R. Alur, T.A. Henzinger, O. Kupferman, Journal of the ACM 49 (2002) 672–713.

Sliver exudation
S. Cheng, T. Dey, H. Edelsbrunner, M. Facello, S. Teng, Journal of the ACM 47 (2000) 883–904.

Randomized fully dynamic graph algorithms with polylogarithmic time per operation
M.H. Henzinger, V. King, Journal of the ACM 46 (1999) 502–516.

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.

The benefits of relaxing punctuality
R. Alur, T. Feder, T.A. Henzinger, Journal of the ACM 43 (1996) 116–146.

A really temporal logic
R. Alur, T.A. Henzinger, Journal of the ACM 41 (1994) 181–204.

An optimal algorithm for intersecting line segments in the plane
B. Chazelle, H. Edelsbrunner, Journal of the ACM 39 (1992) 1–54.