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.
50 Publications
1999 | Published | Conference Paper | IST-REx-ID: 4602
Automating modular verification
R. Alur, L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 10th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1999, pp. 82–97.
View
| DOI
R. Alur, L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 10th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1999, pp. 82–97.
1999 | Published | Journal Article | IST-REx-ID: 8526
An extension of the Artin-Mazur theorem
V. Kaloshin, The Annals of Mathematics 150 (1999) 729–741.
View
| DOI
V. Kaloshin, The Annals of Mathematics 150 (1999) 729–741.
1999 | Published | Journal Article | IST-REx-ID: 883
Interactions among quantitative traits in the course of sympatric speciation
A. Kondrashov, F. Kondrashov, Nature 400 (1999) 351–354.
View
| DOI
| PubMed | Europe PMC
A. Kondrashov, F. Kondrashov, Nature 400 (1999) 351–354.
1999 | Published | Journal Article | IST-REx-ID: 11679
Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
M.H. Henzinger, V. King, T. Warnow, Algorithmica 24 (1999) 1–13.
View
| Files available
| DOI
M.H. Henzinger, V. King, T. Warnow, Algorithmica 24 (1999) 1–13.
1999 | Published | Journal Article | IST-REx-ID: 11687
Finding related pages in the world wide Web
J. Dean, M.H. Henzinger, Computer Networks 31 (1999) 1467–1479.
View
| DOI
J. Dean, M.H. Henzinger, Computer Networks 31 (1999) 1467–1479.
1999 | Published | Journal Article | IST-REx-ID: 11688
Measuring index quality using random walks on the web
M.H. Henzinger, A. Heydon, M. Mitzenmacher, M. Najork, Computer Networks 31 (1999) 1291–1303.
View
| DOI
M.H. Henzinger, A. Heydon, M. Mitzenmacher, M. Najork, Computer Networks 31 (1999) 1291–1303.
1999 | Published | Conference Paper | IST-REx-ID: 11691
Scheduling data transfers in a network and the set scheduling problem
A. Goel, M.H. Henzinger, S. Plotkin, E. Tardos, in:, Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 1999, pp. 189–197.
View
| DOI
A. Goel, M.H. Henzinger, S. Plotkin, E. Tardos, in:, Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 1999, pp. 189–197.
1999 | Published | Journal Article | IST-REx-ID: 11769
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
M.H. Henzinger, V. King, Journal of the ACM 46 (1999) 502–516.
View
| DOI
M.H. Henzinger, V. King, Journal of the ACM 46 (1999) 502–516.
1999 | Published | Journal Article | IST-REx-ID: 11895 | 
Analysis of a very large web search engine query log
C. Silverstein, H. Marais, M.H. Henzinger, M. Moricz, ACM SIGIR Forum 33 (1999) 6–12.
[Published Version]
View
| DOI
| Download Published Version (ext.)
C. Silverstein, H. Marais, M.H. Henzinger, M. Moricz, ACM SIGIR Forum 33 (1999) 6–12.
1999 | Published | Conference Paper | IST-REx-ID: 11925
Scheduling multicasts on unit-capacity trees and meshes
M.H. Henzinger, S. Leonardi , in:, 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial & Applied Mathematics, 1999, pp. 438–447.
View
M.H. Henzinger, S. Leonardi , in:, 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial & Applied Mathematics, 1999, pp. 438–447.