Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
140 Publications
1996 | Conference Paper | IST-REx-ID: 11804
Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
M.H. Henzinger, J.A. Telle, in:, 5th Scandinavian Workshop on Algorithm Theory, Springer Nature, 1996, pp. 16–27.
View
| DOI
M.H. Henzinger, J.A. Telle, in:, 5th Scandinavian Workshop on Algorithm Theory, Springer Nature, 1996, pp. 16–27.
1996 | Conference Paper | IST-REx-ID: 11910
Improved sampling with applications to dynamic graph algorithms
M.H. Henzinger, M. Thorup, in:, 23rd International Colloquium on Automata, Languages, and Programming, Springer Nature, 1996, pp. 290–299.
View
| DOI
M.H. Henzinger, M. Thorup, in:, 23rd International Colloquium on Automata, Languages, and Programming, Springer Nature, 1996, pp. 290–299.
1996 | Book (Editor) | IST-REx-ID: 4612
Hybrid Systems III: Verification and Control
R. Alur, T.A. Henzinger, E.D. Sontag, eds., Hybrid Systems III: Verification and Control, Springer, Berlin ; Heidelberg, 1996.
View
| DOI
R. Alur, T.A. Henzinger, E.D. Sontag, eds., Hybrid Systems III: Verification and Control, Springer, Berlin ; Heidelberg, 1996.
1995 | Conference Paper | IST-REx-ID: 11806
Approximating minimum cuts under insertions
M.H. Henzinger, in:, 22nd International Colloquium on Automata, Languages and Programming, Springer Nature, 1995, pp. 280–291.
View
| DOI
M.H. Henzinger, in:, 22nd International Colloquium on Automata, Languages and Programming, Springer Nature, 1995, pp. 280–291.
1995 | Conference Paper | IST-REx-ID: 11805
Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
M.H. Henzinger, H. Poutré, in:, 3rd Annual European Symposium on Algorithms, Springer Nature, 1995, pp. 171–184.
View
| DOI
M.H. Henzinger, H. Poutré, in:, 3rd Annual European Symposium on Algorithms, Springer Nature, 1995, pp. 171–184.