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.
107 Publications
2004 | Conference Paper | IST-REx-ID: 11800
The past, present, and future of web search engines
M.H. Henzinger, in:, 31st International Colloquium on Automata, Languages and Programming, Springer Nature, 2004, p. 3.
View
| DOI
M.H. Henzinger, in:, 31st International Colloquium on Automata, Languages and Programming, Springer Nature, 2004, p. 3.
2000 | Conference Paper | IST-REx-ID: 11802
Web information retrieval - an algorithmic perspective
M.H. Henzinger, in:, 8th Annual European Symposium on Algorithms, Springer Nature, 2000, pp. 1–8.
View
| DOI
M.H. Henzinger, in:, 8th Annual European Symposium on Algorithms, Springer Nature, 2000, pp. 1–8.
1997 | Conference Paper | IST-REx-ID: 11803
Maintaining minimum spanning trees in dynamic graphs
M.H. Henzinger, V. King, in:, 24th International Colloquium on Automata, Languages and Programming, Springer Nature, 1997, pp. 594–604.
View
| DOI
M.H. Henzinger, V. King, in:, 24th International Colloquium on Automata, Languages and Programming, Springer Nature, 1997, pp. 594–604.
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.
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.