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
R. Alur, L. De Alfaro, T. A. Henzinger, and F. Mang, “Automating modular verification,” in Proceedings of the 10th International Conference on Concurrency Theory, Eindhoven, The Netherlands, 1999, vol. 1664, pp. 82–97.
View | DOI
 

1999 | Published | Journal Article | IST-REx-ID: 8526
V. Kaloshin, “An extension of the Artin-Mazur theorem,” The Annals of Mathematics, vol. 150, no. 2. JSTOR, pp. 729–741, 1999.
View | DOI
 

1999 | Published | Journal Article | IST-REx-ID: 883
A. Kondrashov and F. Kondrashov, “Interactions among quantitative traits in the course of sympatric speciation,” Nature, vol. 400, no. 6742. Nature Publishing Group, pp. 351–354, 1999.
View | DOI | PubMed | Europe PMC
 

1999 | Published | Journal Article | IST-REx-ID: 11679
M. H. Henzinger, V. King, and T. Warnow, “Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology,” Algorithmica, vol. 24. Springer Nature, pp. 1–13, 1999.
View | Files available | DOI
 

1999 | Published | Journal Article | IST-REx-ID: 11687
J. Dean and M. H. Henzinger, “Finding related pages in the world wide Web,” Computer Networks, vol. 31, no. 11–16. Elsevier, pp. 1467–1479, 1999.
View | DOI
 

1999 | Published | Journal Article | IST-REx-ID: 11688
M. H. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, “Measuring index quality using random walks on the web,” Computer Networks, vol. 31, no. 11–16. Elsevier, pp. 1291–1303, 1999.
View | DOI
 

1999 | Published | Conference Paper | IST-REx-ID: 11691
A. Goel, M. H. Henzinger, S. Plotkin, and E. Tardos, “Scheduling data transfers in a network and the set scheduling problem,” in Proceedings of the 31st annual ACM symposium on Theory of computing, Atlanta, GA, United States, 1999, pp. 189–197.
View | DOI
 

1999 | Published | Journal Article | IST-REx-ID: 11769
M. H. Henzinger and V. King, “Randomized fully dynamic graph algorithms with polylogarithmic time per operation,” Journal of the ACM, vol. 46, no. 4. Association for Computing Machinery, pp. 502–516, 1999.
View | DOI
 

1999 | Published | Journal Article | IST-REx-ID: 11895 | OA
C. Silverstein, H. Marais, M. H. Henzinger, and M. Moricz, “Analysis of a very large web search engine query log,” ACM SIGIR Forum, vol. 33, no. 1. Association for Computing Machinery, pp. 6–12, 1999.
[Published Version] View | DOI | Download Published Version (ext.)
 

1999 | Published | Conference Paper | IST-REx-ID: 11925
M. H. Henzinger and S. Leonardi  , “Scheduling multicasts on unit-capacity trees and meshes,” in 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, United States, 1999, pp. 438–447.
View
 

Filters and Search Terms

year=1999

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed