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.

8924 Publications


2000 | Published | Conference Paper | IST-REx-ID: 4435
T. A. Henzinger and R. Majumdar, “Symbolic model checking for rectangular hybrid systems,” in Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Berlin, Germany, 2000, vol. 1785, pp. 142–156.
View | DOI
 

2000 | Published | Conference Paper | IST-REx-ID: 4439
T. A. Henzinger and R. Majumdar, “A classification of symbolic transition systems,” in Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, 2000, vol. 1770, pp. 13–34.
View | DOI
 

2000 | Published | Conference Paper | IST-REx-ID: 4481
T. A. Henzinger, B. Horowitz, R. Majumdar, and H. Wong Toi, “Beyond HyTech: Hybrid systems analysis using interval numerical methods,” in Proceedings of the 3rd International Workshop on Hybrid Systems, Pittsburgh, PA, USA, 2000, vol. 1790, pp. 130–144.
View | DOI
 

2000 | Published | Conference Paper | IST-REx-ID: 4482
T. A. Henzinger, R. Majumdar, F. Mang, and J. Raskin, “Abstract interpretation of game properties,” in Proceedings of the 7th International Symposium on Static Analysis, Santa Barbara, CA, USA, 2000, vol. 1824, pp. 220–239.
View | DOI
 

2000 | Published | Conference Paper | IST-REx-ID: 4483
T. A. Henzinger, S. Qadeer, and S. Rajamani, “Decomposing refinement proofs using assume-guarantee reasoning,” in Proceedings of the 2000 International Conference on Computer-Aided Design, San Jose, CA, USA, 2000, pp. 245–252.
View | DOI
 

2000 | Published | Conference Paper | IST-REx-ID: 4512
T. A. Henzinger, “Masaccio: A formal model for embedded components,” in Proceedings of the 1st International Conference on Theoretical Computer Science , Sendai, Japan, 2000, vol. 1872, pp. 549–563.
View | DOI
 

2000 | Published | Book Chapter | IST-REx-ID: 4513
T. A. Henzinger, “The theory of hybrid automata,” in Verification of Digital and Hybrid Systems, vol. 170, M. Inan and R. Kurshan, Eds. Springer, 2000, pp. 265–292.
View | DOI
 

2000 | Published | Journal Article | IST-REx-ID: 4598
R. Alur, T. A. Henzinger, G. Lafferriere, and G. Pappas, “Discrete abstractions of hybrid systems,” Proceedings of the IEEE, vol. 88, no. 7. IEEE, pp. 971–984, 2000.
View | DOI
 

2000 | Published | Conference Paper | IST-REx-ID: 4627
L. De Alfaro and T. A. Henzinger, “Concurrent omega-regular games,” in Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, CA, USA, 2000, pp. 141–154.
View | DOI
 

2000 | Published | Conference Paper | IST-REx-ID: 4637
L. De Alfaro, T. A. Henzinger, and F. Mang, “The control of synchronous systems,” in Proceedings of the 11th International Conference on Concurrency Theory, University Park, PA, USA, 2000, vol. 1877, pp. 458–473.
View | DOI
 

2000 | Published | Conference Paper | IST-REx-ID: 4638
L. De Alfaro, T. A. Henzinger, and F. Mang, “Detecting errors before reaching them,” in Proceedings of the 12th International Conference on Computer Aided Verification, Chicago, IL, USA, 2000, vol. 1855, pp. 186–201.
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
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed