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
Henzinger, Thomas A, and Ritankar 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, 1785:142–56. Springer, 2000. https://doi.org/10.1007/3-540-46419-0_11.
View
| DOI
2000 |
Published |
Conference Paper |
IST-REx-ID: 4439
Henzinger, Thomas A, and Ritankar Majumdar. “A Classification of Symbolic Transition Systems.” In Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, 1770:13–34. Springer, 2000. https://doi.org/10.1007/3-540-46541-3_2.
View
| DOI
2000 |
Published |
Conference Paper |
IST-REx-ID: 4481
Henzinger, Thomas A, Benjamin Horowitz, Ritankar Majumdar, and Howard Wong Toi. “Beyond HyTech: Hybrid Systems Analysis Using Interval Numerical Methods.” In Proceedings of the 3rd International Workshop on Hybrid Systems, 1790:130–44. Springer, 2000. https://doi.org/10.1007/3-540-46430-1_14.
View
| DOI
2000 |
Published |
Conference Paper |
IST-REx-ID: 4482
Henzinger, Thomas A, Ritankar Majumdar, Freddy Mang, and Jean Raskin. “Abstract Interpretation of Game Properties.” In Proceedings of the 7th International Symposium on Static Analysis, 1824:220–39. Springer, 2000. https://doi.org/10.1007/978-3-540-45099-3_12.
View
| DOI
2000 |
Published |
Conference Paper |
IST-REx-ID: 4483
Henzinger, Thomas A, Shaz Qadeer, and Sriram Rajamani. “Decomposing Refinement Proofs Using Assume-Guarantee Reasoning.” In Proceedings of the 2000 International Conference on Computer-Aided Design, 245–52. IEEE, 2000. https://doi.org/10.1109/ICCAD.2000.896481.
View
| DOI
2000 |
Published |
Conference Paper |
IST-REx-ID: 4512
Henzinger, Thomas A. “Masaccio: A Formal Model for Embedded Components.” In Proceedings of the 1st International Conference on Theoretical Computer Science , 1872:549–63. Springer, 2000. https://doi.org/10.1007/3-540-44929-9_38.
View
| DOI
2000 |
Published |
Book Chapter |
IST-REx-ID: 4513
Henzinger, Thomas A. “The Theory of Hybrid Automata.” In Verification of Digital and Hybrid Systems, edited by M. Inan and Robert Kurshan, 170:265–92. Springer, 2000. https://doi.org/10.1007/978-3-642-59615-5.
View
| DOI
2000 |
Published |
Journal Article |
IST-REx-ID: 4598
Alur, Rajeev, Thomas A Henzinger, Gerardo Lafferriere, and George Pappas. “Discrete Abstractions of Hybrid Systems.” Proceedings of the IEEE. IEEE, 2000. https://doi.org/10.1109/5.871304 .
View
| DOI
2000 |
Published |
Conference Paper |
IST-REx-ID: 4627
De Alfaro, Luca, and Thomas A Henzinger. “Concurrent Omega-Regular Games.” In Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 141–54. IEEE, 2000. https://doi.org/10.1109/LICS.2000.855763.
View
| DOI
2000 |
Published |
Conference Paper |
IST-REx-ID: 4637
De Alfaro, Luca, Thomas A Henzinger, and Freddy Mang. “The Control of Synchronous Systems.” In Proceedings of the 11th International Conference on Concurrency Theory, 1877:458–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2000. https://doi.org/10.1007/3-540-44618-4_33.
View
| DOI
2000 |
Published |
Conference Paper |
IST-REx-ID: 4638
De Alfaro, Luca, Thomas A Henzinger, and Freddy Mang. “Detecting Errors before Reaching Them.” In Proceedings of the 12th International Conference on Computer Aided Verification, 1855:186–201. Springer, 2000. https://doi.org/10.1007/10722167_17.
View
| DOI
1999 |
Published |
Journal Article |
IST-REx-ID: 8526
Kaloshin, Vadim. “An Extension of the Artin-Mazur Theorem.” The Annals of Mathematics. JSTOR, 1999. https://doi.org/10.2307/121093.
View
| DOI
1999 |
Published |
Journal Article |
IST-REx-ID: 883
Kondrashov, Alexey, and Fyodor Kondrashov. “Interactions among Quantitative Traits in the Course of Sympatric Speciation.” Nature. Nature Publishing Group, 1999. https://doi.org/10.1038/22514.
View
| DOI
| PubMed | Europe PMC
1999 |
Published |
Journal Article |
IST-REx-ID: 11679
Henzinger, Monika H, V. King, and T. Warnow. “Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.” Algorithmica. Springer Nature, 1999. https://doi.org/10.1007/pl00009268.
View
| Files available
| DOI
1999 |
Published |
Journal Article |
IST-REx-ID: 11687
Dean, Jeffrey, and Monika H Henzinger. “Finding Related Pages in the World Wide Web.” Computer Networks. Elsevier, 1999. https://doi.org/10.1016/s1389-1286(99)00022-5.
View
| DOI
1999 |
Published |
Journal Article |
IST-REx-ID: 11688
Henzinger, Monika H, Allan Heydon, Michael Mitzenmacher, and Marc Najork. “Measuring Index Quality Using Random Walks on the Web.” Computer Networks. Elsevier, 1999. https://doi.org/10.1016/s1389-1286(99)00016-x.
View
| DOI
1999 |
Published |
Conference Paper |
IST-REx-ID: 11691
Goel, Ashish, Monika H Henzinger, Serge Plotkin, and Eva Tardos. “Scheduling Data Transfers in a Network and the Set Scheduling Problem.” In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 189–97. Association for Computing Machinery, 1999. https://doi.org/10.1145/301250.301300.
View
| DOI
1999 |
Published |
Journal Article |
IST-REx-ID: 11769
Henzinger, Monika H, and Valerie King. “Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation.” Journal of the ACM. Association for Computing Machinery, 1999. https://doi.org/10.1145/320211.320215.
View
| DOI
1999 |
Published |
Journal Article |
IST-REx-ID: 11895 |
Silverstein, Craig, Hannes Marais, Monika H Henzinger, and Michael Moricz. “Analysis of a Very Large Web Search Engine Query Log.” ACM SIGIR Forum. Association for Computing Machinery, 1999. https://doi.org/10.1145/331403.331405.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1999 |
Published |
Conference Paper |
IST-REx-ID: 11925
Henzinger, Monika H, and Stefano Leonardi . “Scheduling Multicasts on Unit-Capacity Trees and Meshes.” In 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 438–47. Society for Industrial & Applied Mathematics, 1999.
View