Constant-time dynamic weight approximation for minimum spanning forest
M.H. Henzinger, P. Peng, Information and Computation 281 (2021).
LibreCat: https://research-explorer.ista.ac.at/record/11756
DOI: 10.1016/j.ic.2021.104805
arXiv: 2011.00977

Dynamic algorithms via the primal-dual method
S. Bhattacharya, M.H. Henzinger, G. Italiano, Information and Computation 261 (2018) 219–239.
LibreCat: https://research-explorer.ista.ac.at/record/11757
DOI: 10.1016/j.ic.2018.02.005

38th International Colloquium on Automata, Languages and Programming
L. Aceto, M.H. Henzinger, J. Sgall, Information and Computation 222 (2013) 1.
LibreCat: https://research-explorer.ista.ac.at/record/11758
DOI: 10.1016/j.ic.2012.11.002

Fair simulation
T.A. Henzinger, O. Kupferman, S. Rajamani, Information and Computation 173 (2002) 64–81.
LibreCat: https://research-explorer.ista.ac.at/record/4474
DOI: 10.1006/inco.2001.3085

Temporal proof methodologies for timed transition systems
T.A. Henzinger, Z. Manna, A. Pnueli, Information and Computation 112 (1994) 273–337.
LibreCat: https://research-explorer.ista.ac.at/record/4501
DOI: 10.1006/inco.1994.1060

Symbolic model checking for real-time systems
T.A. Henzinger, X. Nicollin, J. Sifakis, S. Yovine, Information and Computation 111 (1994) 193–244.
LibreCat: https://research-explorer.ista.ac.at/record/4503
DOI: 10.1006/inco.1994.1045